답안 #431950

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
431950	2021-06-17T17:38:03 Z	A_D	슈퍼트리 잇기 (IOI20_supertrees)	C++14	11 / 100	284 ms	30656 KB

supertrees

#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
const int NN=1e3+100;
bool vis[NN];
vector<int> g[NN][3];
vector<vector<int>> ans;
int s,e;
void dfs2(int u)
{
    vis[u]=1;
    for(auto x:g[u][1]){
        if(vis[x])continue;
        ans[u][x]=1;
        ans[x][u]=1;
        dfs2(x);
    }
}
void dfs(int u)
{
    e=u;
    vis[u]=1;
    for(auto x:g[u][2]){
        if(vis[x])continue;
        ans[u][x]=1;
        ans[x][u]=1;
        dfs(x);
    }
}
int construct(vector<vector<int>> p){
    int n=p.size();
    ans.resize(n);
    for(int i=0;i<n;i++){
        ans[i].resize(n);
        for(int j=0;j<n;j++){
            if(p[i][j]==3){
                return 0;
            }
            if(i==j){
                if(p[i][j]!=1){
                    return 0;
                }
                continue;
            }
            g[i][p[i][j]].push_back(j);
            g[j][p[i][j]].push_back(i);
        }
    }
    for(int i=0;i<n;i++){
        if(vis[i]==0)dfs2(i);
    }
    memset(vis,0,sizeof(vis));
    for(int i=0;i<n;i++){
        s=i;
        e=i;
        ans[s][e]=1;
        if(vis[i]==0)dfs(i);
        ans[i][i]=0;
    }
    build(ans);
    return 1;
}

Subtask #1

11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	368 KB	Output is correct
4	Correct	1 ms	368 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	16 ms	1720 KB	Output is correct
7	Correct	284 ms	30656 KB	Output is correct

Subtask #2

0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	368 KB	Output is correct
4	Correct	1 ms	368 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	16 ms	1720 KB	Output is correct
7	Correct	284 ms	30656 KB	Output is correct
8	Correct	1 ms	372 KB	Output is correct
9	Correct	1 ms	376 KB	Output is correct
10	Correct	1 ms	376 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	11 ms	1696 KB	Output is correct
13	Correct	266 ms	30644 KB	Output is correct
14	Incorrect	1 ms	332 KB	Answer gives possible 1 while actual possible 0
15	Halted	0 ms	0 KB	-

Subtask #3

0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	372 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 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

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Incorrect	1 ms	332 KB	Too few ways to get from 0 to 1, should be 2 found 1
3	Halted	0 ms	0 KB	-

Subtask #5

0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	368 KB	Output is correct
4	Correct	1 ms	368 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	16 ms	1720 KB	Output is correct
7	Correct	284 ms	30656 KB	Output is correct
8	Correct	1 ms	372 KB	Output is correct
9	Correct	1 ms	376 KB	Output is correct
10	Correct	1 ms	376 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	11 ms	1696 KB	Output is correct
13	Correct	266 ms	30644 KB	Output is correct
14	Incorrect	1 ms	332 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	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	368 KB	Output is correct
4	Correct	1 ms	368 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	16 ms	1720 KB	Output is correct
7	Correct	284 ms	30656 KB	Output is correct
8	Correct	1 ms	372 KB	Output is correct
9	Correct	1 ms	376 KB	Output is correct
10	Correct	1 ms	376 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	11 ms	1696 KB	Output is correct
13	Correct	266 ms	30644 KB	Output is correct
14	Incorrect	1 ms	332 KB	Answer gives possible 1 while actual possible 0
15	Halted	0 ms	0 KB	-