답안 #486502

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
486502	2021-11-11T21:13:36 Z	A_D	슈퍼트리 잇기 (IOI20_supertrees)	C++14	11 / 100	195 ms	32164 KB

supertrees

#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
const int N=1e3+100;
vector<int> g[N];
vector<int> g2[N];
bool vis[N];
bool ccc[N];
vector<vector<int>> answer;
int pp[N];
int c[N];
vector<int> vec;
int find(int u)
{
    if(u==pp[u])return u;
    return pp[u]=find(pp[u]);
}
void dfs(int u)
{
    if(vis[u])return;
    vis[u]=1;
    for(auto x:g[u]){
        if(vis[x])continue;
        answer[u][x]=1;
        answer[x][u]=1;
        pp[find(u)]=pp[find(x)];
        dfs(x);
    }
}

int construct(vector<vector<int>> p) {
	int n = p.size();
	for (int i = 0; i < n; i++) {
        pp[i]=i;
		vector<int> row(n);
		answer.push_back(row);
	}
	for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            if(p[i][j]==1){
                g[i].push_back(j);
                g[j].push_back(i);
            }
        }
	}
	for(int i=0;i<n;i++){
        dfs(i);
	}
	for(int i=0;i<n;i++){
        if(pp[i]==i)vec.push_back(i);
	}
	int sz=vec.size();
	for(int i1=0;i1<sz;i1++){
        for(int j1=i1+1;j1<sz;j1++){
            int i=vec[i1];
            int j=vec[j1];
            ccc[i]=1;
            if(p[i][j]==3)return -1;
            if(p[i][j]==2){
                answer[i][j]=1;
                answer[j][i]=1;
                break;
            }
        }
	}
	for(int i1=0;i1<sz;i1++){
        for(int j1=sz-1;j1>i1;j1--){
            int i=vec[i1];
            int j=vec[j1];
            if(p[i][j]==2&&ccc[j]==0){
                ccc[j]=1;
                answer[i][j]++;
                answer[j][i]++;
                if(answer[i][j]==2){
                   // cout<<i<<" "<<j<<endl;
                    return 0;
                }
                break;
            }
        }
	}
	build(answer);
	return 1;
}

Subtask #1

11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	432 KB	Output is correct
2	Correct	0 ms	336 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	0 ms	336 KB	Output is correct
6	Correct	8 ms	1744 KB	Output is correct
7	Correct	186 ms	32164 KB	Output is correct

Subtask #2

0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	432 KB	Output is correct
2	Correct	0 ms	336 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	0 ms	336 KB	Output is correct
6	Correct	8 ms	1744 KB	Output is correct
7	Correct	186 ms	32164 KB	Output is correct
8	Correct	0 ms	336 KB	Output is correct
9	Correct	0 ms	336 KB	Output is correct
10	Correct	0 ms	336 KB	Output is correct
11	Correct	1 ms	352 KB	Output is correct
12	Correct	7 ms	1276 KB	Output is correct
13	Correct	166 ms	24008 KB	Output is correct
14	Incorrect	0 ms	336 KB	Answer gives possible 1 while actual possible 0
15	Halted	0 ms	0 KB	-

Subtask #3

0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	336 KB	Output is correct
2	Correct	0 ms	336 KB	Output is correct
3	Correct	0 ms	336 KB	Output is correct
4	Correct	0 ms	336 KB	Output is correct
5	Correct	1 ms	352 KB	Output is correct
6	Correct	0 ms	352 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	7 ms	1228 KB	Output is correct
9	Correct	164 ms	23988 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	8 ms	1324 KB	Output is correct
13	Correct	195 ms	24100 KB	Output is correct
14	Incorrect	0 ms	332 KB	Answer gives possible 1 while actual possible 0
15	Halted	0 ms	0 KB	-

Subtask #4

0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	336 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	0 ms	356 KB	Output is correct
4	Correct	41 ms	6320 KB	Output is correct
5	Correct	169 ms	25144 KB	Output is correct
6	Correct	170 ms	24008 KB	Output is correct
7	Correct	178 ms	28216 KB	Output is correct
8	Incorrect	1 ms	336 KB	Too few ways to get from 0 to 1, should be 2 found 1
9	Halted	0 ms	0 KB	-

Subtask #5

0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	432 KB	Output is correct
2	Correct	0 ms	336 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	0 ms	336 KB	Output is correct
6	Correct	8 ms	1744 KB	Output is correct
7	Correct	186 ms	32164 KB	Output is correct
8	Correct	0 ms	336 KB	Output is correct
9	Correct	0 ms	336 KB	Output is correct
10	Correct	0 ms	336 KB	Output is correct
11	Correct	1 ms	352 KB	Output is correct
12	Correct	7 ms	1276 KB	Output is correct
13	Correct	166 ms	24008 KB	Output is correct
14	Incorrect	0 ms	336 KB	Answer gives possible 1 while actual possible 0
15	Halted	0 ms	0 KB	-

Subtask #6

0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	432 KB	Output is correct
2	Correct	0 ms	336 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	0 ms	336 KB	Output is correct
6	Correct	8 ms	1744 KB	Output is correct
7	Correct	186 ms	32164 KB	Output is correct
8	Correct	0 ms	336 KB	Output is correct
9	Correct	0 ms	336 KB	Output is correct
10	Correct	0 ms	336 KB	Output is correct
11	Correct	1 ms	352 KB	Output is correct
12	Correct	7 ms	1276 KB	Output is correct
13	Correct	166 ms	24008 KB	Output is correct
14	Incorrect	0 ms	336 KB	Answer gives possible 1 while actual possible 0
15	Halted	0 ms	0 KB	-