oj.uz

Submission #367460

# Submission time Handle Problem Language Result Execution time Memory
367460 2021-02-17T12:35:33 Z MilosMilutinovic Connecting Supertrees (IOI20_supertrees) C++14
40 / 100
 289 ms 31968 KB 
#include <bits/stdc++.h>
#include "supertrees.h"
using namespace std;
#define pb push_back
const int N=1050;
vector<int> E[N];
vector<vector<int>> p,ans(N,vector<int>(N,0));
void AddEdge(int u,int v){E[u].pb(v);E[v].pb(u);}
bool was[N];
vector<int> euler;
void DFS1(int u){
    was[u]=true;
    euler.pb(u);
    for(int e:E[u])if(!was[e]&&p[u][e]==1)DFS1(e);
}
void DFS2(int u){
    was[u]=true;
    euler.pb(u);
    for(int e:E[u])if(!was[e]&&p[u][e]==2)DFS2(e);
}
int construct(vector<vector<int>> P){
    int n=(int)P.size();p=P;
    ans.resize(n);
    for(int i=0;i<n;i++)ans[i].resize(n);
    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=i+1;j<n;j++)if(p[i][j]>0)AddEdge(i,j);
    for(int i=0;i<n;i++)if(!was[i]){
        DFS1(i);
        for(int x:euler)for(int y:euler)if(x!=y&&p[x][y]==0)return 0;
        for(int i=1;i<(int)euler.size();i++){
            int from=euler[i],to=euler[i-1];
            ans[from][to]=ans[to][from]=1;
        }
        euler.clear();
    }
    memset(was,false,sizeof(was));
    for(int i=0;i<n;i++)if(!was[i]){
        DFS2(i);
        if((int)euler.size()==1){
            euler.clear();
            continue;
        }
        if((int)euler.size()==2)return 0;
        for(int x:euler)for(int y:euler)if(x!=y&&p[x][y]==0)return 0;
        for(int i=1;i<(int)euler.size();i++){
            int from=euler[i],to=euler[i-1];
            ans[from][to]=ans[to][from]=1;
        }
        int from=euler[0],to=euler.back();
        ans[from][to]=ans[to][from]=1;
        euler.clear();
    }
    build(ans);
    return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4716 KB Output is correct
