답안 #300201

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
300201	2020-09-17T00:45:29 Z	fpc_coder	슈퍼트리 잇기 (IOI20_supertrees)	C++17	11 / 100	267 ms	22136 KB

supertrees

#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, -1);
    vector<bool> vis(n, false);
    for (int i = 0; i < n; i++) {
        if (vis[i]) continue;
        par[i] = 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

11.0 / 11.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	Correct	1 ms	256 KB	Output is correct
5	Correct	1 ms	256 KB	Output is correct
6	Correct	11 ms	1152 KB	Output is correct
7	Correct	267 ms	22136 KB	Output is correct

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	Correct	1 ms	256 KB	Output is correct
4	Correct	1 ms	256 KB	Output is correct
5	Correct	1 ms	256 KB	Output is correct
6	Correct	11 ms	1152 KB	Output is correct
7	Correct	267 ms	22136 KB	Output is correct
8	Correct	1 ms	256 KB	Output is correct
9	Correct	1 ms	256 KB	Output is correct
10	Correct	0 ms	256 KB	Output is correct
11	Correct	1 ms	256 KB	Output is correct
12	Correct	10 ms	1280 KB	Output is correct
13	Correct	241 ms	22136 KB	Output is correct
14	Correct	1 ms	256 KB	Output is correct
15	Correct	1 ms	256 KB	Output is correct
16	Correct	5 ms	768 KB	Output is correct
17	Correct	118 ms	12152 KB	Output is correct
18	Correct	1 ms	256 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Correct	59 ms	5756 KB	Output is correct
21	Correct	237 ms	22136 KB	Output is correct
22	Correct	242 ms	22136 KB	Output is correct
23	Correct	248 ms	22136 KB	Output is correct
24	Correct	235 ms	22136 KB	Output is correct
25	Incorrect	245 ms	22136 KB	Answer gives possible 1 while actual possible 0
26	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	384 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	Too few ways to get from 0 to 1, should be 2 found 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	Correct	1 ms	256 KB	Output is correct
4	Correct	1 ms	256 KB	Output is correct
5	Correct	1 ms	256 KB	Output is correct
6	Correct	11 ms	1152 KB	Output is correct
7	Correct	267 ms	22136 KB	Output is correct
8	Correct	1 ms	256 KB	Output is correct
9	Correct	1 ms	256 KB	Output is correct
10	Correct	0 ms	256 KB	Output is correct
11	Correct	1 ms	256 KB	Output is correct
12	Correct	10 ms	1280 KB	Output is correct
13	Correct	241 ms	22136 KB	Output is correct
14	Correct	1 ms	256 KB	Output is correct
15	Correct	1 ms	256 KB	Output is correct
16	Correct	5 ms	768 KB	Output is correct
17	Correct	118 ms	12152 KB	Output is correct
18	Correct	1 ms	256 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Correct	59 ms	5756 KB	Output is correct
21	Correct	237 ms	22136 KB	Output is correct
22	Correct	242 ms	22136 KB	Output is correct
23	Correct	248 ms	22136 KB	Output is correct
24	Correct	235 ms	22136 KB	Output is correct
25	Incorrect	245 ms	22136 KB	Answer gives possible 1 while actual possible 0
26	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	Correct	1 ms	256 KB	Output is correct
4	Correct	1 ms	256 KB	Output is correct
5	Correct	1 ms	256 KB	Output is correct
6	Correct	11 ms	1152 KB	Output is correct
7	Correct	267 ms	22136 KB	Output is correct
8	Correct	1 ms	256 KB	Output is correct
9	Correct	1 ms	256 KB	Output is correct
10	Correct	0 ms	256 KB	Output is correct
11	Correct	1 ms	256 KB	Output is correct
12	Correct	10 ms	1280 KB	Output is correct
13	Correct	241 ms	22136 KB	Output is correct
14	Correct	1 ms	256 KB	Output is correct
15	Correct	1 ms	256 KB	Output is correct
16	Correct	5 ms	768 KB	Output is correct
17	Correct	118 ms	12152 KB	Output is correct
18	Correct	1 ms	256 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Correct	59 ms	5756 KB	Output is correct
21	Correct	237 ms	22136 KB	Output is correct
22	Correct	242 ms	22136 KB	Output is correct
23	Correct	248 ms	22136 KB	Output is correct
24	Correct	235 ms	22136 KB	Output is correct
25	Incorrect	245 ms	22136 KB	Answer gives possible 1 while actual possible 0
26	Halted	0 ms	0 KB	-