oj.uz

Submission #321142

# Submission time Handle Problem Language Result Execution time Memory
321142 2020-11-11T06:02:32 Z zaneyu Connecting Supertrees (IOI20_supertrees) C++14
100 / 100
 498 ms 23428 KB 
/*input
2
1 2
2 1
*/
#include "supertrees.h"
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("unroll-loops,no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
typedef long long int ll;
#define ld double
#define pii pair<ll,ll>
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
const ll maxn=1e3+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=(1e9+7);
const ll MOD2=1000002173;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
ll mult(ll a,ll b){
    return ((a%MOD)*(b%MOD))%MOD;
}
ll mypow(ll a,ll b,ll MOD){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=(res*a)%MOD;
        a=(a*a)%MOD;
        b>>=1;
    }
    return res;
}
int par[maxn];
int find(int x){
    if(x==par[x]) return x;
    return par[x]=find(par[x]);
}
void merge(int a,int b){
    a=find(a),b=find(b);
    if(a==b) return;
    par[a]=b;
}
vector<vector<int>> ans;
void ed(int a,int b){
    ans[a][b]=ans[b][a]=1;
}
vector<int> comp[maxn];
int construct(vector<vector<int>> p) {
    
    int n=sz(p);
    ans.resize(n);
    REP(i,n) par[i]=i,ans[i].resize(n);
    REP(i,n){
        REP(j,n){
            if(p[i][j]==3){
                return 0;
            }
            if(p[i][j]){
                merge(i,j);
            }
        }
    }
    REP(i,n){
        REP(j,n){
            if(!p[i][j] and find(i)==find(j)){
                return 0;
            }
        }
    }
    REP(i,n){
        //cout<<find(i)<<'\n';
        comp[find(i)].pb(i);
    }
    REP(i,n){
        REP(j,i){
            if(p[i][j]!=1){
                continue;
            }
            REP(k,j){
                if(p[i][j]==1 and p[j][k]==1 and p[i][k]!=1){
                    return 0;
                }
            }
        }
    }
    REP(i,n) par[i]=i;
    REP(i,n){
        REP(j,n){
            if(p[i][j]==1){
                merge(i,j);
            }
        }
    }
    REP(i,n){
        if(find(i)!=i){
            ed(i,par[i]);
        }
    }
 
    REP(i,n){
        vector<int> rt;
        for(int x:comp[i]){
            rt.pb(find(x));
        }
        SORT_UNIQUE(rt);
        if(sz(rt)==2) return 0;
        if(sz(rt)==1) continue;
        REP(j,sz(rt)){
            ed(rt[j],rt[(j+1)%sz(rt)]);
        }
    }
    build(ans);
    return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 13 ms 1260 KB Output is correct
7 Correct 498 ms 23396 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 13 ms 1260 KB Output is correct
7 Correct 498 ms 23396 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 11 ms 1388 KB Output is correct
13 Correct 249 ms 23268 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 5 ms 876 KB Output is correct
17 Correct 117 ms 13284 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 65 ms 6500 KB Output is correct
21 Correct 285 ms 23268 KB Output is correct
22 Correct 254 ms 23268 KB Output is correct
23 Correct 440 ms 23428 KB Output is correct
24 Correct 250 ms 23396 KB Output is correct
25 Correct 103 ms 13284 KB Output is correct
26 Correct 109 ms 13216 KB Output is correct
27 Correct 449 ms 23396 KB Output is correct
28 Correct 252 ms 23268 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 11 ms 1260 KB Output is correct
9 Correct 247 ms 22628 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 11 ms 1260 KB Output is correct
13 Correct 247 ms 22500 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 5 ms 876 KB Output is correct
17 Correct 113 ms 12776 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 68 ms 6244 KB Output is correct
22 Correct 256 ms 22628 KB Output is correct
23 Correct 258 ms 22500 KB Output is correct
24 Correct 262 ms 22500 KB Output is correct
25 Correct 103 ms 12644 KB Output is correct
26 Correct 103 ms 12644 KB Output is correct
27 Correct 252 ms 22500 KB Output is correct
28 Correct 272 ms 22500 KB Output is correct
29 Correct 105 ms 12644 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 66 ms 6372 KB Output is correct
5 Correct 281 ms 23176 KB Output is correct
6 Correct 260 ms 23300 KB Output is correct
7 Correct 441 ms 23396 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 67 ms 6368 KB Output is correct
10 Correct 266 ms 23268 KB Output is correct
11 Correct 266 ms 23268 KB Output is correct
12 Correct 268 ms 23268 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 65 ms 6372 KB Output is correct
17 Correct 262 ms 23396 KB Output is correct
18 Correct 261 ms 23268 KB Output is correct
19 Correct 256 ms 23268 KB Output is correct
20 Correct 250 ms 23268 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 13 ms 1260 KB Output is correct
7 Correct 498 ms 23396 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 11 ms 1388 KB Output is correct
13 Correct 249 ms 23268 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 5 ms 876 KB Output is correct
17 Correct 117 ms 13284 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 65 ms 6500 KB Output is correct
21 Correct 285 ms 23268 KB Output is correct
22 Correct 254 ms 23268 KB Output is correct
23 Correct 440 ms 23428 KB Output is correct
24 Correct 250 ms 23396 KB Output is correct
25 Correct 103 ms 13284 KB Output is correct
26 Correct 109 ms 13216 KB Output is correct
27 Correct 449 ms 23396 KB Output is correct
28 Correct 252 ms 23268 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 11 ms 1260 KB Output is correct
37 Correct 247 ms 22628 KB Output is correct
38 Correct 1 ms 492 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 11 ms 1260 KB Output is correct
41 Correct 247 ms 22500 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 5 ms 876 KB Output is correct
45 Correct 113 ms 12776 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 68 ms 6244 KB Output is correct
50 Correct 256 ms 22628 KB Output is correct
51 Correct 258 ms 22500 KB Output is correct
52 Correct 262 ms 22500 KB Output is correct
53 Correct 103 ms 12644 KB Output is correct
54 Correct 103 ms 12644 KB Output is correct
55 Correct 252 ms 22500 KB Output is correct
56 Correct 272 ms 22500 KB Output is correct
57 Correct 105 ms 12644 KB Output is correct
58 Correct 0 ms 364 KB Output is correct
59 Correct 1 ms 364 KB Output is correct
60 Correct 5 ms 876 KB Output is correct
61 Correct 112 ms 12644 KB Output is correct
62 Correct 1 ms 364 KB Output is correct
63 Correct 1 ms 364 KB Output is correct
64 Correct 1 ms 364 KB Output is correct
65 Correct 64 ms 6244 KB Output is correct
66 Correct 105 ms 12644 KB Output is correct
67 Correct 102 ms 12644 KB Output is correct
68 Correct 100 ms 12644 KB Output is correct
69 Correct 107 ms 12644 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 13 ms 1260 KB Output is correct
7 Correct 498 ms 23396 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 11 ms 1388 KB Output is correct
13 Correct 249 ms 23268 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 5 ms 876 KB Output is correct
17 Correct 117 ms 13284 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 65 ms 6500 KB Output is correct
21 Correct 285 ms 23268 KB Output is correct
22 Correct 254 ms 23268 KB Output is correct
23 Correct 440 ms 23428 KB Output is correct
24 Correct 250 ms 23396 KB Output is correct
25 Correct 103 ms 13284 KB Output is correct
26 Correct 109 ms 13216 KB Output is correct
27 Correct 449 ms 23396 KB Output is correct
28 Correct 252 ms 23268 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 11 ms 1260 KB Output is correct
37 Correct 247 ms 22628 KB Output is correct
38 Correct 1 ms 492 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 11 ms 1260 KB Output is correct
41 Correct 247 ms 22500 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 5 ms 876 KB Output is correct
45 Correct 113 ms 12776 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 68 ms 6244 KB Output is correct
50 Correct 256 ms 22628 KB Output is correct
51 Correct 258 ms 22500 KB Output is correct
52 Correct 262 ms 22500 KB Output is correct
53 Correct 103 ms 12644 KB Output is correct
54 Correct 103 ms 12644 KB Output is correct
55 Correct 252 ms 22500 KB Output is correct
56 Correct 272 ms 22500 KB Output is correct
57 Correct 105 ms 12644 KB Output is correct
58 Correct 1 ms 364 KB Output is correct
59 Correct 1 ms 364 KB Output is correct
60 Correct 1 ms 364 KB Output is correct
61 Correct 66 ms 6372 KB Output is correct
62 Correct 281 ms 23176 KB Output is correct
63 Correct 260 ms 23300 KB Output is correct
64 Correct 441 ms 23396 KB Output is correct
65 Correct 1 ms 364 KB Output is correct
66 Correct 67 ms 6368 KB Output is correct
67 Correct 266 ms 23268 KB Output is correct
68 Correct 266 ms 23268 KB Output is correct
69 Correct 268 ms 23268 KB Output is correct
70 Correct 1 ms 364 KB Output is correct
71 Correct 1 ms 364 KB Output is correct
72 Correct 1 ms 364 KB Output is correct
73 Correct 65 ms 6372 KB Output is correct
74 Correct 262 ms 23396 KB Output is correct
75 Correct 261 ms 23268 KB Output is correct
76 Correct 256 ms 23268 KB Output is correct
77 Correct 250 ms 23268 KB Output is correct
78 Correct 0 ms 364 KB Output is correct
79 Correct 1 ms 364 KB Output is correct
80 Correct 5 ms 876 KB Output is correct
81 Correct 112 ms 12644 KB Output is correct
82 Correct 1 ms 364 KB Output is correct
83 Correct 1 ms 364 KB Output is correct
84 Correct 1 ms 364 KB Output is correct
85 Correct 64 ms 6244 KB Output is correct
86 Correct 105 ms 12644 KB Output is correct
87 Correct 102 ms 12644 KB Output is correct
88 Correct 100 ms 12644 KB Output is correct
89 Correct 107 ms 12644 KB Output is correct
90 Correct 1 ms 364 KB Output is correct
91 Correct 1 ms 364 KB Output is correct
92 Correct 5 ms 876 KB Output is correct
93 Correct 98 ms 12644 KB Output is correct
94 Correct 0 ms 364 KB Output is correct
95 Correct 1 ms 364 KB Output is correct
96 Correct 1 ms 364 KB Output is correct
97 Correct 26 ms 3692 KB Output is correct
98 Correct 102 ms 12772 KB Output is correct
99 Correct 100 ms 12644 KB Output is correct
100 Correct 99 ms 12644 KB Output is correct
101 Correct 99 ms 12644 KB Output is correct
102 Correct 97 ms 12644 KB Output is correct
103 Correct 91 ms 12644 KB Output is correct
104 Correct 95 ms 12644 KB Output is correct
105 Correct 104 ms 12644 KB Output is correct