oj.uz

Submission #415529

# Submission time Handle Problem Language Result Execution time Memory
415529 2021-06-01T08:09:57 Z Pro_ktmr Handcrafted Gift (IOI20_gift) C++17
100 / 100
 318 ms 43760 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(x) x.begin(), x.end()
#define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
#define repi(i, a, b) for(int (i)=(a); (i)<(b); (i)++)

#include "gift.h"

vector<int> q1[500000];

int construct(int n, int r, std::vector<int> a, std::vector<int> b, std::vector<int> x) {
    rep(i, r){
        if(x[i] == 1) q1[a[i]].pb(b[i]);
    }

    vector<int> S(n, -1);
    S[0] = 0;
    int d = 0;
    rep(i, n){
        if(d < i){
            S[i] = S[i-1] ^ 1;
            d = i;
        }
        rep(j, q1[i].size()){
            repi(k, d+1, q1[i][j]+1){
                S[k] = S[i];
                d = k;
            }
        }
    }

    vector<int> sum(n+1, 0);
    rep(i, n) sum[i+1] = sum[i] + S[i];

    rep(i, r){
        if(x[i] == 2){
            int c = sum[b[i]+1] - sum[a[i]];
            if(c == 0 || c == b[i]+1-a[i]) return 0;
        }
    }

    string s(n, '?');
    rep(i, n){
        s[i] = (S[i] == 0 ? 'R' : 'B');
    }
    craft(s);
    return 1;
}

Compilation message

gift.cpp: In function 'int construct(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
gift.cpp:5:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    5 | #define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
      |                           ^
gift.cpp:13:5: note: in expansion of macro 'rep'
   13 |     rep(i, r){
      |     ^~~
gift.cpp:5:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    5 | #define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
      |                           ^
gift.cpp:20:5: note: in expansion of macro 'rep'
   20 |     rep(i, n){
      |     ^~~
gift.cpp:5:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
    5 | #define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
      |                           ^
gift.cpp:25:9: note: in expansion of macro 'rep'
   25 |         rep(j, q1[i].size()){
      |         ^~~
gift.cpp:5:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    5 | #define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
      |                                  ~~~^~~~
gift.cpp:25:9: note: in expansion of macro 'rep'
   25 |         rep(j, q1[i].size()){
      |         ^~~
gift.cpp:6:31: warning: unnecessary parentheses in declaration of 'k' [-Wparentheses]
    6 | #define repi(i, a, b) for(int (i)=(a); (i)<(b); (i)++)
      |                               ^
gift.cpp:26:13: note: in expansion of macro 'repi'
   26 |             repi(k, d+1, q1[i][j]+1){
      |             ^~~~
gift.cpp:5:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    5 | #define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
      |                           ^
gift.cpp:34:5: note: in expansion of macro 'rep'
   34 |     rep(i, n) sum[i+1] = sum[i] + S[i];
      |     ^~~
gift.cpp:5:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    5 | #define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
      |                           ^
gift.cpp:36:5: note: in expansion of macro 'rep'
   36 |     rep(i, r){
      |     ^~~
gift.cpp:5:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    5 | #define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
      |                           ^
gift.cpp:44:5: note: in expansion of macro 'rep'
   44 |     rep(i, n){
      |     ^~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 11980 KB Output is correct
2 Correct 8 ms 11980 KB Output is correct
3 Correct 12 ms 12008 KB Output is correct
4 Correct 12 ms 12560 KB Output is correct
5 Correct 219 ms 40040 KB Output is correct
6 Correct 208 ms 40072 KB Output is correct
7 Correct 294 ms 43760 KB Output is correct
8 Correct 318 ms 43756 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 11980 KB Output is correct
2 Correct 12 ms 11980 KB Output is correct
3 Correct 13 ms 12436 KB Output is correct
4 Correct 181 ms 36208 KB Output is correct
5 Correct 188 ms 36412 KB Output is correct
6 Correct 172 ms 35304 KB Output is correct
7 Correct 205 ms 35308 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 11980 KB Output is correct
2 Correct 9 ms 12036 KB Output is correct
3 Correct 9 ms 11980 KB Output is correct
4 Correct 9 ms 11980 KB Output is correct
5 Correct 9 ms 11980 KB Output is correct
6 Correct 10 ms 11980 KB Output is correct
7 Correct 11 ms 12140 KB Output is correct
8 Correct 10 ms 12108 KB Output is correct
9 Correct 12 ms 12032 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 11988 KB Output is correct
2 Correct 8 ms 12032 KB Output is correct
3 Correct 9 ms 11980 KB Output is correct
4 Correct 10 ms 12040 KB Output is correct
5 Correct 10 ms 12048 KB Output is correct
6 Correct 9 ms 12044 KB Output is correct
7 Correct 9 ms 12068 KB Output is correct
8 Correct 9 ms 12116 KB Output is correct
9 Correct 10 ms 12108 KB Output is correct
10 Correct 12 ms 12108 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 11980 KB Output is correct
2 Correct 8 ms 11980 KB Output is correct
3 Correct 12 ms 12008 KB Output is correct
4 Correct 12 ms 12560 KB Output is correct
5 Correct 219 ms 40040 KB Output is correct
6 Correct 208 ms 40072 KB Output is correct
7 Correct 294 ms 43760 KB Output is correct
8 Correct 318 ms 43756 KB Output is correct
9 Correct 8 ms 11980 KB Output is correct
10 Correct 12 ms 11980 KB Output is correct
11 Correct 13 ms 12436 KB Output is correct
12 Correct 181 ms 36208 KB Output is correct
13 Correct 188 ms 36412 KB Output is correct
14 Correct 172 ms 35304 KB Output is correct
15 Correct 205 ms 35308 KB Output is correct
16 Correct 8 ms 11980 KB Output is correct
17 Correct 9 ms 12036 KB Output is correct
18 Correct 9 ms 11980 KB Output is correct
19 Correct 9 ms 11980 KB Output is correct
20 Correct 9 ms 11980 KB Output is correct
21 Correct 10 ms 11980 KB Output is correct
22 Correct 11 ms 12140 KB Output is correct
23 Correct 10 ms 12108 KB Output is correct
24 Correct 12 ms 12032 KB Output is correct
25 Correct 11 ms 11988 KB Output is correct
26 Correct 8 ms 12032 KB Output is correct
27 Correct 9 ms 11980 KB Output is correct
28 Correct 10 ms 12040 KB Output is correct
29 Correct 10 ms 12048 KB Output is correct
30 Correct 9 ms 12044 KB Output is correct
31 Correct 9 ms 12068 KB Output is correct
32 Correct 9 ms 12116 KB Output is correct
33 Correct 10 ms 12108 KB Output is correct
34 Correct 12 ms 12108 KB Output is correct
35 Correct 15 ms 16844 KB Output is correct
36 Correct 19 ms 17000 KB Output is correct
37 Correct 26 ms 17968 KB Output is correct
38 Correct 203 ms 39136 KB Output is correct
39 Correct 215 ms 38256 KB Output is correct
40 Correct 224 ms 39300 KB Output is correct
41 Correct 229 ms 39496 KB Output is correct
42 Correct 192 ms 38024 KB Output is correct