제출 #957808

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
957808		hirayuu_oj	Handcrafted Gift (IOI20_gift)	C++17	15 / 100	108 ms	24660 KiB

gift

#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]});
        }
    }
    sort(all(mono));
    int lf=0,ri=-1;
    char fi='R';
    for(auto &[sl,sr]:mono){
        if(sl<=ri){
            ri=sr;
        }
        else{
            rep2(i,lf,ri+1){
                s[i]=fi;
            }
            if((sl-ri)%2==1){
                fi=change(fi);
            }
            lf=sl;
            ri=sr;
        }
    }
    rep2(i,lf,ri+1){
        s[i]=fi;
    }
    char now='R';
    rep(i,n){
        if(s[i]=='-'){
            now=change(now);
            s[i]=now;
        }
        else{
            now=s[i];
        }
    }
    vector<ll> cum(n+1,0);
    rep(i,n){
        cum[i+1]=cum[i];
        if(s[i]=='R'){
            cum[i+1]++;
        }
    }
    rep(i,r){
        int red=cum[b[i]+1]-cum[a[i]];
        int blue=b[i]-a[i]+1-red;
        int col=0;
        if(red)col++;
        if(blue)col++;
        if(x[i]!=col){
            return 0;
        }
    }
    craft(s);
    return 1;
}

• Subtask 1: 0 / 10
• Subtask 2: 15 / 15
• Subtask 3: 0 / 20
• Subtask 4: 0 / 25
• Subtask 5: 0 / 30