oj.uz

Submission #441977

# Submission time Handle Problem Language Result Execution time Memory
441977 2021-07-06T15:53:21 Z julian33 Connecting Supertrees (IOI20_supertrees) C++14
40 / 100
 272 ms 28100 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);} 

// 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],par[mxN];
vector<int> component[mxN];
vector<vector<int>> g;

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){
    g=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(g[i][j]){
                unite(i,j);
            }
        }
    }
    for(int i=0;i<n;i++){
        component[find(i)].pb(i);
        for(int j=0;j<n;j++){
            if(!g[i][j] && same(i,j))
                return 0;
        }
    }
    for(int i=0;i<n;i++){
        //u pretty much have one line graph and one ring
        if(sz(component[i])<=1)
            continue;
        vector<int> line; vector<int> ring;
        for(int &j:component[i]){
            int one=0;
            for(int k=0;k<n;k++){
                if(g[j][k]==1 && j!=k){
                    one=1;
                    break;
                }
            }
            if(one)
                line.pb(j);
            else
                ring.pb(j);
        }
        for(int j=0;j<sz(line)-1;j++){
            b[line[j]][line[j+1]]=b[line[j+1]][line[j]]=1;
        }
        for(int j=0;j<sz(ring)-1;j++){
            b[ring[j]][ring[j+1]]=b[ring[j+1]][ring[j]]=1;
        }
        if(sz(ring)==1){
            return 0;
        }
        if(sz(line) && sz(ring)){
            b[line.back()][ring.back()]=b[ring.back()][line.back()]=1;
            b[ring[0]][line.back()]=b[line.back()][ring[0]]=1;
        }
        if(sz(line)==0){
            if(sz(ring)==2)
                return 0;
            b[ring.back()][ring[0]]=b[ring[0]][ring.back()]=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 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 12 ms 1452 KB Output is correct
7 Correct 236 ms 27920 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 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 12 ms 1452 KB Output is correct
7 Correct 236 ms 27920 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 11 ms 1356 KB Output is correct
13 Correct 239 ms 27968 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 972 KB Output is correct
17 Correct 115 ms 17944 KB Output is correct
18 Correct 1 ms 316 KB Output is correct
19 Correct 1 ms 324 KB Output is correct
20 Correct 64 ms 7180 KB Output is correct
21 Correct 243 ms 27872 KB Output is correct
22 Correct 244 ms 27960 KB Output is correct
23 Correct 255 ms 27928 KB Output is correct
24 Correct 240 ms 27972 KB Output is correct
25 Correct 101 ms 18056 KB Output is correct
26 Correct 132 ms 18068 KB Output is correct
27 Correct 263 ms 27968 KB Output is correct
28 Correct 235 ms 27960 KB Output is correct

Subtask #3
19.0 / 19.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 324 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 1356 KB Output is correct
9 Correct 236 ms 27952 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 11 ms 1420 KB Output is correct
13 Correct 266 ms 27972 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 940 KB Output is correct
17 Correct 115 ms 18084 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 60 ms 7176 KB Output is correct
22 Correct 249 ms 28100 KB Output is correct
23 Correct 257 ms 28100 KB Output is correct
24 Correct 253 ms 27912 KB Output is correct
25 Correct 100 ms 17988 KB Output is correct
26 Correct 102 ms 18060 KB Output is correct
27 Correct 272 ms 27972 KB Output is correct
28 Correct 260 ms 27924 KB Output is correct
29 Correct 113 ms 18052 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 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 65 ms 7300 KB Output is correct
5 Correct 258 ms 27944 KB Output is correct
6 Correct 245 ms 27924 KB Output is correct
7 Correct 263 ms 28056 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 60 ms 7300 KB Output is correct
10 Correct 242 ms 28048 KB Output is correct
11 Correct 247 ms 28024 KB Output is correct
12 Correct 259 ms 27920 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Incorrect 26 ms 4744 KB Answer gives possible 0 while actual possible 1
17 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 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 12 ms 1452 KB Output is correct
7 Correct 236 ms 27920 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 11 ms 1356 KB Output is correct
13 Correct 239 ms 27968 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 972 KB Output is correct
17 Correct 115 ms 17944 KB Output is correct
18 Correct 1 ms 316 KB Output is correct
19 Correct 1 ms 324 KB Output is correct
20 Correct 64 ms 7180 KB Output is correct
21 Correct 243 ms 27872 KB Output is correct
22 Correct 244 ms 27960 KB Output is correct
23 Correct 255 ms 27928 KB Output is correct
24 Correct 240 ms 27972 KB Output is correct
25 Correct 101 ms 18056 KB Output is correct
26 Correct 132 ms 18068 KB Output is correct
27 Correct 263 ms 27968 KB Output is correct
28 Correct 235 ms 27960 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 1 ms 324 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 1356 KB Output is correct
37 Correct 236 ms 27952 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 11 ms 1420 KB Output is correct
41 Correct 266 ms 27972 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 5 ms 940 KB Output is correct
45 Correct 115 ms 18084 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 60 ms 7176 KB Output is correct
50 Correct 249 ms 28100 KB Output is correct
51 Correct 257 ms 28100 KB Output is correct
52 Correct 253 ms 27912 KB Output is correct
53 Correct 100 ms 17988 KB Output is correct
54 Correct 102 ms 18060 KB Output is correct
55 Correct 272 ms 27972 KB Output is correct
56 Correct 260 ms 27924 KB Output is correct
57 Correct 113 ms 18052 KB Output is correct
58 Correct 1 ms 204 KB Output is correct
59 Correct 1 ms 204 KB Output is correct
60 Correct 5 ms 972 KB Output is correct
61 Correct 148 ms 17936 KB Output is correct
62 Correct 1 ms 316 KB Output is correct
63 Correct 1 ms 316 KB Output is correct
64 Correct 1 ms 204 KB Output is correct
65 Incorrect 27 ms 4748 KB Answer gives possible 0 while actual possible 1
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 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 12 ms 1452 KB Output is correct
7 Correct 236 ms 27920 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 11 ms 1356 KB Output is correct
13 Correct 239 ms 27968 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 972 KB Output is correct
17 Correct 115 ms 17944 KB Output is correct
18 Correct 1 ms 316 KB Output is correct
19 Correct 1 ms 324 KB Output is correct
20 Correct 64 ms 7180 KB Output is correct
21 Correct 243 ms 27872 KB Output is correct
22 Correct 244 ms 27960 KB Output is correct
23 Correct 255 ms 27928 KB Output is correct
24 Correct 240 ms 27972 KB Output is correct
25 Correct 101 ms 18056 KB Output is correct
26 Correct 132 ms 18068 KB Output is correct
27 Correct 263 ms 27968 KB Output is correct
28 Correct 235 ms 27960 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 1 ms 324 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 1356 KB Output is correct
37 Correct 236 ms 27952 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 11 ms 1420 KB Output is correct
41 Correct 266 ms 27972 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 5 ms 940 KB Output is correct
45 Correct 115 ms 18084 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 60 ms 7176 KB Output is correct
50 Correct 249 ms 28100 KB Output is correct
51 Correct 257 ms 28100 KB Output is correct
52 Correct 253 ms 27912 KB Output is correct
53 Correct 100 ms 17988 KB Output is correct
54 Correct 102 ms 18060 KB Output is correct
55 Correct 272 ms 27972 KB Output is correct
56 Correct 260 ms 27924 KB Output is correct
57 Correct 113 ms 18052 KB Output is correct
58 Correct 1 ms 204 KB Output is correct
59 Correct 1 ms 204 KB Output is correct
60 Correct 0 ms 204 KB Output is correct
61 Correct 65 ms 7300 KB Output is correct
62 Correct 258 ms 27944 KB Output is correct
63 Correct 245 ms 27924 KB Output is correct
64 Correct 263 ms 28056 KB Output is correct
65 Correct 1 ms 204 KB Output is correct
66 Correct 60 ms 7300 KB Output is correct
67 Correct 242 ms 28048 KB Output is correct
68 Correct 247 ms 28024 KB Output is correct
69 Correct 259 ms 27920 KB Output is correct
70 Correct 1 ms 204 KB Output is correct
71 Correct 0 ms 204 KB Output is correct
72 Correct 1 ms 204 KB Output is correct
73 Incorrect 26 ms 4744 KB Answer gives possible 0 while actual possible 1
74 Halted 0 ms 0 KB -