oj.uz

Submission #385501

# Submission time Handle Problem Language Result Execution time Memory
385501 2021-04-04T13:45:25 Z taulant Handcrafted Gift (IOI20_gift) C++17
100 / 100
 254 ms 26716 KB 
#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;

void craft(string& s);

int construct(int n, int r, vector<int> a, vector<int> b, vector<int> x){
 vector<pii> one, two;
 for(int i = 0; i < r; ++i){
  if(x[i] == 1) one.push_back({a[i], b[i]});
  if(x[i] == 2) two.push_back({a[i], b[i]});
 }
 sort(one.begin(), one.end());
 sort(two.begin(), two.end());
 string ans(n, 'R');
 int f = 1;
 for(auto [l, r] : one){
  while(f <= l){
   ans[f] = ans[f-1] == 'R'? 'B' : 'R';
   ++f;
  }
  while(f <= r){
   ans[f] = ans[f-1];
   ++f;
  }
 }
 while(f < n){
  ans[f] = ans[f-1] == 'R'? 'B' : 'R';
  ++f;
 }
 // constructed a coloring, lets check if it is valid
 vector<int> diff(n, 0);
 for(int i = 1; i < n; ++i) diff[i] = diff[i-1] + (ans[i] != ans[i-1]);
 for(auto [l, r] : two){
  if(diff[l] == diff[r]) return 0;
 }
 craft(ans);
 return 1;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 5 ms 748 KB Output is correct
5 Correct 229 ms 18900 KB Output is correct
6 Correct 230 ms 18900 KB Output is correct
7 Correct 240 ms 18896 KB Output is correct
8 Correct 222 ms 18900 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 5 ms 748 KB Output is correct
4 Correct 227 ms 18900 KB Output is correct
5 Correct 230 ms 18896 KB Output is correct
6 Correct 234 ms 18384 KB Output is correct
7 Correct 228 ms 26068 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 2 ms 372 KB Output is correct
9 Correct 1 ms 364 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 2 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 5 ms 748 KB Output is correct
5 Correct 229 ms 18900 KB Output is correct
6 Correct 230 ms 18900 KB Output is correct
7 Correct 240 ms 18896 KB Output is correct
8 Correct 222 ms 18900 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 5 ms 748 KB Output is correct
12 Correct 227 ms 18900 KB Output is correct
13 Correct 230 ms 18896 KB Output is correct
14 Correct 234 ms 18384 KB Output is correct
15 Correct 228 ms 26068 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 2 ms 372 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 2 ms 364 KB Output is correct
30 Correct 2 ms 364 KB Output is correct
31 Correct 2 ms 364 KB Output is correct
32 Correct 2 ms 364 KB Output is correct
33 Correct 2 ms 364 KB Output is correct
34 Correct 2 ms 364 KB Output is correct
35 Correct 8 ms 3308 KB Output is correct
36 Correct 8 ms 3308 KB Output is correct
37 Correct 15 ms 4376 KB Output is correct
38 Correct 249 ms 26716 KB Output is correct
39 Correct 241 ms 26104 KB Output is correct
40 Correct 234 ms 26592 KB Output is correct
41 Correct 234 ms 26488 KB Output is correct
42 Correct 254 ms 26228 KB Output is correct