oj.uz

Submission #316887

# Submission time Handle Problem Language Result Execution time Memory
316887 2020-10-28T12:46:08 Z lukasanarski Connecting Supertrees (IOI20_supertrees) C++14
100 / 100
 278 ms 22264 KB 
#include<bits/stdc++.h>
#include "supertrees.h"
using namespace std;
const int N = 1001;
bool used[N];
vector<vector<int> > b;
int comp[N], line[N];
int construct(vector<vector<int> > p) {
    int n = p.size();
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < n; j++) {
            if(p[i][j] == 3) {
                return 0;
            }
        }
    }
    for(int i = 0; i < n; i++) {
        vector<int> v;
        v.resize(n);
        b.push_back(v);
    }
    //cout<<"Came!"<<endl;
    for(int i = 0; i < n; i++) {
        if(used[i]) {
            continue;
        }
        //cout<<"I: "<<i<<endl;
        vector<int> cycle;
        deque<int> D;
        D.push_back(i);
        while(D.size()) {
            int x = D.front();
            D.pop_front();
            if(used[x]) {
                continue;
            }
            //cout<<"X: "<<x<<endl;
            vector<int> curr;
            deque<int> G;
            G.push_back(x);
            cycle.push_back(x);
            while(G.size()) {
                int y = G.front();
                G.pop_front();
                if(used[y]) {
                    continue;
                }
                //cout<<"Y: "<<y<<endl;
                used[y] = true;
                comp[y] = i;
                line[y] = x;
                curr.push_back(y);
                for(int j = 0; j < n; j++) {
                    if(p[y][j] == 1) {
                        G.push_back(j);
                    } else if(p[y][j] == 2) {
                        D.push_back(j);
                    }
                }
            }
            if(curr.size() > 1) {
                for(int j = 0; j < (int)curr.size() - 1; j++) {
                    b[curr[j]][curr[j + 1]] = 1;
                    b[curr[j + 1]][curr[j]] = 1;
                }
            }
        }
        if(cycle.size() == 2) {
            return 0;
        }
        if(cycle.size() == 1) {
            continue;
        }
        for(int j = 0; j < (int)cycle.size() - 1; j++) {
            b[cycle[j]][cycle[j + 1]] = 1;
            b[cycle[j + 1]][cycle[j]] = 1;
        }
        b[cycle[0]][cycle[(int)cycle.size() - 1]] = 1;
        b[cycle[(int)cycle.size() - 1]][cycle[0]] = 1;
    }
    /*cout<<"Came!"<<endl;
    cout<<"Lines: "<<endl;
    for(int i = 0; i < n; i++) {
        cout<<line[i]<<" ";
    }
    cout<<endl;
    cout<<"Comps: "<<endl;
    for(int i = 0; i < n; i++) {
        cout<<comp[i]<<" ";
    }
    cout<<endl;*/
    for(int i = 0; i < n; i++) {
        for(int j = i + 1; j < n; j++) {
            if(line[i] == line[j]) {
                if(p[i][j] != 1) {
                    return 0;
                }
            } else if(comp[i] == comp[j]) {
                if(p[i][j] != 2) {
                    return 0;
                }
            } else if(p[i][j] != 0) {
                return 0;
            }
        }
    }

    /*for(int i = 0; i < n; i++) {
        for(int j = 0; j < n; j++) {
            cout<<b[i][j]<<" ";
        }
        cout<<endl;
    }*/

    build(b);
    return 1;
}

