제출 #559573

#제출 시각아이디문제언어결과실행 시간메모리
559573nekiHandcrafted Gift (IOI20_gift)C++14
15 / 100
358 ms67500 KiB
#include <bits/stdc++.h> #include "gift.h" #define ll long long #define vc vector using namespace std; int construct(int n, int r, vc<int> a, vc<int> b, vc<int> x){ vc<vc<vc<int>>> ques(3, vc<vc<int>> (n)); for(int i=0;i<r;++i) ques[x[i]][b[i]].push_back(a[i]); vc<pair<int, int>> ints; for(int i=0;i<n;++i){ ints.emplace_back(i, i); for(auto q: ques[1][i]){ while(ints.size() and q<ints.back().first) ints.pop_back(); if(ints.size()) ints.emplace_back(ints.back().second+1, i); else ints.emplace_back(0, i); } } int br=1, j=0; for(int i=0;i<n;++i){ while(ints[j].second<i)++j; for(auto q: ques[2][i]) if(ints[j].first<=q) br=0; } if(br){ string ans=""; char cur='R'; for(auto i:ints){ for(int j=i.first;j<=i.second;++j) ans+=cur; if(cur=='R') cur='B'; else cur='R'; } craft(ans); return 1; } else return 0; }
#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...