oj.uz

Submission #441740

# Submission time Handle Problem Language Result Execution time Memory
441740 2021-07-06T00:47:02 Z julian33 Connecting Supertrees (IOI20_supertrees) C++14
40 / 100
 257 ms 24104 KB 
#include <bits/stdc++.h>
#include "supertrees.h"

using namespace std;

#ifdef LOCAL
#define deb(...) logger(#__VA_ARGS__, __VA_ARGS__)
template<typename ...Args>
void logger(string vars, Args&&... values) {
    cerr<<vars<<" = ";
    string delim="";
    (...,(cerr<<delim<<values,delim=", "));
    cerr<<"\n";
}
#else
#define deb(...) logger(#__VA_ARGS__, __VA_ARGS__)
template<typename ...Args>
void logger(string vars, Args&&... values) {}
#endif

#define FOR(i,j,n) for(int i=j;i<n;i++)

#define pb push_back
#define sz(x) (int)(x.size())
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<typename T> inline void maxa(T& a,T b){a=max(a,b);}
template<typename T> inline void mina(T& a,T b){a=min(a,b);} 

/*
subtask 1: make a line graph
subtask 2: make multiple line graphs, make sure no components have contradictions
subtask 3: make multiple rings, make sure no contradictions
subtask 4: in each component, make components of 2s. Form these into rings. connect the rings. 
then get components of ones and make them into line graphs.
subtask 5: subtask 4 and check for contradictions
subtask 6: for the components of 3, make a ring and add an extra edge

rings must have at least 3 nodes
3-rings must have at least 4 nodes
*/

// void build(vector<vector<int>> b){
//     int n=sz(b); 
//     for(int i=0;i<n;i++){
//         for(int j=0;j<n;j++){
//             cout<<b[i][j]<<" ";
//         }
//         cout<<"\n";
//     }
// }

const int mxN=1e3+5;

int uf[mxN];

int find(int x){return uf[x]<0?x:uf[x]=find(uf[x]);}
bool same(int x,int y){return find(x)==find(y);}
void unite(int x,int y){
    x=find(x); y=find(y);
    if(x==y)
        return;
    if(uf[x]>uf[y])
        swap(x,y);
    uf[x]+=uf[y]; uf[y]=x;
}

int construct(vector<vector<int>> p){
    memset(uf,-1,sizeof(uf));
    int n=sz(p);
    vector<vector<int>> b;
    b.resize(n);
    for(auto &u:b)
        u.resize(n);
    
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            if(p[i][j])
                unite(i,j);
        }
    }
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            if(!p[i][j] && same(i,j))
                return 0;
        }
    }
    vector<int> component[n];
    for(int i=0;i<n;i++){
        component[find(i)].pb(i);
    }
    for(auto u:component){
        if(sz(u)<=1)
            continue;
        if(sz(u)==2 && p[u[0]][u[1]]==2)
            return 0;
        for(int i=0;i<sz(u)-1;i++){
            b[u[i]][u[i+1]]=b[u[i+1]][u[i]]=1;
        }
        if(p[u[0]][u[1]]==2)
            b[u[0]][u.back()]=b[u.back()][u[0]]=1;
    }
    build(b);
    return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 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 1 ms 204 KB Output is correct
6 Correct 10 ms 1100 KB Output is correct
7 Correct 257 ms 21956 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 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 1 ms 204 KB Output is correct
6 Correct 10 ms 1100 KB Output is correct
7 Correct 257 ms 21956 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 1 ms 292 KB Output is correct
12 Correct 10 ms 1244 KB Output is correct
13 Correct 240 ms 23948 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 796 KB Output is correct
17 Correct 121 ms 14064 KB Output is correct
18 Correct 1 ms 300 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 59 ms 6148 KB Output is correct
21 Correct 234 ms 23932 KB Output is correct
22 Correct 228 ms 23940 KB Output is correct
23 Correct 255 ms 23932 KB Output is correct
24 Correct 225 ms 24004 KB Output is correct
25 Correct 100 ms 14020 KB Output is correct
26 Correct 102 ms 14068 KB Output is correct
27 Correct 253 ms 23928 KB Output is correct
28 Correct 232 ms 23972 KB Output is correct

Subtask #3
19.0 / 19.0

