oj.uz

Submission #519823

# Submission time Handle Problem Language Result Execution time Memory
519823 2022-01-27T11:26:44 Z A_D Connecting Supertrees (IOI20_supertrees) C++14
21 / 100
 214 ms 27768 KB 
#include "supertrees.h"
#include <bits/stdc++.h>

using namespace std;
const int N=1e3+110;
vector<int> g1[N];
vector<int> g2[N];
bool vis[N];
vector<vector<int>> answer;
vector<int> vec;
void dfs1(int u)
{
    vis[u]=1;
    for(auto x:g1[u]){
        if(vis[x])continue;
        answer[u][x]=1;
        answer[x][u]=1;
        dfs1(x);
    }
}

int construct(vector<vector<int>> p){
	int n = p.size();
	vector<int> tmp(n);
	for(int i=0;i<n;i++){
        answer.push_back(tmp);
	}

	for(int i=0;i<n;i++){
        g1[i].push_back(i);
        g2[i].push_back(i);
        for(int j=i;j<n;j++){
            int v=p[i][j];
            if(v==3||(i==j&&v!=1)||p[i][j]!=p[j][i]){
                return 0;
            }
            if(v==2){
                g2[i].push_back(j);
                g2[j].push_back(i);

            }
            if(v==1&&i!=j){
                g1[i].push_back(j);
                g1[j].push_back(i);
            }
        }
	}
	for(int i=0;i<n;i++){
        sort(g1[i].begin(),g1[i].end());
        sort(g2[i].begin(),g2[i].end());
	}
	for(int i=0;i<n;i++){
        if(vis[i]==0){
            dfs1(i);
            int sz=g1[i].size();
            for(int j=0;j<sz-1;j++){
                if(g1[g1[i][j]]!=g1[g1[i][j+1]])return 0;
            }
        }
	}
	memset(vis,0,sizeof(vis));
	for(int i=0;i<n;i++){
        if(vis[i]==0){
            int sz=g2[i].size();
            for(int j=0;j<sz-1;j++){
                vis[g2[i][j]]=1;vis[g2[i][j+1]]=1;
                answer[g2[i][j]][g2[i][j+1]]=1;
                answer[g2[i][j+1]][g2[i][j]]=1;
                if(g2[g2[i][j]]!=g2[g2[i][j+1]])return 0;
            }
            answer[g2[i][0]][g2[i][sz-1]]=1;
            answer[g2[i][sz-1]][g2[i][0]]=1;
        }
	}
    /*
	for(int i=0;i<n;i++){
        cout<<i<<" : ";
        for(auto y:g1[i]){
            cout<<y<<" ";
        }
        cout<<endl;
    }

    for(int i=0;i<n;i++){
        cout<<i<<" : ";
        for(auto y:g2[i]){
            cout<<y<<" ";
        }
        cout<<endl;
    }
    */


    for(int i=0;i<n;i++){
        answer[i][i]=0;
    }
	build(answer);
	return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 9 ms 1484 KB Output is correct
7 Correct 192 ms 27768 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 9 ms 1484 KB Output is correct
7 Correct 192 ms 27768 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 8 ms 1324 KB Output is correct
13 Correct 174 ms 23680 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 5 ms 992 KB Output is correct
17 Correct 96 ms 16732 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 47 ms 6356 KB Output is correct
21 Correct 214 ms 24136 KB Output is correct
22 Correct 177 ms 23656 KB Output is correct
23 Correct 200 ms 25704 KB Output is correct
24 Correct 174 ms 23620 KB Output is correct
25 Correct 84 ms 14260 KB Output is correct
26 Correct 89 ms 13708 KB Output is correct
27 Correct 195 ms 26732 KB Output is correct
28 Correct 173 ms 23620 KB Output is correct

Subtask #3
0 / 19.0

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

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 46 ms 6292 KB Output is correct
5 Correct 190 ms 24540 KB Output is correct
6 Correct 189 ms 24196 KB Output is correct
7 Correct 200 ms 26104 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 46 ms 6320 KB Output is correct
10 Correct 180 ms 24624 KB Output is correct
11 Correct 189 ms 24100 KB Output is correct
12 Correct 201 ms 27092 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Incorrect 0 ms 332 KB Answer gives possible 0 while actual possible 1
16 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 9 ms 1484 KB Output is correct
7 Correct 192 ms 27768 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 8 ms 1324 KB Output is correct
13 Correct 174 ms 23680 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 5 ms 992 KB Output is correct
17 Correct 96 ms 16732 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 47 ms 6356 KB Output is correct
21 Correct 214 ms 24136 KB Output is correct
22 Correct 177 ms 23656 KB Output is correct
23 Correct 200 ms 25704 KB Output is correct
24 Correct 174 ms 23620 KB Output is correct
25 Correct 84 ms 14260 KB Output is correct
26 Correct 89 ms 13708 KB Output is correct
27 Correct 195 ms 26732 KB Output is correct
28 Correct 173 ms 23620 KB Output is correct
29 Correct 0 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 0 ms 332 KB Output is correct
32 Incorrect 1 ms 332 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 9 ms 1484 KB Output is correct
7 Correct 192 ms 27768 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 8 ms 1324 KB Output is correct
13 Correct 174 ms 23680 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 5 ms 992 KB Output is correct
17 Correct 96 ms 16732 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 47 ms 6356 KB Output is correct
21 Correct 214 ms 24136 KB Output is correct
22 Correct 177 ms 23656 KB Output is correct
23 Correct 200 ms 25704 KB Output is correct
24 Correct 174 ms 23620 KB Output is correct
25 Correct 84 ms 14260 KB Output is correct
26 Correct 89 ms 13708 KB Output is correct
27 Correct 195 ms 26732 KB Output is correct
28 Correct 173 ms 23620 KB Output is correct
29 Correct 0 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 0 ms 332 KB Output is correct
32 Incorrect 1 ms 332 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -