#include <bits/stdc++.h>
#include "gift.h"
using namespace std;
int construct(int n, int r, vector<int>a, vector<int>b, vector<int>x) {
vector<int>one(n+1, 0), start(n, 0);
for(int i = 0 ; i < r ; i++) {
if(x[i] == 1)
one[a[i]]++, one[b[i]+1]--, start[a[i]]++;
}
int cnt = 0;
char C = 'R';
auto c = [&] (char X) -> char {
if(X == 'R')
return 'B';
return 'R';
};
string s = "";
vector<int>change(n+1,0);
for(int i = 0 ; i < n ; i++) {
cnt += one[i];
change[i+1] = change[i];
if(!cnt || start[i] == cnt) {
change[i+1]++;
C = c(C);
}
s += C;
}
bool ok = 1;
for(int i = 0 ; i < r ; i++) {
if(x[i] == 1) {
if(change[b[i]+1] - change[a[i]+1] != 0)
ok = 0;
} else {
if(change[b[i]+1] - change[a[i]+1] == 0)
ok = 0;
}
}
if(!ok)
return 0;
craft(s);
return 1;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
3 ms |
784 KB |
Output is correct |
5 |
Correct |
138 ms |
20052 KB |
Output is correct |
6 |
Correct |
134 ms |
20020 KB |
Output is correct |
7 |
Correct |
134 ms |
20048 KB |
Output is correct |
8 |
Correct |
132 ms |
19976 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
300 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
3 ms |
692 KB |
Output is correct |
4 |
Correct |
137 ms |
20104 KB |
Output is correct |
5 |
Correct |
134 ms |
20052 KB |
Output is correct |
6 |
Correct |
132 ms |
20140 KB |
Output is correct |
7 |
Correct |
137 ms |
20076 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
288 KB |
Output is correct |
7 |
Correct |
1 ms |
304 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
296 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
392 KB |
Output is correct |
8 |
Correct |
2 ms |
312 KB |
Output is correct |
9 |
Correct |
1 ms |
340 KB |
Output is correct |
10 |
Correct |
1 ms |
344 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
3 ms |
784 KB |
Output is correct |
5 |
Correct |
138 ms |
20052 KB |
Output is correct |
6 |
Correct |
134 ms |
20020 KB |
Output is correct |
7 |
Correct |
134 ms |
20048 KB |
Output is correct |
8 |
Correct |
132 ms |
19976 KB |
Output is correct |
9 |
Correct |
1 ms |
300 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
11 |
Correct |
3 ms |
692 KB |
Output is correct |
12 |
Correct |
137 ms |
20104 KB |
Output is correct |
13 |
Correct |
134 ms |
20052 KB |
Output is correct |
14 |
Correct |
132 ms |
20140 KB |
Output is correct |
15 |
Correct |
137 ms |
20076 KB |
Output is correct |
16 |
Correct |
1 ms |
212 KB |
Output is correct |
17 |
Correct |
1 ms |
212 KB |
Output is correct |
18 |
Correct |
1 ms |
212 KB |
Output is correct |
19 |
Correct |
1 ms |
212 KB |
Output is correct |
20 |
Correct |
1 ms |
212 KB |
Output is correct |
21 |
Correct |
1 ms |
288 KB |
Output is correct |
22 |
Correct |
1 ms |
304 KB |
Output is correct |
23 |
Correct |
1 ms |
212 KB |
Output is correct |
24 |
Correct |
1 ms |
296 KB |
Output is correct |
25 |
Correct |
1 ms |
212 KB |
Output is correct |
26 |
Correct |
1 ms |
212 KB |
Output is correct |
27 |
Correct |
1 ms |
212 KB |
Output is correct |
28 |
Correct |
1 ms |
212 KB |
Output is correct |
29 |
Correct |
1 ms |
340 KB |
Output is correct |
30 |
Correct |
1 ms |
340 KB |
Output is correct |
31 |
Correct |
1 ms |
392 KB |
Output is correct |
32 |
Correct |
2 ms |
312 KB |
Output is correct |
33 |
Correct |
1 ms |
340 KB |
Output is correct |
34 |
Correct |
1 ms |
344 KB |
Output is correct |
35 |
Correct |
9 ms |
7284 KB |
Output is correct |
36 |
Correct |
9 ms |
7280 KB |
Output is correct |
37 |
Correct |
13 ms |
8044 KB |
Output is correct |
38 |
Correct |
154 ms |
20056 KB |
Output is correct |
39 |
Correct |
140 ms |
20036 KB |
Output is correct |
40 |
Correct |
144 ms |
20116 KB |
Output is correct |
41 |
Correct |
148 ms |
19976 KB |
Output is correct |
42 |
Correct |
143 ms |
20100 KB |
Output is correct |