Submission #375525

#TimeUsernameProblemLanguageResultExecution timeMemory
375525MilosMilutinovicHandcrafted Gift (IOI20_gift)C++14
10 / 100
296 ms29260 KiB
#include "gift.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pii pair<int,int>
vector<pii> Compress(vector<pii> a){
    vector<pii> ev;
    for(auto i:a){
        ev.pb({i.first,-1});
        ev.pb({i.second,1});
    }
    sort(ev.begin(),ev.end());
    vector<pii> ans;
    int l,bal=0;
    for(auto i:ev){
        if(i.second==-1){
            if(bal==0)l=i.first;
            ++bal;
        }else{
            --bal;
            if(bal==0)ans.pb({l,i.first});
            //if(bal==0)printf("%i %i\n",l,i.first);
        }
    }
    return ans;
}
int construct(int n,int r,vector<int> a,vector<int> b,vector<int> x){
    string ans="";
    for(int i=0;i<n;i++)ans+='R';
    vector<pii> zer,one;
    for(int i=0;i<r;i++){
        if(x[i]==2&&a[i]==b[i])return 0;
        if(x[i]==1)zer.pb({a[i],b[i]});
        else one.pb({a[i],b[i]});
    }
    zer=Compress(zer);
    one=Compress(one);
    for(int i=0;i<(int)one.size();i++)ans[one[i].first-1]='B';
    craft(ans);
    return 1;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...