# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
957827 | hirayuu_oj | Handcrafted Gift (IOI20_gift) | C++17 | 207 ms | 30588 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |