oj.uz

답안 #469819

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
469819 2021-09-01T21:07:37 Z AdamGS 슈퍼트리 잇기 (IOI20_supertrees) C++14
96 / 100
 293 ms 27972 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) {
                V.clear();
                akt1.clear();
                akt2.clear();
                for(auto j : i) {
                        vector<int>a;
                        rep(l, n) a.pb(p[j][l]);
                        V.pb({a, j});
                }
                sort(all(V));
                vector<vector<int>>drzewa;
                akt1=V[0].st;
                akt2.pb(V[0].nd);
                for(int j=1; j<V.size(); ++j) {
                        if(V[j].st!=akt1) {
                                jakie.clear();
                                rep(l, n) if(akt1[l]==1) jakie.pb(l);
                                if(jakie!=akt2) return 0;
                                drzewa.pb(akt2);
                                akt1=V[j].st;
                                akt2.clear();
                        }
                        akt2.pb(V[j].nd);
                }
                jakie.clear();
                rep(j, n) if(akt1[j]==1) jakie.pb(j);
                if(jakie!=akt2) return 0;
                drzewa.pb(akt2);
                for(auto j : drzewa) {
                        int ile=0;
                        rep(l, n) if(p[j[0]][l]==1) ++ile;
                        if(ile!=j.size()) return 0;
                        rep(l, j.size()-1) {
                                ans[j[l]][j[l+1]]=ans[j[l+1]][j[l]]=1;
                        }
                }
                if(drzewa.size()==2) return 0;
                if(drzewa.size()!=1) rep(j, drzewa.size()) {
                        ans[drzewa[j][0]][drzewa[(j+1)%drzewa.size()][0]]=1;
                        ans[drzewa[(j+1)%drzewa.size()][0]][drzewa[j][0]]=1;
                }
        }
        build(ans);
        return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:23:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::vector<int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |         for(int i=1; i<V.size(); ++i) {
      |                      ~^~~~~~~~~
supertrees.cpp:57:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::vector<int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |                 for(int j=1; j<V.size(); ++j) {
      |                              ~^~~~~~~~~
supertrees.cpp:75:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |                         if(ile!=j.size()) return 0;
      |                            ~~~^~~~~~~~~~
supertrees.cpp:6:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    6 | #define rep(a, b) for(int a = 0; a < (b); ++a)
      |                                    ^
supertrees.cpp:76:25: note: in expansion of macro 'rep'
   76 |                         rep(l, j.size()-1) {
      |                         ^~~
supertrees.cpp:6:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    6 | #define rep(a, b) for(int a = 0; a < (b); ++a)
      |                                    ^
supertrees.cpp:81:38: note: in expansion of macro 'rep'
   81 |                 if(drzewa.size()!=1) rep(j, drzewa.size()) {
      |                                      ^~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 11 ms 1340 KB Output is correct
7 Correct 264 ms 26044 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 11 ms 1340 KB Output is correct
7 Correct 264 ms 26044 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 15 ms 1216 KB Output is correct
13 Correct 244 ms 22100 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 716 KB Output is correct
17 Correct 106 ms 12028 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 61 ms 5756 KB Output is correct
21 Correct 263 ms 22340 KB Output is correct
22 Correct 252 ms 22056 KB Output is correct
23 Correct 267 ms 24064 KB Output is correct
24 Correct 259 ms 22148 KB Output is correct
25 Correct 109 ms 12100 KB Output is correct
26 Correct 98 ms 12096 KB Output is correct
27 Correct 278 ms 24072 KB Output is correct
28 Correct 252 ms 22156 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 11 ms 1228 KB Output is correct
9 Correct 248 ms 23980 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 11 ms 1436 KB Output is correct
13 Correct 261 ms 27972 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 5 ms 816 KB Output is correct
17 Correct 107 ms 14000 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 62 ms 6248 KB Output is correct
22 Correct 270 ms 24300 KB Output is correct
23 Correct 243 ms 24004 KB Output is correct
24 Correct 272 ms 25928 KB Output is correct
25 Correct 119 ms 18028 KB Output is correct
26 Correct 111 ms 14060 KB Output is correct
27 Correct 248 ms 24056 KB Output is correct
28 Correct 293 ms 26104 KB Output is correct
29 Correct 118 ms 18028 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 62 ms 6268 KB Output is correct
5 Correct 258 ms 24296 KB Output is correct
6 Correct 249 ms 24048 KB Output is correct
7 Correct 268 ms 25964 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 62 ms 6248 KB Output is correct
10 Correct 257 ms 24296 KB Output is correct
11 Correct 243 ms 24004 KB Output is correct
12 Correct 276 ms 25924 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 62 ms 6252 KB Output is correct
17 Correct 255 ms 24316 KB Output is correct
18 Correct 256 ms 24396 KB Output is correct
19 Correct 252 ms 24172 KB Output is correct
20 Correct 244 ms 24004 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 11 ms 1340 KB Output is correct
7 Correct 264 ms 26044 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 15 ms 1216 KB Output is correct
13 Correct 244 ms 22100 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 716 KB Output is correct
17 Correct 106 ms 12028 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 61 ms 5756 KB Output is correct
21 Correct 263 ms 22340 KB Output is correct
22 Correct 252 ms 22056 KB Output is correct
23 Correct 267 ms 24064 KB Output is correct
24 Correct 259 ms 22148 KB Output is correct
25 Correct 109 ms 12100 KB Output is correct
26 Correct 98 ms 12096 KB Output is correct
27 Correct 278 ms 24072 KB Output is correct
28 Correct 252 ms 22156 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 11 ms 1228 KB Output is correct
37 Correct 248 ms 23980 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 11 ms 1436 KB Output is correct
41 Correct 261 ms 27972 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 5 ms 816 KB Output is correct
45 Correct 107 ms 14000 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 62 ms 6248 KB Output is correct
50 Correct 270 ms 24300 KB Output is correct
51 Correct 243 ms 24004 KB Output is correct
52 Correct 272 ms 25928 KB Output is correct
53 Correct 119 ms 18028 KB Output is correct
54 Correct 111 ms 14060 KB Output is correct
55 Correct 248 ms 24056 KB Output is correct
56 Correct 293 ms 26104 KB Output is correct
57 Correct 118 ms 18028 KB Output is correct
58 Correct 1 ms 288 KB Output is correct
59 Correct 0 ms 204 KB Output is correct
60 Correct 5 ms 844 KB Output is correct
61 Correct 109 ms 13988 KB Output is correct
62 Correct 1 ms 204 KB Output is correct
63 Correct 1 ms 204 KB Output is correct
64 Correct 1 ms 204 KB Output is correct
65 Correct 63 ms 6280 KB Output is correct
66 Correct 111 ms 14100 KB Output is correct
67 Correct 111 ms 14064 KB Output is correct
68 Correct 106 ms 14072 KB Output is correct
69 Correct 116 ms 18116 KB Output is correct

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 11 ms 1340 KB Output is correct
7 Correct 264 ms 26044 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 15 ms 1216 KB Output is correct
13 Correct 244 ms 22100 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 716 KB Output is correct
17 Correct 106 ms 12028 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 61 ms 5756 KB Output is correct
21 Correct 263 ms 22340 KB Output is correct
22 Correct 252 ms 22056 KB Output is correct
23 Correct 267 ms 24064 KB Output is correct
24 Correct 259 ms 22148 KB Output is correct
25 Correct 109 ms 12100 KB Output is correct
26 Correct 98 ms 12096 KB Output is correct
27 Correct 278 ms 24072 KB Output is correct
28 Correct 252 ms 22156 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 11 ms 1228 KB Output is correct
37 Correct 248 ms 23980 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 11 ms 1436 KB Output is correct
41 Correct 261 ms 27972 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 5 ms 816 KB Output is correct
45 Correct 107 ms 14000 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 62 ms 6248 KB Output is correct
50 Correct 270 ms 24300 KB Output is correct
51 Correct 243 ms 24004 KB Output is correct
52 Correct 272 ms 25928 KB Output is correct
53 Correct 119 ms 18028 KB Output is correct
54 Correct 111 ms 14060 KB Output is correct
55 Correct 248 ms 24056 KB Output is correct
56 Correct 293 ms 26104 KB Output is correct
57 Correct 118 ms 18028 KB Output is correct
58 Correct 0 ms 204 KB Output is correct
59 Correct 0 ms 204 KB Output is correct
60 Correct 1 ms 204 KB Output is correct
61 Correct 62 ms 6268 KB Output is correct
62 Correct 258 ms 24296 KB Output is correct
63 Correct 249 ms 24048 KB Output is correct
64 Correct 268 ms 25964 KB Output is correct
65 Correct 1 ms 204 KB Output is correct
66 Correct 62 ms 6248 KB Output is correct
67 Correct 257 ms 24296 KB Output is correct
68 Correct 243 ms 24004 KB Output is correct
69 Correct 276 ms 25924 KB Output is correct
70 Correct 1 ms 204 KB Output is correct
71 Correct 0 ms 204 KB Output is correct
72 Correct 1 ms 204 KB Output is correct
73 Correct 62 ms 6252 KB Output is correct
74 Correct 255 ms 24316 KB Output is correct
75 Correct 256 ms 24396 KB Output is correct
76 Correct 252 ms 24172 KB Output is correct
77 Correct 244 ms 24004 KB Output is correct
78 Correct 1 ms 288 KB Output is correct
79 Correct 0 ms 204 KB Output is correct
80 Correct 5 ms 844 KB Output is correct
81 Correct 109 ms 13988 KB Output is correct
82 Correct 1 ms 204 KB Output is correct
83 Correct 1 ms 204 KB Output is correct
84 Correct 1 ms 204 KB Output is correct
85 Correct 63 ms 6280 KB Output is correct
86 Correct 111 ms 14100 KB Output is correct
87 Correct 111 ms 14064 KB Output is correct
88 Correct 106 ms 14072 KB Output is correct
89 Correct 116 ms 18116 KB Output is correct
90 Correct 0 ms 204 KB Output is correct
91 Correct 1 ms 204 KB Output is correct
92 Correct 5 ms 844 KB Output is correct
93 Correct 108 ms 14056 KB Output is correct
94 Incorrect 0 ms 204 KB Answer gives possible 1 while actual possible 0
95 Halted 0 ms 0 KB -