# 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 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 10 ms 1204 KB Output is correct
9 Correct 224 ms 24044 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 10 ms 1304 KB Output is correct
13 Correct 240 ms 23936 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 5 ms 796 KB Output is correct
17 Correct 111 ms 14068 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 74 ms 6244 KB Output is correct
22 Correct 230 ms 23940 KB Output is correct
23 Correct 248 ms 23940 KB Output is correct
24 Correct 252 ms 23932 KB Output is correct
25 Correct 102 ms 14072 KB Output is correct
26 Correct 97 ms 14068 KB Output is correct
27 Correct 227 ms 23924 KB Output is correct
28 Correct 247 ms 23936 KB Output is correct
29 Correct 103 ms 14020 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 58 ms 6260 KB Output is correct
5 Correct 233 ms 23992 KB Output is correct
6 Correct 232 ms 24104 KB Output is correct
7 Correct 247 ms 24004 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 62 ms 6260 KB Output is correct
10 Correct 235 ms 23916 KB Output is correct
11 Correct 240 ms 23924 KB Output is correct
12 Correct 250 ms 23924 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Incorrect 0 ms 204 KB Too many ways to get from 0 to 4, should be 1 found no less than 2
16 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 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 1 ms 204 KB Output is correct
6 Correct 10 ms 1100 KB Output is correct
7 Correct 257 ms 21956 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 1 ms 292 KB Output is correct
12 Correct 10 ms 1244 KB Output is correct
13 Correct 240 ms 23948 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 796 KB Output is correct
17 Correct 121 ms 14064 KB Output is correct
18 Correct 1 ms 300 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 59 ms 6148 KB Output is correct
21 Correct 234 ms 23932 KB Output is correct
22 Correct 228 ms 23940 KB Output is correct
23 Correct 255 ms 23932 KB Output is correct
24 Correct 225 ms 24004 KB Output is correct
25 Correct 100 ms 14020 KB Output is correct
26 Correct 102 ms 14068 KB Output is correct
27 Correct 253 ms 23928 KB Output is correct
28 Correct 232 ms 23972 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 296 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 10 ms 1204 KB Output is correct
37 Correct 224 ms 24044 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 10 ms 1304 KB Output is correct
41 Correct 240 ms 23936 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 5 ms 796 KB Output is correct
45 Correct 111 ms 14068 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 74 ms 6244 KB Output is correct
50 Correct 230 ms 23940 KB Output is correct
51 Correct 248 ms 23940 KB Output is correct
52 Correct 252 ms 23932 KB Output is correct
53 Correct 102 ms 14072 KB Output is correct
54 Correct 97 ms 14068 KB Output is correct
55 Correct 227 ms 23924 KB Output is correct
56 Correct 247 ms 23936 KB Output is correct
57 Correct 103 ms 14020 KB Output is correct
58 Correct 1 ms 296 KB Output is correct
59 Correct 1 ms 204 KB Output is correct
60 Correct 6 ms 844 KB Output is correct
61 Correct 109 ms 14060 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 Incorrect 58 ms 6256 KB Too many ways to get from 1 to 269, should be 1 found no less than 2
66 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 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 1 ms 204 KB Output is correct
6 Correct 10 ms 1100 KB Output is correct
7 Correct 257 ms 21956 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 1 ms 292 KB Output is correct
12 Correct 10 ms 1244 KB Output is correct
13 Correct 240 ms 23948 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 796 KB Output is correct
17 Correct 121 ms 14064 KB Output is correct
18 Correct 1 ms 300 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 59 ms 6148 KB Output is correct
21 Correct 234 ms 23932 KB Output is correct
22 Correct 228 ms 23940 KB Output is correct
23 Correct 255 ms 23932 KB Output is correct
24 Correct 225 ms 24004 KB Output is correct
25 Correct 100 ms 14020 KB Output is correct
26 Correct 102 ms 14068 KB Output is correct
27 Correct 253 ms 23928 KB Output is correct
28 Correct 232 ms 23972 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 296 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 10 ms 1204 KB Output is correct
37 Correct 224 ms 24044 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 10 ms 1304 KB Output is correct
41 Correct 240 ms 23936 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 5 ms 796 KB Output is correct
45 Correct 111 ms 14068 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 74 ms 6244 KB Output is correct
50 Correct 230 ms 23940 KB Output is correct
51 Correct 248 ms 23940 KB Output is correct
52 Correct 252 ms 23932 KB Output is correct
53 Correct 102 ms 14072 KB Output is correct
54 Correct 97 ms 14068 KB Output is correct
55 Correct 227 ms 23924 KB Output is correct
56 Correct 247 ms 23936 KB Output is correct
57 Correct 103 ms 14020 KB Output is correct
58 Correct 1 ms 204 KB Output is correct
59 Correct 0 ms 204 KB Output is correct
60 Correct 0 ms 204 KB Output is correct
61 Correct 58 ms 6260 KB Output is correct
62 Correct 233 ms 23992 KB Output is correct
63 Correct 232 ms 24104 KB Output is correct
64 Correct 247 ms 24004 KB Output is correct
65 Correct 1 ms 204 KB Output is correct
66 Correct 62 ms 6260 KB Output is correct
67 Correct 235 ms 23916 KB Output is correct
68 Correct 240 ms 23924 KB Output is correct
69 Correct 250 ms 23924 KB Output is correct
70 Correct 1 ms 204 KB Output is correct
71 Correct 0 ms 204 KB Output is correct
72 Incorrect 0 ms 204 KB Too many ways to get from 0 to 4, should be 1 found no less than 2
73 Halted 0 ms 0 KB -