답안 #433587

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
433587	2021-06-20T07:57:19 Z	SAAD	슈퍼트리 잇기 (IOI20_supertrees)	C++17	11 / 100	246 ms	26136 KB

supertrees

#include <iostream>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string.h>
#include "supertrees.h"
using namespace std;
bool ok;
int tree[10002] , n;
vector<vector<int>> a;
vector <int> x[1002];
int dfs( int idx , int lab ) {
    tree[idx] = lab;
    for (auto i : x[idx]) {
        if (tree[i] == lab) continue;
        if (tree[i] == -1) {
            dfs(i,lab);
        }
        else {
            ok = false;
        }
    }
    return 0;
}
int construct(vector<vector<int>> p) {
    n = (int)p.size();
    ok = true;
    memset(tree,-1,sizeof(tree));
    a = p;
    for (int i = 0; i < (int)a.size(); i++) {
        for (int j = 0; j < (int)a.size(); j++) {
            a[i][j] = 0;
            if (i == j) continue;
            if (p[i][j] != p[j][i] || p[i][i] != 1 ) return 0;
            if (p[i][j] == 1) {
                x[i].push_back(j);
            }
        }
    }
    for (int i = 0; i < n; i++) {
        if (tree[i] == -1) {
            dfs(i,i);
            if (!ok) return 0;
        }
    }
    for (int i = 0; i < n; i++) {
        if (tree[i] == i) {
            a[i] = p[i];
            a[i][i] = 0;
        }
        else {
            a[i][tree[i]] = 1;
        }
    }
    build(a);
    return 1;
}

Subtask #1

11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	0 ms	332 KB	Output is correct
5	Correct	0 ms	332 KB	Output is correct
6	Correct	11 ms	1356 KB	Output is correct
7	Correct	246 ms	26136 KB	Output is correct

Subtask #2

0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	0 ms	332 KB	Output is correct
5	Correct	0 ms	332 KB	Output is correct
6	Correct	11 ms	1356 KB	Output is correct
7	Correct	246 ms	26136 KB	Output is correct
8	Correct	0 ms	332 KB	Output is correct
9	Correct	0 ms	332 KB	Output is correct
10	Correct	0 ms	332 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	10 ms	1228 KB	Output is correct
13	Correct	232 ms	21992 KB	Output is correct
14	Incorrect	0 ms	332 KB	Answer gives possible 1 while actual possible 0
15	Halted	0 ms	0 KB	-

Subtask #3

0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Incorrect	1 ms	332 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	332 KB	Output is correct
2	Incorrect	1 ms	332 KB	Integer element b_i_j[2] equals to 2, violates the range [0, 1]
3	Halted	0 ms	0 KB	-

Subtask #5

0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	0 ms	332 KB	Output is correct
5	Correct	0 ms	332 KB	Output is correct
6	Correct	11 ms	1356 KB	Output is correct
7	Correct	246 ms	26136 KB	Output is correct
8	Correct	0 ms	332 KB	Output is correct
9	Correct	0 ms	332 KB	Output is correct
10	Correct	0 ms	332 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	10 ms	1228 KB	Output is correct
13	Correct	232 ms	21992 KB	Output is correct
14	Incorrect	0 ms	332 KB	Answer gives possible 1 while actual possible 0
15	Halted	0 ms	0 KB	-

Subtask #6

0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	0 ms	332 KB	Output is correct
5	Correct	0 ms	332 KB	Output is correct
6	Correct	11 ms	1356 KB	Output is correct
7	Correct	246 ms	26136 KB	Output is correct
8	Correct	0 ms	332 KB	Output is correct
9	Correct	0 ms	332 KB	Output is correct
10	Correct	0 ms	332 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	10 ms	1228 KB	Output is correct
13	Correct	232 ms	21992 KB	Output is correct
14	Incorrect	0 ms	332 KB	Answer gives possible 1 while actual possible 0
15	Halted	0 ms	0 KB	-