# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
313928 | georgerapeanu | Chameleon's Love (JOI20_chameleon) | C++14 | 0 ms | 0 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 "chameleon.h"
#include <vector>
#include <cstdio>
#include <cassert>
using namespace std;
vector<int> graph[1005];
vector<int> groups[2];
bool viz[1005];
void dfs(int nod,int lvl){
viz[nod] = 1;
groups[lvl].push_back(nod);
for(auto it:graph[nod]){
if(viz[it]){
continue;;
}
dfs(it,lvl ^ 1);
}
}
void make_groups(int pas){
for(int i = 1;i <= pas;i++){
viz[i] = false;
}
groups[0].clear();
groups[1].clear();