-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDemandTrialByCombat.cpp
More file actions
69 lines (62 loc) · 1.41 KB
/
DemandTrialByCombat.cpp
File metadata and controls
69 lines (62 loc) · 1.41 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
#include <iostream>
using namespace std;
int main()
{
int testcases;
cin>>testcases;
while(testcases > 0)
{
int lannisters;
long int hours;
cin>>lannisters>>hours;
int position[lannisters];
for(int i = 0; i < lannisters; i++)
{
cin>>position[i];
}
for(long int i = 0; i < hours; i++)
{
long int count_0 = 0;
long int count_1 = 0;
int temp = position[0];
if(temp)
count_1++;
else
count_0++;
position[0] = position[1];
for(int i = 1; i < lannisters -1; i++)
{
if(position[i])
count_1++;
else
count_0++;
if(temp ==1 && position[i+1] ==1)
{
temp = position[i];
position[i] = 1;
}
else
{
temp = position[i];
position[i] = 0;
}
}
if(position[lannisters-1])
count_1++;
else
count_0++;
position[lannisters - 1] = temp;
if(count_0 == lannisters || count_1 == lannisters)
{
break;
}
}
for(int i = 0; i < lannisters; i++)
{
cout<<position[i]<<" ";
}
cout<<"\n";
testcases--;
}
return 0;
}