Submission #433602

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
433602	2021-06-20T08:14:50 Z	SAAD	Connecting Supertrees (IOI20_supertrees)	C++17	0 / 100	1 ms	332 KB

supertrees

#include <iostream>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string.h>
#include "supertrees.h"
using namespace std;
int tree[10002], n;
int construct(vector<vector<int>> p) {
    n = (int)p.size();
    vector <int> s(n);
    vector<vector<int>> a;
    a = p;
    memset(tree, -1, sizeof(tree));
    for (int i = 0; i < n; i++) {
        if (tree[i] != -1) {
            if (p[i] != p[tree[i]]) return 0;
            continue;
        }
        for (int j = 0; j < n; j++) {
            if (p[i][j]) {
                tree[j] = i;
            }
        }
    }
    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
0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Incorrect	1 ms	332 KB	b[1][1] is not 0
3	Halted	0 ms	0 KB	-

Subtask #2
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Incorrect	1 ms	332 KB	b[1][1] is not 0
3	Halted	0 ms	0 KB	-

Subtask #3
0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Incorrect	0 ms	332 KB	Answer gives possible 0 while actual possible 1
6	Halted	0 ms	0 KB	-