#include "gift.h"
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
const int maxn=5e5+5;
const string s="RB";
int pref[maxn];
int poz[maxn];
int neg[maxn];
string sol;
int construct(int n, int r, vector<int> a, vector<int> b, vector<int> x) {
for(int i=0; i<r; i++){
if(x[i]==1){
poz[a[i]]++;
neg[b[i]+1]++;
}
}
int sw=0;
bool p=0;
for(int i=0; i<n; i++){
sw-=neg[i];
if(!sw){
p^=1;
}
sw+=poz[i];
pref[i+1]=pref[i]+p;
sol.push_back(s[p]);
}
for(int i=0; i<r; i++){
if(x[i]==2 && (pref[b[i]+1]-pref[a[i]]==0 || pref[b[i]+1]-pref[a[i]]==b[i]-a[i]+1)){
return 0;
}
}
craft(sol);
return 1;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
3 ms |
588 KB |
Output is correct |
5 |
Correct |
172 ms |
15188 KB |
Output is correct |
6 |
Correct |
203 ms |
15232 KB |
Output is correct |
7 |
Correct |
165 ms |
17612 KB |
Output is correct |
8 |
Correct |
162 ms |
17620 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
3 ms |
588 KB |
Output is correct |
4 |
Correct |
164 ms |
15052 KB |
Output is correct |
5 |
Correct |
158 ms |
15012 KB |
Output is correct |
6 |
Correct |
160 ms |
14948 KB |
Output is correct |
7 |
Correct |
158 ms |
15032 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
204 KB |
Output is correct |
6 |
Correct |
1 ms |
204 KB |
Output is correct |
7 |
Correct |
1 ms |
204 KB |
Output is correct |
8 |
Correct |
1 ms |
204 KB |
Output is correct |
9 |
Correct |
1 ms |
204 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
332 KB |
Output is correct |
6 |
Correct |
1 ms |
332 KB |
Output is correct |
7 |
Correct |
1 ms |
332 KB |
Output is correct |
8 |
Correct |
2 ms |
388 KB |
Output is correct |
9 |
Correct |
1 ms |
332 KB |
Output is correct |
10 |
Correct |
1 ms |
320 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
3 ms |
588 KB |
Output is correct |
5 |
Correct |
172 ms |
15188 KB |
Output is correct |
6 |
Correct |
203 ms |
15232 KB |
Output is correct |
7 |
Correct |
165 ms |
17612 KB |
Output is correct |
8 |
Correct |
162 ms |
17620 KB |
Output is correct |
9 |
Correct |
1 ms |
204 KB |
Output is correct |
10 |
Correct |
1 ms |
204 KB |
Output is correct |
11 |
Correct |
3 ms |
588 KB |
Output is correct |
12 |
Correct |
164 ms |
15052 KB |
Output is correct |
13 |
Correct |
158 ms |
15012 KB |
Output is correct |
14 |
Correct |
160 ms |
14948 KB |
Output is correct |
15 |
Correct |
158 ms |
15032 KB |
Output is correct |
16 |
Correct |
0 ms |
204 KB |
Output is correct |
17 |
Correct |
0 ms |
204 KB |
Output is correct |
18 |
Correct |
1 ms |
204 KB |
Output is correct |
19 |
Correct |
1 ms |
204 KB |
Output is correct |
20 |
Correct |
1 ms |
204 KB |
Output is correct |
21 |
Correct |
1 ms |
204 KB |
Output is correct |
22 |
Correct |
1 ms |
204 KB |
Output is correct |
23 |
Correct |
1 ms |
204 KB |
Output is correct |
24 |
Correct |
1 ms |
204 KB |
Output is correct |
25 |
Correct |
1 ms |
204 KB |
Output is correct |
26 |
Correct |
0 ms |
204 KB |
Output is correct |
27 |
Correct |
1 ms |
204 KB |
Output is correct |
28 |
Correct |
1 ms |
204 KB |
Output is correct |
29 |
Correct |
1 ms |
332 KB |
Output is correct |
30 |
Correct |
1 ms |
332 KB |
Output is correct |
31 |
Correct |
1 ms |
332 KB |
Output is correct |
32 |
Correct |
2 ms |
388 KB |
Output is correct |
33 |
Correct |
1 ms |
332 KB |
Output is correct |
34 |
Correct |
1 ms |
320 KB |
Output is correct |
35 |
Correct |
7 ms |
4024 KB |
Output is correct |
36 |
Correct |
7 ms |
3920 KB |
Output is correct |
37 |
Correct |
14 ms |
4844 KB |
Output is correct |
38 |
Correct |
175 ms |
15968 KB |
Output is correct |
39 |
Correct |
167 ms |
17000 KB |
Output is correct |
40 |
Correct |
169 ms |
18816 KB |
Output is correct |
41 |
Correct |
169 ms |
18908 KB |
Output is correct |
42 |
Correct |
171 ms |
15320 KB |
Output is correct |