# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
497122 | 2021-12-22T13:23:24 Z | Hanksburger | Connecting Supertrees (IOI20_supertrees) | C++17 | 182 ms | 23928 KB |
#include "supertrees.h" #include <bits/stdc++.h> using namespace std; int construct(vector<vector<int> > P) { int N=P.size(); bool subtask1=1, subtask2=1; for (int i=0; i<N; i++) { for (int j=0; j<N; j++) { if (P[i][j]==0 || P[i][j]==2 || P[i][j]==3) subtask1=0; if (P[i][j]==2 || P[i][j]==3) subtask2=0; } } vector<vector<int> > ans; vector<int> tmp; if (subtask1) { tmp.push_back(0); for (int i=1; i<N; i++) tmp.push_back(1); ans.push_back(tmp); for (int i=1; i<N; i++) { tmp.clear(); tmp.push_back(1); for (int j=1; j<N; j++) tmp.push_back(0); ans.push_back(tmp); } build(ans); return 1; } else { } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Correct | 1 ms | 204 KB | Output is correct |
3 | Correct | 0 ms | 204 KB | Output is correct |
4 | Correct | 1 ms | 204 KB | Output is correct |
5 | Correct | 1 ms | 204 KB | Output is correct |
6 | Correct | 9 ms | 1172 KB | Output is correct |
7 | Correct | 182 ms | 23928 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Correct | 1 ms | 204 KB | Output is correct |
3 | Correct | 0 ms | 204 KB | Output is correct |
4 | Correct | 1 ms | 204 KB | Output is correct |
5 | Correct | 1 ms | 204 KB | Output is correct |
6 | Correct | 9 ms | 1172 KB | Output is correct |
7 | Correct | 182 ms | 23928 KB | Output is correct |
8 | Runtime error | 3 ms | 408 KB | Execution killed with signal 11 |
9 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 3 ms | 548 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 3 ms | 544 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Correct | 1 ms | 204 KB | Output is correct |
3 | Correct | 0 ms | 204 KB | Output is correct |
4 | Correct | 1 ms | 204 KB | Output is correct |
5 | Correct | 1 ms | 204 KB | Output is correct |
6 | Correct | 9 ms | 1172 KB | Output is correct |
7 | Correct | 182 ms | 23928 KB | Output is correct |
8 | Runtime error | 3 ms | 408 KB | Execution killed with signal 11 |
9 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Correct | 1 ms | 204 KB | Output is correct |
3 | Correct | 0 ms | 204 KB | Output is correct |
4 | Correct | 1 ms | 204 KB | Output is correct |
5 | Correct | 1 ms | 204 KB | Output is correct |
6 | Correct | 9 ms | 1172 KB | Output is correct |
7 | Correct | 182 ms | 23928 KB | Output is correct |
8 | Runtime error | 3 ms | 408 KB | Execution killed with signal 11 |
9 | Halted | 0 ms | 0 KB | - |