# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
5112 | cki86201 | 지도 색칠하기 (GA3_map) | C++98 | 792 ms | 1088 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.
typedef long long ll;
int E[22][22], L[22], C[22], N;
bool dfs(int bit,int x,int now)
{
C[x] = now;
for(int i=0;i<L[x];i++){
int t = E[x][i];
if(bit&1<<t){
if(C[t] == now)return false;
if(C[t] == -1 && !dfs(bit,t,now^1))return false;
}
}
return true;
}
int f(int x)
{
int ret = 1, i;
for(i=0;i<N;i++)C[i] = -1;
for(i=0;i<N;i++){
if((1<<i&x) && C[i]==-1){
if(!dfs(x,i,0))return 0;
ret <<= 1;
}
}
return ret;
}
# | 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... |