| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1324208 | kasamchi | Handcrafted Gift (IOI20_gift) | C++20 | 1592 ms | 16976 KiB |
#include "gift.h"
#include <bits/stdc++.h>
using namespace std;
int construct(int n, int r, vector<int> a, vector<int> b, vector<int> x) {
vector<pair<int, int>> one, two;
for (int i = 0; i < r; i++) {
if (x[i] == 1) {
one.push_back(make_pair(a[i], b[i]));
} else {
two.push_back(make_pair(a[i], b[i]));
}
}
sort(one.begin(), one.end());
string s(n, '$');
int sid = 0;
char chr = 'R';
for (int i = 0; i < n; ) {
s[i] = chr;
if (sid < one.size() && one[sid].first <= i) {
while (i < n && i <= one[sid].second) {
s[i] = s[one[sid].first];
i++;
}
sid++;
} else {
i++;
}
chr = (chr == 'R' ? 'B' : 'R');
}
for (auto &[l, r] : two) {
bool rb = false, bb = false;
for (int i = l; i <= r; i++) {
if (s[i] == 'R') {
rb = true;
} else {
bb = true;
}
}
if (!rb || !bb) {
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... | ||||