2 Correct 3 ms 4716 KB Output is correct
3 Correct 3 ms 4716 KB Output is correct
4 Correct 3 ms 4716 KB Output is correct
5 Correct 3 ms 4716 KB Output is correct
6 Correct 13 ms 5228 KB Output is correct
7 Correct 289 ms 30444 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4716 KB Output is correct
2 Correct 3 ms 4716 KB Output is correct
3 Correct 3 ms 4716 KB Output is correct
4 Correct 3 ms 4716 KB Output is correct
5 Correct 3 ms 4716 KB Output is correct
6 Correct 13 ms 5228 KB Output is correct
7 Correct 289 ms 30444 KB Output is correct
8 Correct 4 ms 4716 KB Output is correct
9 Correct 3 ms 4716 KB Output is correct
10 Correct 4 ms 4716 KB Output is correct
11 Correct 3 ms 4716 KB Output is correct
12 Correct 13 ms 5356 KB Output is correct
13 Correct 246 ms 26308 KB Output is correct
14 Correct 3 ms 4716 KB Output is correct
15 Correct 3 ms 4716 KB Output is correct
16 Correct 8 ms 5228 KB Output is correct
17 Correct 138 ms 19308 KB Output is correct
18 Correct 3 ms 4716 KB Output is correct
19 Correct 3 ms 4716 KB Output is correct
20 Correct 67 ms 8172 KB Output is correct
21 Correct 250 ms 26988 KB Output is correct
22 Correct 250 ms 26360 KB Output is correct
23 Correct 266 ms 28524 KB Output is correct
24 Correct 247 ms 26220 KB Output is correct
25 Correct 105 ms 17132 KB Output is correct
26 Correct 101 ms 16620 KB Output is correct
27 Correct 263 ms 29420 KB Output is correct
28 Correct 251 ms 26476 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4716 KB Output is correct
2 Correct 3 ms 4716 KB Output is correct
3 Correct 3 ms 4716 KB Output is correct
4 Correct 3 ms 4716 KB Output is correct
5 Correct 3 ms 4716 KB Output is correct
6 Correct 3 ms 4716 KB Output is correct
7 Correct 3 ms 4716 KB Output is correct
8 Correct 13 ms 5356 KB Output is correct
9 Correct 245 ms 27756 KB Output is correct
10 Correct 3 ms 4716 KB Output is correct
11 Correct 3 ms 4716 KB Output is correct
12 Correct 13 ms 5356 KB Output is correct
13 Correct 254 ms 31968 KB Output is correct
14 Correct 3 ms 4716 KB Output is correct
15 Correct 3 ms 4736 KB Output is correct
16 Correct 8 ms 5228 KB Output is correct
17 Correct 116 ms 20716 KB Output is correct
18 Correct 4 ms 4716 KB Output is correct
19 Correct 3 ms 4716 KB Output is correct
20 Correct 3 ms 4716 KB Output is correct
21 Correct 64 ms 8704 KB Output is correct
22 Correct 250 ms 28396 KB Output is correct
23 Correct 245 ms 27884 KB Output is correct
24 Correct 278 ms 31084 KB Output is correct
25 Correct 102 ms 18028 KB Output is correct
26 Correct 105 ms 18412 KB Output is correct
27 Correct 253 ms 27884 KB Output is correct
28 Correct 260 ms 29932 KB Output is correct
29 Correct 103 ms 18028 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4716 KB Output is correct
2 Correct 3 ms 4716 KB Output is correct
3 Correct 3 ms 4716 KB Output is correct
4 Correct 65 ms 8684 KB Output is correct
5 Correct 255 ms 28396 KB Output is correct
6 Correct 251 ms 27884 KB Output is correct
7 Correct 268 ms 29932 KB Output is correct
8 Correct 3 ms 4716 KB Output is correct
9 Correct 64 ms 8684 KB Output is correct
10 Correct 249 ms 28396 KB Output is correct
11 Correct 254 ms 27884 KB Output is correct
12 Correct 259 ms 30932 KB Output is correct
13 Correct 3 ms 4716 KB Output is correct
14 Correct 3 ms 4716 KB Output is correct
15 Incorrect 3 ms 4716 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 4 ms 4716 KB Output is correct
2 Correct 3 ms 4716 KB Output is correct
3 Correct 3 ms 4716 KB Output is correct
4 Correct 3 ms 4716 KB Output is correct
5 Correct 3 ms 4716 KB Output is correct
6 Correct 13 ms 5228 KB Output is correct
7 Correct 289 ms 30444 KB Output is correct
8 Correct 4 ms 4716 KB Output is correct
9 Correct 3 ms 4716 KB Output is correct
10 Correct 4 ms 4716 KB Output is correct
11 Correct 3 ms 4716 KB Output is correct
12 Correct 13 ms 5356 KB Output is correct
13 Correct 246 ms 26308 KB Output is correct
14 Correct 3 ms 4716 KB Output is correct
15 Correct 3 ms 4716 KB Output is correct
16 Correct 8 ms 5228 KB Output is correct
17 Correct 138 ms 19308 KB Output is correct
18 Correct 3 ms 4716 KB Output is correct
19 Correct 3 ms 4716 KB Output is correct
20 Correct 67 ms 8172 KB Output is correct
21 Correct 250 ms 26988 KB Output is correct
22 Correct 250 ms 26360 KB Output is correct
23 Correct 266 ms 28524 KB Output is correct
24 Correct 247 ms 26220 KB Output is correct
25 Correct 105 ms 17132 KB Output is correct
26 Correct 101 ms 16620 KB Output is correct
27 Correct 263 ms 29420 KB Output is correct
28 Correct 251 ms 26476 KB Output is correct
29 Correct 4 ms 4716 KB Output is correct
30 Correct 3 ms 4716 KB Output is correct
31 Correct 3 ms 4716 KB Output is correct
32 Correct 3 ms 4716 KB Output is correct
33 Correct 3 ms 4716 KB Output is correct
34 Correct 3 ms 4716 KB Output is correct
35 Correct 3 ms 4716 KB Output is correct
36 Correct 13 ms 5356 KB Output is correct
37 Correct 245 ms 27756 KB Output is correct
38 Correct 3 ms 4716 KB Output is correct
39 Correct 3 ms 4716 KB Output is correct
40 Correct 13 ms 5356 KB Output is correct
41 Correct 254 ms 31968 KB Output is correct
42 Correct 3 ms 4716 KB Output is correct
43 Correct 3 ms 4736 KB Output is correct
44 Correct 8 ms 5228 KB Output is correct
45 Correct 116 ms 20716 KB Output is correct
46 Correct 4 ms 4716 KB Output is correct
47 Correct 3 ms 4716 KB Output is correct
48 Correct 3 ms 4716 KB Output is correct
49 Correct 64 ms 8704 KB Output is correct
50 Correct 250 ms 28396 KB Output is correct
51 Correct 245 ms 27884 KB Output is correct
52 Correct 278 ms 31084 KB Output is correct
53 Correct 102 ms 18028 KB Output is correct
54 Correct 105 ms 18412 KB Output is correct
55 Correct 253 ms 27884 KB Output is correct
56 Correct 260 ms 29932 KB Output is correct
57 Correct 103 ms 18028 KB Output is correct
58 Correct 3 ms 4716 KB Output is correct
59 Correct 3 ms 4716 KB Output is correct
60 Correct 8 ms 5228 KB Output is correct
61 Correct 115 ms 22448 KB Output is correct
62 Correct 3 ms 4716 KB Output is correct
63 Correct 3 ms 4716 KB Output is correct
64 Correct 4 ms 4716 KB Output is correct
65 Incorrect 64 ms 8684 KB Too many ways to get from 1 to 256, should be 2 found no less than 3
66 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4716 KB Output is correct
2 Correct 3 ms 4716 KB Output is correct
3 Correct 3 ms 4716 KB Output is correct
4 Correct 3 ms 4716 KB Output is correct
5 Correct 3 ms 4716 KB Output is correct
6 Correct 13 ms 5228 KB Output is correct
7 Correct 289 ms 30444 KB Output is correct
8 Correct 4 ms 4716 KB Output is correct
9 Correct 3 ms 4716 KB Output is correct
10 Correct 4 ms 4716 KB Output is correct
11 Correct 3 ms 4716 KB Output is correct
12 Correct 13 ms 5356 KB Output is correct
13 Correct 246 ms 26308 KB Output is correct
14 Correct 3 ms 4716 KB Output is correct
15 Correct 3 ms 4716 KB Output is correct
16 Correct 8 ms 5228 KB Output is correct
17 Correct 138 ms 19308 KB Output is correct
18 Correct 3 ms 4716 KB Output is correct
19 Correct 3 ms 4716 KB Output is correct
20 Correct 67 ms 8172 KB Output is correct
21 Correct 250 ms 26988 KB Output is correct
22 Correct 250 ms 26360 KB Output is correct
23 Correct 266 ms 28524 KB Output is correct
24 Correct 247 ms 26220 KB Output is correct
25 Correct 105 ms 17132 KB Output is correct
26 Correct 101 ms 16620 KB Output is correct
27 Correct 263 ms 29420 KB Output is correct
28 Correct 251 ms 26476 KB Output is correct
29 Correct 4 ms 4716 KB Output is correct
30 Correct 3 ms 4716 KB Output is correct
31 Correct 3 ms 4716 KB Output is correct
32 Correct 3 ms 4716 KB Output is correct
33 Correct 3 ms 4716 KB Output is correct
34 Correct 3 ms 4716 KB Output is correct
35 Correct 3 ms 4716 KB Output is correct
36 Correct 13 ms 5356 KB Output is correct
37 Correct 245 ms 27756 KB Output is correct
38 Correct 3 ms 4716 KB Output is correct
39 Correct 3 ms 4716 KB Output is correct
40 Correct 13 ms 5356 KB Output is correct
41 Correct 254 ms 31968 KB Output is correct
42 Correct 3 ms 4716 KB Output is correct
43 Correct 3 ms 4736 KB Output is correct
44 Correct 8 ms 5228 KB Output is correct
45 Correct 116 ms 20716 KB Output is correct
46 Correct 4 ms 4716 KB Output is correct
47 Correct 3 ms 4716 KB Output is correct
48 Correct 3 ms 4716 KB Output is correct
49 Correct 64 ms 8704 KB Output is correct
50 Correct 250 ms 28396 KB Output is correct
51 Correct 245 ms 27884 KB Output is correct
52 Correct 278 ms 31084 KB Output is correct
53 Correct 102 ms 18028 KB Output is correct
54 Correct 105 ms 18412 KB Output is correct
55 Correct 253 ms 27884 KB Output is correct
56 Correct 260 ms 29932 KB Output is correct
57 Correct 103 ms 18028 KB Output is correct
58 Correct 3 ms 4716 KB Output is correct
59 Correct 3 ms 4716 KB Output is correct
60 Correct 3 ms 4716 KB Output is correct
61 Correct 65 ms 8684 KB Output is correct
62 Correct 255 ms 28396 KB Output is correct
63 Correct 251 ms 27884 KB Output is correct
64 Correct 268 ms 29932 KB Output is correct
65 Correct 3 ms 4716 KB Output is correct
66 Correct 64 ms 8684 KB Output is correct
67 Correct 249 ms 28396 KB Output is correct
68 Correct 254 ms 27884 KB Output is correct
69 Correct 259 ms 30932 KB Output is correct
70 Correct 3 ms 4716 KB Output is correct
71 Correct 3 ms 4716 KB Output is correct
72 Incorrect 3 ms 4716 KB Too many ways to get from 0 to 4, should be 1 found no less than 2
73 Halted 0 ms 0 KB -