oj.uz

Submission #519866

# Submission time Handle Problem Language Result Execution time Memory
519866 2022-01-27T12:59:18 Z A_D Connecting Supertrees (IOI20_supertrees) C++14
21 / 100
 202 ms 26428 KB 
#include "supertrees.h"
#include <bits/stdc++.h>

using namespace std;
const int N=1e3+110;
vector<int> g1[N];
vector<int> g2[N];
int vis[N];
int vis2[N];
vector<vector<int>> answer;
vector<int> vec;


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());
	}
	int cnt=0;
	for(int i=0;i<n;i++){
        if(vis[i]==0){
            cnt++;
            int sz=g1[i].size();
            vis[g1[i][0]]=cnt;
            for(int j=0;j<sz-1;j++){
                vis[g1[i][j]]=cnt;
                vis[g1[i][j+1]]=cnt;
                answer[g1[i][j]][g1[i][j+1]]=1;
                answer[g1[i][j+1]][g1[i][j]]=1;
                if(g1[g1[i][j]]!=g1[g1[i][j+1]])return 0;
            }
        }
	}
	for(int i=0;i<n;i++){
        if(vis2[vis[i]]==0){
            vis2[vis[g2[i][0]]]=1;
            int sz=g2[i].size();
            int lst=g2[i][0];
            for(int j=0;j<sz-1;j++){
                
            }
            for(int j=1;j<sz;j++){
                if(vis2[vis[g2[i][j]]]==0){
                    vis2[vis[g2[i][j]]]=1;
                    answer[lst][g2[i][j]]=1;
                    answer[g2[i][j]][lst]=1;
                    if(g2[g2[i][j]]!=g2[lst])return 0;
                    lst=g2[i][j];
                }
            }
            answer[lst][g2[i][0]]=1;
            answer[g2[i][0]][lst]=1;
        }
	}
    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 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 9 ms 1488 KB Output is correct
7 Correct 191 ms 26428 KB Output is correct

Subtask #2
10.0 / 10.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 332 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 9 ms 1488 KB Output is correct
7 Correct 191 ms 26428 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 8 ms 1232 KB Output is correct
13 Correct 176 ms 22356 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 5 ms 976 KB Output is correct
17 Correct 102 ms 15308 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 46 ms 5956 KB Output is correct
21 Correct 180 ms 22836 KB Output is correct
22 Correct 183 ms 22340 KB Output is correct
23 Correct 190 ms 24352 KB Output is correct
24 Correct 202 ms 22388 KB Output is correct
25 Correct 80 ms 12996 KB Output is correct
26 Correct 87 ms 12408 KB Output is correct
27 Correct 200 ms 25408 KB Output is correct
28 Correct 184 ms 22428 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 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Incorrect 0 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 344 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 45 ms 5956 KB Output is correct
5 Correct 180 ms 22892 KB Output is correct
6 Correct 174 ms 22256 KB Output is correct
7 Correct 201 ms 24268 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 44 ms 5928 KB Output is correct
10 Correct 183 ms 22876 KB Output is correct
11 Correct 173 ms 22208 KB Output is correct
12 Correct 199 ms 25380 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Incorrect 1 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 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 9 ms 1488 KB Output is correct
7 Correct 191 ms 26428 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 8 ms 1232 KB Output is correct
13 Correct 176 ms 22356 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 5 ms 976 KB Output is correct
17 Correct 102 ms 15308 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 46 ms 5956 KB Output is correct
21 Correct 180 ms 22836 KB Output is correct
22 Correct 183 ms 22340 KB Output is correct
23 Correct 190 ms 24352 KB Output is correct
24 Correct 202 ms 22388 KB Output is correct
25 Correct 80 ms 12996 KB Output is correct
26 Correct 87 ms 12408 KB Output is correct
27 Correct 200 ms 25408 KB Output is correct
28 Correct 184 ms 22428 KB Output is correct
29 Correct 0 ms 332 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Incorrect 0 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 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 9 ms 1488 KB Output is correct
7 Correct 191 ms 26428 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 8 ms 1232 KB Output is correct
13 Correct 176 ms 22356 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 5 ms 976 KB Output is correct
17 Correct 102 ms 15308 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 46 ms 5956 KB Output is correct
21 Correct 180 ms 22836 KB Output is correct
22 Correct 183 ms 22340 KB Output is correct
23 Correct 190 ms 24352 KB Output is correct
24 Correct 202 ms 22388 KB Output is correct
25 Correct 80 ms 12996 KB Output is correct
26 Correct 87 ms 12408 KB Output is correct
27 Correct 200 ms 25408 KB Output is correct
28 Correct 184 ms 22428 KB Output is correct
29 Correct 0 ms 332 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Incorrect 0 ms 332 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -