# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
108702 | tjd229 | 1-Color Coloring (FXCUP2_coloring) | C++14 | 3 ms | 432 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 "coloring.h"
#include <vector>
using namespace std;
bool in[101];
vector<int> v1, v2;
int find(int back, int &coin) {
if (!coin) return -1;
for (auto x : v1) Color(x);
int c = GetColor(back); --coin;
vector<int> *live = &v1, *erase = &v2;
if (c) live = &v2, erase = &v1;
if (live->size() == 1) return live->back();
erase->clear();
while (live->size() > erase->size()) {
erase->push_back(live->back());
live->pop_back();
}
return find(back, coin);
}
void ColoringSame(int N) {
int i;
int coin = 200;
vector<int> stk,v;
stk.push_back(1);
while (coin && stk.size() != N) {
int t = 1;
v1.clear(); v2.clear();
for (i = 2; i <= N; ++i) {
if (in[i]) continue;
if (t) v1.push_back(i);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |