oj.uz

답안 #300200

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
300200 2020-09-17T00:44:02 Z fpc_coder 슈퍼트리 잇기 (IOI20_supertrees) C++17
0 / 100
 1 ms 256 KB 
#include <bits/stdc++.h>
#include "supertrees.h"

using namespace std;

int construct(vector<vector<int>> p) {
    vector<vector<int>> b(p.size(), vector<int>(p.size(), 0));
    int n = (int) p.size();
    vector<int> par(n);
    vector<bool> vis(n);
    for (int i = 0; i < n; i++) par[i] = i;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (i == j) continue;
            if (p[i][j]) {
                if (vis[j]) return 0;
                vis[j] = true;
                b[i][j] = b[j][i] = 1;
                par[j] = i;
            }
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (i == j) continue;
            if (par[i] == par[j] && p[i][j] == 0) return 0;
        }
    }
    build(b);
    return 1;
}

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Incorrect 1 ms 256 KB Answer gives possible 0 while actual possible 1
4 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Incorrect 1 ms 256 KB Answer gives possible 0 while actual possible 1
4 Halted 0 ms 0 KB -

Subtask #3
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Incorrect 1 ms 256 KB Answer gives possible 1 while actual possible 0
5 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Incorrect 1 ms 256 KB Answer gives possible 0 while actual possible 1
3 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Incorrect 1 ms 256 KB Answer gives possible 0 while actual possible 1
4 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Incorrect 1 ms 256 KB Answer gives possible 0 while actual possible 1
4 Halted 0 ms 0 KB -