| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1331956 | kawhiet | Handcrafted Gift (IOI20_gift) | C++20 | 85 ms | 17168 KiB |
#include <bits/stdc++.h>
#include "gift.h"
using namespace std;
constexpr int N = 5e5 + 5;
int sweep[N], mx[N];
int construct(int n, int r, vector<int> a, vector<int> b, vector<int> x) {
string s = "";
for (int i = 0; i < r; i++) {
if (x[i] == 1) {
sweep[a[i]]++, sweep[b[i]]--;
}
}
char c[] = {'R', 'B'};
int cur = 0;
for(int i = 0; i < n; ++i){
sweep[i + 1] += sweep[i];
mx[i] = -1;
s += c[cur];
if(sweep[i] == 0) cur ^= 1;
}
for (int i = 0; i < r; ++i){
if(x[i] == 2) mx[b[i]] = max(mx[b[i]], a[i]);
}
int pos = -1;
for(int i = 0; i < n; ++i){
if(i > 0 && s[i] != s[i-1]) pos = i-1;
if(pos < mx[i]) return 0;
}
craft(s);
return 1;
}| # | 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... | ||||
