답안 #948281

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
948281	2024-03-18T03:08:30 Z	steveonalex	슈퍼트리 잇기 (IOI20_supertrees)	C++14	96 / 100	179 ms	24308 KB

supertrees

#include <bits/stdc++.h>
#include "supertrees.h"
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ll mask){return __builtin_ctzll(mask);}
int logOf(ll mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T& container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

struct DSU{
    int n;
    vector<int> parent, sz;

    DSU(int _n){
        n = _n;
        parent.resize(n); sz.resize(n, 1);
        for(int i = 0; i<n; ++i) parent[i] = i;
    }

    int find_set(int u){return (u == parent[u]) ? u : (parent[u] = find_set(parent[u]));}
    bool same_set(int u, int v){return find_set(u) == find_set(v);}

    bool join_set(int u, int v){
        u = find_set(u), v = find_set(v);
        if (u != v){
            if (sz[u] < sz[v]) swap(u, v);
            parent[v] = u;
            sz[u] += sz[v];
            return true;
        }
        return false;
    }
};

// void build(vector<vector<int>> p){
//     cout << "Answer: \n";
//     for(int i = 0; i<p.size(); ++i) printArr(p[i]);
// }

const int N = 1009;

vector<int> crew[N];

int construct(vector<vector<int>> p) {
    int n = p.size();
    vector<vector<int>> ans(n, vector<int>(n));

    for(int i = 0; i<n; ++i) crew[i].clear();

    DSU chode(n);
    for(int i = 0; i<n; ++i) for(int j = i+1; j<n; ++j) if (p[i][j]) chode.join_set(i, j);
    for(int i = 0; i<n; ++i) for(int j = i+1; j<n; ++j) if (p[i][j] == 0 && chode.same_set(i, j)) return 0; 

    for(int i = 0; i<n; ++i) crew[chode.find_set(i)].push_back(i);

    DSU sigma(n);
    for(int i= 0; i<n; ++i) for(int j = i+1; j<n; ++j) if (p[i][j] == 1) sigma.join_set(i, j);

    for(int i = 0; i<n; ++i) if (crew[i].size()){
        vector<int> pos;
        for(int j: crew[i]) if (j != sigma.find_set(j)) {
            int k = sigma.find_set(j);
            ans[j][k] = ans[k][j] = 1;
        }
        else pos.push_back(j);

        if (pos.size() == 1) continue;
        if (pos.size() == 2) return 0;
        int m = pos.size();
        for(int x: crew[i]) for(int y: crew[i]) {
            if (sigma.find_set(x) != sigma.find_set(y)) {
                if (p[x][y] != p[pos[0]][pos[1]]) return 0;
            }
            else if (p[x][y] != 1) return 0;
        }
        int deg = p[pos[0]][pos[1]];
        if (deg == 3) return 0;
        for(int i = 0; i<m; ++i) {
            int j = (i + 1) % m;
            ans[pos[i]][pos[j]] = ans[pos[j]][pos[i]] = 1;
        }
        if (deg == 3){
            ans[pos[0]][pos[2]] = ans[pos[2]][pos[0]] = 1;
        }
    }

    build(ans);
    return 1;
}

 
// int main(void){
//     ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//     construct({{1, 1, 2, 2}, {1, 1, 2, 2}, {2, 2, 1, 2}, {2, 2, 2, 1}});
//     return 0;
// }

Subtask #1
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	392 KB	Output is correct
4	Correct	0 ms	352 KB	Output is correct
5	Correct	1 ms	352 KB	Output is correct
6	Correct	6 ms	1376 KB	Output is correct
7	Correct	151 ms	23992 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	392 KB	Output is correct
4	Correct	0 ms	352 KB	Output is correct
5	Correct	1 ms	352 KB	Output is correct
6	Correct	6 ms	1376 KB	Output is correct
7	Correct	151 ms	23992 KB	Output is correct
8	Correct	0 ms	352 KB	Output is correct
9	Correct	0 ms	352 KB	Output is correct
10	Correct	0 ms	352 KB	Output is correct
11	Correct	1 ms	352 KB	Output is correct
12	Correct	6 ms	1216 KB	Output is correct
13	Correct	155 ms	24308 KB	Output is correct
14	Correct	1 ms	352 KB	Output is correct
15	Correct	0 ms	352 KB	Output is correct
16	Correct	4 ms	864 KB	Output is correct
17	Correct	80 ms	14172 KB	Output is correct
18	Correct	1 ms	352 KB	Output is correct
19	Correct	0 ms	352 KB	Output is correct
20	Correct	38 ms	6240 KB	Output is correct
21	Correct	155 ms	23960 KB	Output is correct
22	Correct	150 ms	24080 KB	Output is correct
23	Correct	163 ms	24224 KB	Output is correct
24	Correct	179 ms	24096 KB	Output is correct
25	Correct	71 ms	14164 KB	Output is correct
26	Correct	103 ms	14352 KB	Output is correct
27	Correct	158 ms	23976 KB	Output is correct
28	Correct	150 ms	24024 KB	Output is correct

Subtask #3
19.0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	7 ms	1288 KB	Output is correct
9	Correct	154 ms	24100 KB	Output is correct
10	Correct	1 ms	344 KB	Output is correct
11	Correct	0 ms	600 KB	Output is correct
12	Correct	6 ms	1368 KB	Output is correct
13	Correct	152 ms	24080 KB	Output is correct
14	Correct	1 ms	360 KB	Output is correct
15	Correct	1 ms	356 KB	Output is correct
16	Correct	4 ms	868 KB	Output is correct
17	Correct	79 ms	14124 KB	Output is correct
18	Correct	1 ms	344 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	38 ms	6248 KB	Output is correct
22	Correct	152 ms	24148 KB	Output is correct
23	Correct	152 ms	24144 KB	Output is correct
24	Correct	162 ms	23968 KB	Output is correct
25	Correct	71 ms	14160 KB	Output is correct
26	Correct	72 ms	14164 KB	Output is correct
27	Correct	151 ms	24096 KB	Output is correct
28	Correct	163 ms	24148 KB	Output is correct
29	Correct	72 ms	14248 KB	Output is correct

Subtask #4
35.0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	38 ms	6320 KB	Output is correct
5	Correct	156 ms	24148 KB	Output is correct
6	Correct	156 ms	24148 KB	Output is correct
7	Correct	161 ms	24020 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	39 ms	6228 KB	Output is correct
10	Correct	154 ms	24144 KB	Output is correct
11	Correct	151 ms	24052 KB	Output is correct
12	Correct	160 ms	24148 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	344 KB	Output is correct
16	Correct	39 ms	6388 KB	Output is correct
17	Correct	153 ms	24148 KB	Output is correct
18	Correct	159 ms	24144 KB	Output is correct
19	Correct	151 ms	23972 KB	Output is correct
20	Correct	149 ms	24148 KB	Output is correct

Subtask #5
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	392 KB	Output is correct
4	Correct	0 ms	352 KB	Output is correct
5	Correct	1 ms	352 KB	Output is correct
6	Correct	6 ms	1376 KB	Output is correct
7	Correct	151 ms	23992 KB	Output is correct
8	Correct	0 ms	352 KB	Output is correct
9	Correct	0 ms	352 KB	Output is correct
10	Correct	0 ms	352 KB	Output is correct
11	Correct	1 ms	352 KB	Output is correct
12	Correct	6 ms	1216 KB	Output is correct
13	Correct	155 ms	24308 KB	Output is correct
14	Correct	1 ms	352 KB	Output is correct
15	Correct	0 ms	352 KB	Output is correct
16	Correct	4 ms	864 KB	Output is correct
17	Correct	80 ms	14172 KB	Output is correct
18	Correct	1 ms	352 KB	Output is correct
19	Correct	0 ms	352 KB	Output is correct
20	Correct	38 ms	6240 KB	Output is correct
21	Correct	155 ms	23960 KB	Output is correct
22	Correct	150 ms	24080 KB	Output is correct
23	Correct	163 ms	24224 KB	Output is correct
24	Correct	179 ms	24096 KB	Output is correct
25	Correct	71 ms	14164 KB	Output is correct
26	Correct	103 ms	14352 KB	Output is correct
27	Correct	158 ms	23976 KB	Output is correct
28	Correct	150 ms	24024 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	7 ms	1288 KB	Output is correct
37	Correct	154 ms	24100 KB	Output is correct
38	Correct	1 ms	344 KB	Output is correct
39	Correct	0 ms	600 KB	Output is correct
40	Correct	6 ms	1368 KB	Output is correct
41	Correct	152 ms	24080 KB	Output is correct
42	Correct	1 ms	360 KB	Output is correct
43	Correct	1 ms	356 KB	Output is correct
44	Correct	4 ms	868 KB	Output is correct
45	Correct	79 ms	14124 KB	Output is correct
46	Correct	1 ms	344 KB	Output is correct
47	Correct	0 ms	348 KB	Output is correct
48	Correct	0 ms	348 KB	Output is correct
49	Correct	38 ms	6248 KB	Output is correct
50	Correct	152 ms	24148 KB	Output is correct
51	Correct	152 ms	24144 KB	Output is correct
52	Correct	162 ms	23968 KB	Output is correct
53	Correct	71 ms	14160 KB	Output is correct
54	Correct	72 ms	14164 KB	Output is correct
55	Correct	151 ms	24096 KB	Output is correct
56	Correct	163 ms	24148 KB	Output is correct
57	Correct	72 ms	14248 KB	Output is correct
58	Correct	0 ms	348 KB	Output is correct
59	Correct	0 ms	348 KB	Output is correct
60	Correct	3 ms	960 KB	Output is correct
61	Correct	75 ms	14112 KB	Output is correct
62	Correct	1 ms	344 KB	Output is correct
63	Correct	0 ms	348 KB	Output is correct
64	Correct	1 ms	344 KB	Output is correct
65	Correct	38 ms	6236 KB	Output is correct
66	Correct	71 ms	14244 KB	Output is correct
67	Correct	72 ms	14228 KB	Output is correct
68	Correct	71 ms	14024 KB	Output is correct
69	Correct	71 ms	14272 KB	Output is correct

Subtask #6
0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	392 KB	Output is correct
4	Correct	0 ms	352 KB	Output is correct
5	Correct	1 ms	352 KB	Output is correct
6	Correct	6 ms	1376 KB	Output is correct
7	Correct	151 ms	23992 KB	Output is correct
8	Correct	0 ms	352 KB	Output is correct
9	Correct	0 ms	352 KB	Output is correct
10	Correct	0 ms	352 KB	Output is correct
11	Correct	1 ms	352 KB	Output is correct
12	Correct	6 ms	1216 KB	Output is correct
13	Correct	155 ms	24308 KB	Output is correct
14	Correct	1 ms	352 KB	Output is correct
15	Correct	0 ms	352 KB	Output is correct
16	Correct	4 ms	864 KB	Output is correct
17	Correct	80 ms	14172 KB	Output is correct
18	Correct	1 ms	352 KB	Output is correct
19	Correct	0 ms	352 KB	Output is correct
20	Correct	38 ms	6240 KB	Output is correct
21	Correct	155 ms	23960 KB	Output is correct
22	Correct	150 ms	24080 KB	Output is correct
23	Correct	163 ms	24224 KB	Output is correct
24	Correct	179 ms	24096 KB	Output is correct
25	Correct	71 ms	14164 KB	Output is correct
26	Correct	103 ms	14352 KB	Output is correct
27	Correct	158 ms	23976 KB	Output is correct
28	Correct	150 ms	24024 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	7 ms	1288 KB	Output is correct
37	Correct	154 ms	24100 KB	Output is correct
38	Correct	1 ms	344 KB	Output is correct
39	Correct	0 ms	600 KB	Output is correct
40	Correct	6 ms	1368 KB	Output is correct
41	Correct	152 ms	24080 KB	Output is correct
42	Correct	1 ms	360 KB	Output is correct
43	Correct	1 ms	356 KB	Output is correct
44	Correct	4 ms	868 KB	Output is correct
45	Correct	79 ms	14124 KB	Output is correct
46	Correct	1 ms	344 KB	Output is correct
47	Correct	0 ms	348 KB	Output is correct
48	Correct	0 ms	348 KB	Output is correct
49	Correct	38 ms	6248 KB	Output is correct
50	Correct	152 ms	24148 KB	Output is correct
51	Correct	152 ms	24144 KB	Output is correct
52	Correct	162 ms	23968 KB	Output is correct
53	Correct	71 ms	14160 KB	Output is correct
54	Correct	72 ms	14164 KB	Output is correct
55	Correct	151 ms	24096 KB	Output is correct
56	Correct	163 ms	24148 KB	Output is correct
57	Correct	72 ms	14248 KB	Output is correct
58	Correct	0 ms	348 KB	Output is correct
59	Correct	0 ms	348 KB	Output is correct
60	Correct	0 ms	348 KB	Output is correct
61	Correct	38 ms	6320 KB	Output is correct
62	Correct	156 ms	24148 KB	Output is correct
63	Correct	156 ms	24148 KB	Output is correct
64	Correct	161 ms	24020 KB	Output is correct
65	Correct	0 ms	348 KB	Output is correct
66	Correct	39 ms	6228 KB	Output is correct
67	Correct	154 ms	24144 KB	Output is correct
68	Correct	151 ms	24052 KB	Output is correct
69	Correct	160 ms	24148 KB	Output is correct
70	Correct	1 ms	348 KB	Output is correct
71	Correct	1 ms	348 KB	Output is correct
72	Correct	0 ms	344 KB	Output is correct
73	Correct	39 ms	6388 KB	Output is correct
74	Correct	153 ms	24148 KB	Output is correct
75	Correct	159 ms	24144 KB	Output is correct
76	Correct	151 ms	23972 KB	Output is correct
77	Correct	149 ms	24148 KB	Output is correct
78	Correct	0 ms	348 KB	Output is correct
79	Correct	0 ms	348 KB	Output is correct
80	Correct	3 ms	960 KB	Output is correct
81	Correct	75 ms	14112 KB	Output is correct
82	Correct	1 ms	344 KB	Output is correct
83	Correct	0 ms	348 KB	Output is correct
84	Correct	1 ms	344 KB	Output is correct
85	Correct	38 ms	6236 KB	Output is correct
86	Correct	71 ms	14244 KB	Output is correct
87	Correct	72 ms	14228 KB	Output is correct
88	Correct	71 ms	14024 KB	Output is correct
89	Correct	71 ms	14272 KB	Output is correct
90	Correct	0 ms	600 KB	Output is correct
91	Correct	0 ms	348 KB	Output is correct
92	Correct	3 ms	960 KB	Output is correct
93	Correct	75 ms	14116 KB	Output is correct
94	Correct	0 ms	348 KB	Output is correct
95	Correct	0 ms	348 KB	Output is correct
96	Correct	0 ms	348 KB	Output is correct
97	Correct	19 ms	3932 KB	Output is correct
98	Correct	82 ms	14160 KB	Output is correct
99	Correct	78 ms	14232 KB	Output is correct
100	Correct	75 ms	14164 KB	Output is correct
101	Correct	72 ms	14160 KB	Output is correct
102	Correct	72 ms	14224 KB	Output is correct
103	Correct	71 ms	14160 KB	Output is correct
104	Incorrect	152 ms	24144 KB	Answer gives possible 1 while actual possible 0
105	Halted	0 ms	0 KB	-

답안 #948281

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 10.0 / 10.0

Subtask #3 19.0 / 19.0

Subtask #4 35.0 / 35.0

Subtask #5 21.0 / 21.0

Subtask #6 0 / 4.0

Subtask #1
11.0 / 11.0

Subtask #2
10.0 / 10.0

Subtask #3
19.0 / 19.0

Subtask #4
35.0 / 35.0

Subtask #5
21.0 / 21.0

Subtask #6
0 / 4.0