# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
469815 | 2021-09-01T19:45:12 Z | AdamGS | 슈퍼트리 잇기 (IOI20_supertrees) | C++14 | 259 ms | 28012 KB |
#include "supertrees.h" #include<bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; #define rep(a, b) for(int a = 0; a < (b); ++a) #define st first #define nd second #define pb push_back #define all(a) a.begin(), a.end() int construct(vector<vector<int>>p) { int n=p[0].size(); vector<pair<vector<int>,int>>V; rep(i, n) { vector<int>a; rep(j, n) if(p[i][j]) a.pb(1); else a.pb(0); V.pb({a, i}); } sort(all(V)); vector<vector<int>>spojne; vector<int>akt1=V[0].st, akt2; akt2.pb(V[0].nd); for(int i=1; i<V.size(); ++i) { if(V[i].st!=akt1) { vector<int>jakie; rep(j, n) if(akt1[j]) jakie.pb(j); if(jakie!=akt2) return 0; spojne.pb(akt2); akt1=V[i].st; akt2.clear(); } akt2.pb(V[i].nd); } vector<int>jakie; rep(j, n) if(akt1[j]) jakie.pb(j); if(jakie!=akt2) return 0; spojne.pb(akt2); vector<vector<int>>ans; rep(i, n) { vector<int>a; rep(j, n) a.pb(0); ans.pb(a); } for(auto i : spojne) { rep(j, i.size()-1) { ans[i[j]][i[j+1]]=ans[i[j+1]][i[j]]=1; } } build(ans); return 1; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | 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 | 11 ms | 1428 KB | Output is correct |
7 | Correct | 253 ms | 27980 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | 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 | 11 ms | 1428 KB | Output is correct |
7 | Correct | 253 ms | 27980 KB | Output is correct |
8 | Correct | 1 ms | 292 KB | Output is correct |
9 | Correct | 0 ms | 204 KB | Output is correct |
10 | Correct | 1 ms | 288 KB | Output is correct |
11 | Correct | 1 ms | 204 KB | Output is correct |
12 | Correct | 10 ms | 1356 KB | Output is correct |
13 | Correct | 238 ms | 28012 KB | Output is correct |
14 | Correct | 0 ms | 204 KB | Output is correct |
15 | Correct | 1 ms | 292 KB | Output is correct |
16 | Correct | 5 ms | 752 KB | Output is correct |
17 | Correct | 112 ms | 14064 KB | Output is correct |
18 | Correct | 0 ms | 204 KB | Output is correct |
19 | Correct | 1 ms | 204 KB | Output is correct |
20 | Correct | 60 ms | 7148 KB | Output is correct |
21 | Correct | 252 ms | 27972 KB | Output is correct |
22 | Correct | 236 ms | 27952 KB | Output is correct |
23 | Correct | 256 ms | 27896 KB | Output is correct |
24 | Correct | 244 ms | 27972 KB | Output is correct |
25 | Correct | 118 ms | 14072 KB | Output is correct |
26 | Correct | 122 ms | 14060 KB | Output is correct |
27 | Correct | 259 ms | 27992 KB | Output is correct |
28 | Correct | 240 ms | 27972 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Correct | 0 ms | 284 KB | Output is correct |
3 | Correct | 1 ms | 204 KB | Output is correct |
4 | Incorrect | 1 ms | 288 KB | Answer gives possible 1 while actual possible 0 |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Incorrect | 1 ms | 204 KB | Too few ways to get from 0 to 1, should be 2 found 1 |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | 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 | 11 ms | 1428 KB | Output is correct |
7 | Correct | 253 ms | 27980 KB | Output is correct |
8 | Correct | 1 ms | 292 KB | Output is correct |
9 | Correct | 0 ms | 204 KB | Output is correct |
10 | Correct | 1 ms | 288 KB | Output is correct |
11 | Correct | 1 ms | 204 KB | Output is correct |
12 | Correct | 10 ms | 1356 KB | Output is correct |
13 | Correct | 238 ms | 28012 KB | Output is correct |
14 | Correct | 0 ms | 204 KB | Output is correct |
15 | Correct | 1 ms | 292 KB | Output is correct |
16 | Correct | 5 ms | 752 KB | Output is correct |
17 | Correct | 112 ms | 14064 KB | Output is correct |
18 | Correct | 0 ms | 204 KB | Output is correct |
19 | Correct | 1 ms | 204 KB | Output is correct |
20 | Correct | 60 ms | 7148 KB | Output is correct |
21 | Correct | 252 ms | 27972 KB | Output is correct |
22 | Correct | 236 ms | 27952 KB | Output is correct |
23 | Correct | 256 ms | 27896 KB | Output is correct |
24 | Correct | 244 ms | 27972 KB | Output is correct |
25 | Correct | 118 ms | 14072 KB | Output is correct |
26 | Correct | 122 ms | 14060 KB | Output is correct |
27 | Correct | 259 ms | 27992 KB | Output is correct |
28 | Correct | 240 ms | 27972 KB | Output is correct |
29 | Correct | 1 ms | 204 KB | Output is correct |
30 | Correct | 0 ms | 284 KB | Output is correct |
31 | Correct | 1 ms | 204 KB | Output is correct |
32 | Incorrect | 1 ms | 288 KB | Answer gives possible 1 while actual possible 0 |
33 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | 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 | 11 ms | 1428 KB | Output is correct |
7 | Correct | 253 ms | 27980 KB | Output is correct |
8 | Correct | 1 ms | 292 KB | Output is correct |
9 | Correct | 0 ms | 204 KB | Output is correct |
10 | Correct | 1 ms | 288 KB | Output is correct |
11 | Correct | 1 ms | 204 KB | Output is correct |
12 | Correct | 10 ms | 1356 KB | Output is correct |
13 | Correct | 238 ms | 28012 KB | Output is correct |
14 | Correct | 0 ms | 204 KB | Output is correct |
15 | Correct | 1 ms | 292 KB | Output is correct |
16 | Correct | 5 ms | 752 KB | Output is correct |
17 | Correct | 112 ms | 14064 KB | Output is correct |
18 | Correct | 0 ms | 204 KB | Output is correct |
19 | Correct | 1 ms | 204 KB | Output is correct |
20 | Correct | 60 ms | 7148 KB | Output is correct |
21 | Correct | 252 ms | 27972 KB | Output is correct |
22 | Correct | 236 ms | 27952 KB | Output is correct |
23 | Correct | 256 ms | 27896 KB | Output is correct |
24 | Correct | 244 ms | 27972 KB | Output is correct |
25 | Correct | 118 ms | 14072 KB | Output is correct |
26 | Correct | 122 ms | 14060 KB | Output is correct |
27 | Correct | 259 ms | 27992 KB | Output is correct |
28 | Correct | 240 ms | 27972 KB | Output is correct |
29 | Correct | 1 ms | 204 KB | Output is correct |
30 | Correct | 0 ms | 284 KB | Output is correct |
31 | Correct | 1 ms | 204 KB | Output is correct |
32 | Incorrect | 1 ms | 288 KB | Answer gives possible 1 while actual possible 0 |
33 | Halted | 0 ms | 0 KB | - |