oj.uz

Submission #957827

# Submission time Handle Problem Language Result Execution time Memory
957827 2024-04-04T11:17:05 Z hirayuu_oj Handcrafted Gift (IOI20_gift) C++17
100 / 100
 207 ms 30588 KB 
#include "gift.h"
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,a,b) for(int i=(a); i<(b); i++)
#define all(x) x.begin(),x.end()
using ll=long long;

char change(char c){
    if(c=='R')return 'B';
    return 'R';
}
int construct(int n, int r, std::vector<int> a, std::vector<int> b, std::vector<int> x) {
    string s(n,'-');
    vector<pair<int,int>> mono;
    rep(i,r){
        if(x[i]==1){
            mono.push_back({a[i],b[i]+1});
        }
    }
    sort(all(mono));
    int lf=0,ri=0;
    char fi='R';
    for(auto &[sl,sr]:mono){
        if(sl<ri){
            ri=max(ri,sr);
        }
        else{
            rep2(i,lf,ri){
                s[i]=fi;
            }
            if((sl-ri)%2==0){
                fi=change(fi);
            }
            lf=sl;
            ri=sr;
        }
    }
    rep2(i,lf,ri){
        s[i]=fi;
    }
    char now='R';
    rep(i,n){
        if(s[i]=='-'){
            now=change(now);
            s[i]=now;
        }
        else{
            now=s[i];
        }
    }
    vector<ll> cumr(n+1,0);
    vector<ll> cumb(n+1,0);
    rep(i,n){
        cumr[i+1]=cumr[i];
        cumb[i+1]=cumb[i];
        if(s[i]=='R'){
            cumr[i+1]++;
        }
        else{
            cumb[i+1]++;
        }
    }
    rep(i,r){
        int red=cumr[b[i]+1]-cumr[a[i]];
        int blue=cumb[b[i]+1]-cumb[a[i]];
        int col=0;
        if(red!=0)col++;
        if(blue!=0)col++;
        if(x[i]!=col){
            return 0;
        }
    }
    craft(s);
    return 1;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 3 ms 860 KB Output is correct
5 Correct 207 ms 24916 KB Output is correct
6 Correct 156 ms 24908 KB Output is correct
7 Correct 197 ms 24768 KB Output is correct
8 Correct 154 ms 24848 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 3 ms 604 KB Output is correct
4 Correct 146 ms 20892 KB Output is correct
5 Correct 112 ms 20888 KB Output is correct
6 Correct 120 ms 20304 KB Output is correct
7 Correct 116 ms 20380 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 440 KB Output is correct

Subtask #4
25.0 / 25.0

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

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 3 ms 860 KB Output is correct
5 Correct 207 ms 24916 KB Output is correct
6 Correct 156 ms 24908 KB Output is correct
7 Correct 197 ms 24768 KB Output is correct
8 Correct 154 ms 24848 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 3 ms 604 KB Output is correct
12 Correct 146 ms 20892 KB Output is correct
13 Correct 112 ms 20888 KB Output is correct
14 Correct 120 ms 20304 KB Output is correct
15 Correct 116 ms 20380 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 440 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 504 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 7 ms 9052 KB Output is correct
36 Correct 7 ms 9304 KB Output is correct
37 Correct 12 ms 10076 KB Output is correct
38 Correct 140 ms 30588 KB Output is correct
39 Correct 179 ms 29948 KB Output is correct
40 Correct 147 ms 30464 KB Output is correct
41 Correct 139 ms 30556 KB Output is correct
42 Correct 137 ms 29944 KB Output is correct