Submission #366983

# Submission time Handle Problem Language Result Execution time Memory
366983 2021-02-15T22:33:42 Z PurpleCrayon Connecting Supertrees (IOI20_supertrees) C++17
11 / 100
233 ms 22120 KB
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;

#define ar array
#define sz(v) int(v.size())

int n;

int construct(vector<vector<int>> g) {
	n = sz(g);
    vector<vector<int>> ans(n, vector<int>(n));


    bool done=0;

    [&](){
        for (int i = 0; i < n; i++) for (int j = i+1; j < n; j++) if (g[i][j] != 1) return;
        for (int i = 1; i < n; i++) ans[i][0] = ans[0][i] = 1;

        build(ans), done=1;
    }();

	return done;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 10 ms 1260 KB Output is correct
7 Correct 233 ms 22120 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 10 ms 1260 KB Output is correct
7 Correct 233 ms 22120 KB Output is correct
8 Incorrect 1 ms 364 KB Answer gives possible 0 while actual possible 1
9 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 364 KB Answer gives possible 0 while actual possible 1
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 364 KB Answer gives possible 0 while actual possible 1
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 10 ms 1260 KB Output is correct
7 Correct 233 ms 22120 KB Output is correct
8 Incorrect 1 ms 364 KB Answer gives possible 0 while actual possible 1
9 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 10 ms 1260 KB Output is correct
7 Correct 233 ms 22120 KB Output is correct
8 Incorrect 1 ms 364 KB Answer gives possible 0 while actual possible 1
9 Halted 0 ms 0 KB -