# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
415529 | Pro_ktmr | Handcrafted Gift (IOI20_gift) | C++17 | 318 ms | 43760 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 <bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(x) x.begin(), x.end()
#define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
#define repi(i, a, b) for(int (i)=(a); (i)<(b); (i)++)
#include "gift.h"
vector<int> q1[500000];
int construct(int n, int r, std::vector<int> a, std::vector<int> b, std::vector<int> x) {
rep(i, r){
if(x[i] == 1) q1[a[i]].pb(b[i]);
}
vector<int> S(n, -1);
S[0] = 0;
int d = 0;
rep(i, n){
if(d < i){
S[i] = S[i-1] ^ 1;
d = i;
}
rep(j, q1[i].size()){
repi(k, d+1, q1[i][j]+1){
S[k] = S[i];
d = k;
}
}
Compilation message (stderr)
# | 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... |