# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
5104 | ainta | 지도 색칠하기 (GA3_map) | C++98 | 44 ms | 1092 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.
int n, C[21], E[21][21], E2[21][21], C2[21], D[21], ck[21];
long long ret;
void DFS(int x, int d){
D[x] = d;
int i;
for (i = 0; i != C2[x]; i++){
if (!D[E2[x][i]])DFS(E2[x][i], d + 1);
}
}
void Do(int x, int A, int B){
if (x == n + 1){
ret += (long long)A*B;
return;
}
int i, j, chk;
for (i = 1; i <= 2; i++){
chk = 0;
for (j = 1; j != x; j++)D[j] = 0;
for (j = 0; j != C[x]; j++){
if (ck[E[x][j]] == i){
if (D[E[x][j]]){
if (D[E[x][j]] % 2 == 0)break;
}
else DFS(E[x][j], 1);
chk = E[x][j];
}
}
if (j != C[x])continue;
if (!chk){
if (i)B *= 2; else A *= 2;
# | 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... |