oj.uz

Submission #372577

# Submission time Handle Problem Language Result Execution time Memory
372577 2021-03-01T00:31:54 Z iliccmarko Connecting Supertrees (IOI20_supertrees) C++14
56 / 100
 275 ms 22400 KB 
#include <bits/stdc++.h>
#include "supertrees.h"
using namespace std;
#define ll long long
#define endl "\n"
#define INF 1000000000
#define LINF 10000000000000000000LL
#define pb push_back
#define all(x) x.begin(), x.end()
#define len(s) (int)s.size()
#define test_case { int t; cin>>t; while(t--)solve(); }
#define single_case solve();
#define line cerr<<"----------"<<endl;
#define ios { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cerr.tie(NULL); }
#define mod 1000000007LL
const int N = 1005;
int parent[N], s[N];

int find_parent(int u)
{
    while(parent[u]!=u)
    {
        parent[u] = parent[parent[u]];
        u = parent[u];
    }
    return u;
}

void dsu(int u, int v)
{
    u = find_parent(u);
    v = find_parent(v);
    if(u!=v)
    {
        if(s[u]<s[v]) swap(u, v);
        s[u] += s[v];
        parent[v] = u;
    }
}


int construct(vector<vector<int> > p)
{
    int n = len(p);
    for(int i = 0;i<n;i++) parent[i] = i, s[i] = 1;
    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++)
        for(int j = 0;j<n;j++) if(p[i][j]==1) dsu(i, j);
    vector<int> r;
    vector<int> rr(n, 0);
    vector<vector<int> > res(n, vector<int>(n, 0));
    for(int i = 0;i<n;++i) {
        int x = find_parent(i);
        if(x==i) r.pb(i), rr[i] = 1;
        else res[i][x] = res[x][i] = 1;
    }
    for(int i = 0;i<n;i++)
        for(int j = 0;j<n;j++)
        if(p[i][j]!=p[find_parent(i)][find_parent(j)]) return 0;
    for(int i = 0;i<n;i++)
    {
        if(find_parent(i)==i&&rr[i])
        {
           vector<int> q;
           for(int j = 0;j<n;j++) if(j!=i&&find_parent(j)==i) q.pb(j);
           for(int x : q)
           {
               for(int y : q)
               {
                   if(x!=y)
                   {
                       if(p[x][y]!=1) return 0;
                   }
               }
           }
        }
    }
    for(int i = 0;i<n;i++) parent[i] = i, s[i] = 1;
    for(int i = 0;i<n;++i)
        for(int j = 0;j<n;j++)
        if(rr[i]==1&&rr[j]==1&&p[i][j]==2) dsu(i, j);
    for(int i = 0;i<n;++i){
        int x = find_parent(i);
        if(x==i&&rr[i])
        {
            if(s[i]==1) continue;
            vector<int> q;
            for(int j = 0;j<n;j++)
                if(rr[j]&&find_parent(j)==i&&j!=i) q.pb(j);
            q.pb(i);
            int pret = i;
            if(len(q)<=2) return 0;
            for(int w : q) res[w][pret] = res[pret][w] = 1, pret = w;
        }
    }
    build(res);
    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 10 ms 1260 KB Output is correct
7 Correct 248 ms 22104 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 10 ms 1260 KB Output is correct
7 Correct 248 ms 22104 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 0 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 1260 KB Output is correct
13 Correct 249 ms 22400 KB Output is correct
14 Correct 0 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 5 ms 748 KB Output is correct
17 Correct 116 ms 12140 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 0 ms 364 KB Output is correct
20 Correct 63 ms 5868 KB Output is correct
21 Correct 255 ms 22252 KB Output is correct
22 Correct 257 ms 22116 KB Output is correct
23 Correct 266 ms 22124 KB Output is correct
24 Correct 250 ms 22124 KB Output is correct
25 Correct 101 ms 12140 KB Output is correct
26 Correct 101 ms 12140 KB Output is correct
27 Correct 264 ms 22252 KB Output is correct
28 Correct 251 ms 22116 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 384 KB Output is correct
8 Correct 11 ms 1260 KB Output is correct
9 Correct 257 ms 22124 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 1260 KB Output is correct
13 Correct 245 ms 22124 KB Output is correct
14 Incorrect 1 ms 364 KB Answer gives possible 1 while actual possible 0
15 Halted 0 ms 0 KB -

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 63 ms 5868 KB Output is correct
5 Correct 257 ms 22116 KB Output is correct
6 Correct 253 ms 22140 KB Output is correct
7 Correct 275 ms 22116 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 63 ms 5868 KB Output is correct
10 Correct 258 ms 22252 KB Output is correct
11 Correct 249 ms 22124 KB Output is correct
12 Correct 260 ms 22124 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 64 ms 5868 KB Output is correct
17 Correct 253 ms 22124 KB Output is correct
18 Correct 261 ms 22124 KB Output is correct
19 Correct 257 ms 22124 KB Output is correct
20 Correct 248 ms 22124 KB Output is correct

Subtask #5
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 10 ms 1260 KB Output is correct
7 Correct 248 ms 22104 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 0 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 1260 KB Output is correct
13 Correct 249 ms 22400 KB Output is correct
14 Correct 0 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 5 ms 748 KB Output is correct
17 Correct 116 ms 12140 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 0 ms 364 KB Output is correct
20 Correct 63 ms 5868 KB Output is correct
21 Correct 255 ms 22252 KB Output is correct
22 Correct 257 ms 22116 KB Output is correct
23 Correct 266 ms 22124 KB Output is correct
24 Correct 250 ms 22124 KB Output is correct
25 Correct 101 ms 12140 KB Output is correct
26 Correct 101 ms 12140 KB Output is correct
27 Correct 264 ms 22252 KB Output is correct
28 Correct 251 ms 22116 KB Output is correct
29 Correct 0 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 384 KB Output is correct
36 Correct 11 ms 1260 KB Output is correct
37 Correct 257 ms 22124 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 11 ms 1260 KB Output is correct
41 Correct 245 ms 22124 KB Output is correct
42 Incorrect 1 ms 364 KB Answer gives possible 1 while actual possible 0
43 Halted 0 ms 0 KB -

Subtask #6
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 10 ms 1260 KB Output is correct
7 Correct 248 ms 22104 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 0 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 1260 KB Output is correct
13 Correct 249 ms 22400 KB Output is correct
14 Correct 0 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 5 ms 748 KB Output is correct
17 Correct 116 ms 12140 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 0 ms 364 KB Output is correct
20 Correct 63 ms 5868 KB Output is correct
21 Correct 255 ms 22252 KB Output is correct
22 Correct 257 ms 22116 KB Output is correct
23 Correct 266 ms 22124 KB Output is correct
24 Correct 250 ms 22124 KB Output is correct
25 Correct 101 ms 12140 KB Output is correct
26 Correct 101 ms 12140 KB Output is correct
27 Correct 264 ms 22252 KB Output is correct
28 Correct 251 ms 22116 KB Output is correct
29 Correct 0 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 384 KB Output is correct
36 Correct 11 ms 1260 KB Output is correct
37 Correct 257 ms 22124 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 11 ms 1260 KB Output is correct
41 Correct 245 ms 22124 KB Output is correct
42 Incorrect 1 ms 364 KB Answer gives possible 1 while actual possible 0
43 Halted 0 ms 0 KB -