/*int main() {
    int n;
    cin>>n;
    vector<vector<int> > p(n);
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < n; j++) {
            int x;
            cin>>x;
            p[i].push_back(x);
        }
    }
    construct(p);

}*/

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 11 ms 1240 KB Output is correct
7 Correct 258 ms 22124 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 11 ms 1240 KB Output is correct
7 Correct 258 ms 22124 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 12 ms 1152 KB Output is correct
13 Correct 254 ms 22136 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 6 ms 896 KB Output is correct
17 Correct 128 ms 14204 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 63 ms 5880 KB Output is correct
21 Correct 255 ms 22264 KB Output is correct
22 Correct 254 ms 22136 KB Output is correct
23 Correct 262 ms 22132 KB Output is correct
24 Correct 250 ms 22136 KB Output is correct
25 Correct 114 ms 12280 KB Output is correct
26 Correct 116 ms 12152 KB Output is correct
27 Correct 259 ms 22132 KB Output is correct
28 Correct 249 ms 22108 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 11 ms 1152 KB Output is correct
9 Correct 261 ms 22104 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 11 ms 1240 KB Output is correct
13 Correct 263 ms 22136 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 6 ms 896 KB Output is correct
17 Correct 128 ms 14168 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 65 ms 5880 KB Output is correct
22 Correct 255 ms 22136 KB Output is correct
23 Correct 254 ms 22240 KB Output is correct
24 Correct 261 ms 22132 KB Output is correct
25 Correct 111 ms 12152 KB Output is correct
26 Correct 116 ms 12284 KB Output is correct
27 Correct 255 ms 22136 KB Output is correct
28 Correct 264 ms 22140 KB Output is correct
29 Correct 109 ms 12152 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 62 ms 5880 KB Output is correct
5 Correct 251 ms 22140 KB Output is correct
6 Correct 254 ms 22136 KB Output is correct
7 Correct 264 ms 22124 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 63 ms 5972 KB Output is correct
10 Correct 262 ms 22136 KB Output is correct
11 Correct 278 ms 22136 KB Output is correct
12 Correct 268 ms 22140 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 64 ms 5880 KB Output is correct
17 Correct 251 ms 22136 KB Output is correct
18 Correct 255 ms 22136 KB Output is correct
19 Correct 264 ms 22136 KB Output is correct
20 Correct 248 ms 22136 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 11 ms 1240 KB Output is correct
7 Correct 258 ms 22124 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 12 ms 1152 KB Output is correct
13 Correct 254 ms 22136 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 6 ms 896 KB Output is correct
17 Correct 128 ms 14204 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 63 ms 5880 KB Output is correct
21 Correct 255 ms 22264 KB Output is correct
22 Correct 254 ms 22136 KB Output is correct
23 Correct 262 ms 22132 KB Output is correct
24 Correct 250 ms 22136 KB Output is correct
25 Correct 114 ms 12280 KB Output is correct
26 Correct 116 ms 12152 KB Output is correct
27 Correct 259 ms 22132 KB Output is correct
28 Correct 249 ms 22108 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 0 ms 256 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 1 ms 256 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 11 ms 1152 KB Output is correct
37 Correct 261 ms 22104 KB Output is correct
38 Correct 1 ms 512 KB Output is correct
39 Correct 1 ms 256 KB Output is correct
40 Correct 11 ms 1240 KB Output is correct
41 Correct 263 ms 22136 KB Output is correct
42 Correct 0 ms 256 KB Output is correct
43 Correct 0 ms 384 KB Output is correct
44 Correct 6 ms 896 KB Output is correct
45 Correct 128 ms 14168 KB Output is correct
46 Correct 0 ms 384 KB Output is correct
47 Correct 0 ms 256 KB Output is correct
48 Correct 1 ms 256 KB Output is correct
49 Correct 65 ms 5880 KB Output is correct
50 Correct 255 ms 22136 KB Output is correct
51 Correct 254 ms 22240 KB Output is correct
52 Correct 261 ms 22132 KB Output is correct
53 Correct 111 ms 12152 KB Output is correct
54 Correct 116 ms 12284 KB Output is correct
55 Correct 255 ms 22136 KB Output is correct
56 Correct 264 ms 22140 KB Output is correct
57 Correct 109 ms 12152 KB Output is correct
58 Correct 0 ms 256 KB Output is correct
59 Correct 0 ms 256 KB Output is correct
60 Correct 6 ms 896 KB Output is correct
61 Correct 130 ms 14840 KB Output is correct
62 Correct 1 ms 256 KB Output is correct
63 Correct 0 ms 384 KB Output is correct
64 Correct 1 ms 256 KB Output is correct
65 Correct 63 ms 5752 KB Output is correct
66 Correct 114 ms 12280 KB Output is correct
67 Correct 114 ms 12284 KB Output is correct
68 Correct 116 ms 12152 KB Output is correct
69 Correct 108 ms 12152 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 11 ms 1240 KB Output is correct
7 Correct 258 ms 22124 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 12 ms 1152 KB Output is correct
13 Correct 254 ms 22136 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 6 ms 896 KB Output is correct
17 Correct 128 ms 14204 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 63 ms 5880 KB Output is correct
21 Correct 255 ms 22264 KB Output is correct
22 Correct 254 ms 22136 KB Output is correct
23 Correct 262 ms 22132 KB Output is correct
24 Correct 250 ms 22136 KB Output is correct
25 Correct 114 ms 12280 KB Output is correct
26 Correct 116 ms 12152 KB Output is correct
27 Correct 259 ms 22132 KB Output is correct
28 Correct 249 ms 22108 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 0 ms 256 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 1 ms 256 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 11 ms 1152 KB Output is correct
37 Correct 261 ms 22104 KB Output is correct
38 Correct 1 ms 512 KB Output is correct
39 Correct 1 ms 256 KB Output is correct
40 Correct 11 ms 1240 KB Output is correct
41 Correct 263 ms 22136 KB Output is correct
42 Correct 0 ms 256 KB Output is correct
43 Correct 0 ms 384 KB Output is correct
44 Correct 6 ms 896 KB Output is correct
45 Correct 128 ms 14168 KB Output is correct
46 Correct 0 ms 384 KB Output is correct
47 Correct 0 ms 256 KB Output is correct
48 Correct 1 ms 256 KB Output is correct
49 Correct 65 ms 5880 KB Output is correct
50 Correct 255 ms 22136 KB Output is correct
51 Correct 254 ms 22240 KB Output is correct
52 Correct 261 ms 22132 KB Output is correct
53 Correct 111 ms 12152 KB Output is correct
54 Correct 116 ms 12284 KB Output is correct
55 Correct 255 ms 22136 KB Output is correct
56 Correct 264 ms 22140 KB Output is correct
57 Correct 109 ms 12152 KB Output is correct
58 Correct 0 ms 256 KB Output is correct
59 Correct 1 ms 256 KB Output is correct
60 Correct 1 ms 256 KB Output is correct
61 Correct 62 ms 5880 KB Output is correct
62 Correct 251 ms 22140 KB Output is correct
63 Correct 254 ms 22136 KB Output is correct
64 Correct 264 ms 22124 KB Output is correct
65 Correct 0 ms 256 KB Output is correct
66 Correct 63 ms 5972 KB Output is correct
67 Correct 262 ms 22136 KB Output is correct
68 Correct 278 ms 22136 KB Output is correct
69 Correct 268 ms 22140 KB Output is correct
70 Correct 1 ms 256 KB Output is correct
71 Correct 1 ms 256 KB Output is correct
72 Correct 1 ms 256 KB Output is correct
73 Correct 64 ms 5880 KB Output is correct
74 Correct 251 ms 22136 KB Output is correct
75 Correct 255 ms 22136 KB Output is correct
76 Correct 264 ms 22136 KB Output is correct
77 Correct 248 ms 22136 KB Output is correct
78 Correct 0 ms 256 KB Output is correct
79 Correct 0 ms 256 KB Output is correct
80 Correct 6 ms 896 KB Output is correct
81 Correct 130 ms 14840 KB Output is correct
82 Correct 1 ms 256 KB Output is correct
83 Correct 0 ms 384 KB Output is correct
84 Correct 1 ms 256 KB Output is correct
85 Correct 63 ms 5752 KB Output is correct
86 Correct 114 ms 12280 KB Output is correct
87 Correct 114 ms 12284 KB Output is correct
88 Correct 116 ms 12152 KB Output is correct
89 Correct 108 ms 12152 KB Output is correct
90 Correct 1 ms 256 KB Output is correct
91 Correct 0 ms 256 KB Output is correct
92 Correct 5 ms 640 KB Output is correct
93 Correct 111 ms 8184 KB Output is correct
94 Correct 1 ms 256 KB Output is correct
95 Correct 0 ms 256 KB Output is correct
96 Correct 0 ms 256 KB Output is correct
97 Correct 26 ms 2296 KB Output is correct
98 Correct 105 ms 8184 KB Output is correct
99 Correct 107 ms 8184 KB Output is correct
100 Correct 107 ms 8184 KB Output is correct
101 Correct 107 ms 8184 KB Output is correct
102 Correct 114 ms 8184 KB Output is correct
103 Correct 108 ms 8184 KB Output is correct
104 Correct 111 ms 8184 KB Output is correct
105 Correct 110 ms 8220 KB Output is correct