oj.uz

Submission #625139

# Submission time Handle Problem Language Result Execution time Memory
625139 2022-08-09T13:09:45 Z Dremix10 Connecting Supertrees (IOI20_supertrees) C++17
21 / 100
 212 ms 29088 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
#define F first
#define S second
#define all(x) (x).begin(),(x).end()
#ifdef dremix
    #define p(x) cerr<<#x<<" = "<<x<<endl;
    #define p2(x,y) cerr<<#x<<" , "<<#y<<" = "<<x<<" , "<<y<<endl;
    #define pv(x) cerr<<#x<<" = {";for(auto v : x)cerr<<x<<", ";cerr<<"}"<<endl;
#else
    #define p(x) {}
    #define p2(x,y) {}
    #define pv(x) {}
#endif
const ll INF = 2e18+5;
const int MOD = 1e9+7;
const int N = 1005;

vector<vector<int> > ans;
int v[N];
vector<vector<vector<int> > > a(N,vector<vector<int> >(3,vector<int>()));

int nn;
bool flag = true;

vector<int> par(N),siz(N,1);
vector<vector<int> > g(N);
vector<int> s(N),e(N);

int find(int x){
    return (par[x] == x) ? x : par[x] = find(par[x]);
}
bool go = false;
bool join(int x, int y){
    x = find(x);
    y = find(y);
    if(x == y)return false;
    if(g[y].size() > g[x].size())swap(x,y);
    siz[x] += siz[y];
    par[y] = x;
    for(auto v : g[y])g[x].push_back(v);
    g[y].clear();
    p2(s[x],e[x])
    p2(s[y],e[y])
    if(go)
        ans[e[x]][s[y]] = ans[s[y]][e[x]] = 1;
    e[x] = e[y];
    return true;

}

int construct(std::vector<std::vector<int>> p) {
	int i,j,n = p.size();
    ans.assign(n,vector<int>(n,0)); 
    for(i=0;i<n;i++){
        g[i].push_back(i);
        for(j=0;j<n;j++){
            if(i==j)continue;
            if(p[i][j] == 3)return 0;
            a[i][p[i][j]].push_back(j);
        }
    }

    iota(all(par),0);
    iota(all(s),0);
    iota(all(e),0);
    
    for(i=0;i<n;i++){
        if(v[i]){
            continue;
        }
        //vector<int> chk;
        //chk.push_back(i);
        int x = i;
        v[i] = true;
        for(auto j : a[i][1]){
            join(i,j);
            p2(i,j)
            //chk.push_back(j);    
            ans[x][j] = ans[j][x] = 1;
            x = j;

            v[j] = true;
        }
        s[find(i)] = i;
        e[find(i)] = i;
        for(int k=0;k<n;k++){
            bool ok = true;
            int need = p[i][k];
            for(auto j : g[find(i)]){
                if(j == k)continue;
                if(p[j][k] != need){
                    ok = false;
                    break;
                }
            }
            if(!ok){
                flag = false;
                break;
            }
        }

    }
    if(!flag)return 0;
    fill(all(siz),1);
    go = true;
    for(i=0;i<n;i++){
        for(auto x : a[i][2]){
            //if(find(i) == find(x))continue;
            for(auto v1 : g[find(x)]){
                if(p[i][v1] != 2){
                    return 0;
                }
            }
            //ans[i][x] = ans[x][i] = 1;
            join(i,x);
            p2(i,x)
        }
    }

    for(i=0;i<n;i++){
        if(siz[find(i)] == 2)return 0;
    }

    for(i=0;i<n;i++){
        int x = s[find(i)];
        int y = e[find(i)];
        if(siz[find(i)] == 1)continue;
        ans[x][y] = ans[y][x] = 1;
    }

    if(!flag)return 0;
    build(ans);
    return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 444 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 10 ms 1620 KB Output is correct
7 Correct 199 ms 27120 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 444 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 10 ms 1620 KB Output is correct
7 Correct 199 ms 27120 KB Output is correct
8 Correct 1 ms 444 KB Output is correct
9 Correct 0 ms 448 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 10 ms 1612 KB Output is correct
13 Correct 181 ms 27024 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 448 KB Output is correct
16 Correct 5 ms 1108 KB Output is correct
17 Correct 101 ms 17544 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 444 KB Output is correct
20 Correct 47 ms 7256 KB Output is correct
21 Correct 177 ms 27628 KB Output is correct
22 Correct 212 ms 27032 KB Output is correct
23 Correct 198 ms 26956 KB Output is correct
24 Correct 187 ms 27084 KB Output is correct
25 Correct 84 ms 17340 KB Output is correct
26 Correct 81 ms 16684 KB Output is correct
27 Correct 205 ms 29088 KB Output is correct
28 Correct 183 ms 26960 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 452 KB Output is correct
3 Correct 1 ms 444 KB Output is correct
4 Correct 1 ms 448 KB Output is correct
5 Incorrect 1 ms 340 KB Answer gives possible 0 while actual possible 1
6 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Incorrect 1 ms 340 KB Answer gives possible 0 while actual possible 1
3 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 444 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 10 ms 1620 KB Output is correct
7 Correct 199 ms 27120 KB Output is correct
8 Correct 1 ms 444 KB Output is correct
9 Correct 0 ms 448 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 10 ms 1612 KB Output is correct
13 Correct 181 ms 27024 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 448 KB Output is correct
16 Correct 5 ms 1108 KB Output is correct
17 Correct 101 ms 17544 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 444 KB Output is correct
20 Correct 47 ms 7256 KB Output is correct
21 Correct 177 ms 27628 KB Output is correct
22 Correct 212 ms 27032 KB Output is correct
23 Correct 198 ms 26956 KB Output is correct
24 Correct 187 ms 27084 KB Output is correct
25 Correct 84 ms 17340 KB Output is correct
26 Correct 81 ms 16684 KB Output is correct
27 Correct 205 ms 29088 KB Output is correct
28 Correct 183 ms 26960 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 452 KB Output is correct
31 Correct 1 ms 444 KB Output is correct
32 Correct 1 ms 448 KB Output is correct
33 Incorrect 1 ms 340 KB Answer gives possible 0 while actual possible 1
34 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 444 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 10 ms 1620 KB Output is correct
7 Correct 199 ms 27120 KB Output is correct
8 Correct 1 ms 444 KB Output is correct
9 Correct 0 ms 448 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 10 ms 1612 KB Output is correct
13 Correct 181 ms 27024 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 448 KB Output is correct
16 Correct 5 ms 1108 KB Output is correct
17 Correct 101 ms 17544 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 444 KB Output is correct
20 Correct 47 ms 7256 KB Output is correct
21 Correct 177 ms 27628 KB Output is correct
22 Correct 212 ms 27032 KB Output is correct
23 Correct 198 ms 26956 KB Output is correct
24 Correct 187 ms 27084 KB Output is correct
25 Correct 84 ms 17340 KB Output is correct
26 Correct 81 ms 16684 KB Output is correct
27 Correct 205 ms 29088 KB Output is correct
28 Correct 183 ms 26960 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 452 KB Output is correct
31 Correct 1 ms 444 KB Output is correct
32 Correct 1 ms 448 KB Output is correct
33 Incorrect 1 ms 340 KB Answer gives possible 0 while actual possible 1
34 Halted 0 ms 0 KB -