oj.uz

답안 #928172

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
928172 2024-02-16T02:27:09 Z AlphaMale06 슈퍼트리 잇기 (IOI20_supertrees) C++17
56 / 100
 181 ms 23704 KB 
#include<bits/stdc++.h>
#include "supertrees.h"

using namespace std;

#define pb push_back

const int N = 1005;
int par[N];
int sz[N];
vector<int> comp[N];
vector<vector<int>> answer;

void make(int v){
    par[v]=v;
    sz[v]=1;
}

int find(int v){
    if(par[v]==v)return v;
    return par[v]=find(par[v]);
}

void merge(int u, int v){
    u=find(u);
    v=find(v);
    if(u==v)return;
    if(sz[u]<sz[v])swap(u, v);
    sz[u]+=sz[v];
    par[v]=u;
}

int construct(vector<vector<int>> p) {
	int n = p.size();
	answer.resize(n);
	for(int i=0; i<n; i++){
        answer[i].resize(n);
        for(int j=0; j<n; j++)answer[i][j]=0;
	}
    for(int i=0; i<n; i++)make(i);
    for(int i=0; i< n; i++){
        for(int j=0; j< n; j++){
            if(p[i][j])merge(i, j);
            if(p[i][j]==3)return 0;
        }
    }
    for(int i=0; i< n; i++){
        for(int j=0; j< n; j++){
            if(!p[i][j]){
                if(find(i)==find(j))return 0;
            }
        }
    }
    for(int i=0; i< n; i++){
        comp[find(i)].pb(i);
    }
    for(int i=0; i < n; i++)make(i);
    for(vector<int> cmp : comp){
        if(cmp.size()){
            for(int e : cmp){
                for(int i : cmp){
                    if(p[e][i]==1){
                        merge(e, i);
                    }
                }
            }
            for(int e : cmp){
                for(int i : cmp){
                    if(p[e][i]==2 && find(e)==find(i))return 0;
                }
            }
            for(int e : cmp){
                int f=find(e);
                if(f!=e){
                    answer[e][f]=1;
                    answer[f][e]=1;
                }
            }
            vector<int> vc;
            for(int e : cmp)vc.pb(find(e));
            sort(vc.begin(), vc.end());
            for(int i=1; i<vc.size(); i++){
                if(vc[i]!=vc[i-1]){
                    answer[vc[i]][vc[i-1]]=1;
                    answer[vc[i-1]][vc[i]]=1;
                }
                if(vc.back()!=vc[0]){
                    answer[vc.back()][vc[0]]=1;
                    answer[vc[0]][vc.back()]=1;
                }
            }
        }
    }
    build(answer);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:82:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |             for(int i=1; i<vc.size(); i++){
      |                          ~^~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1416 KB Output is correct
7 Correct 164 ms 23632 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1416 KB Output is correct
7 Correct 164 ms 23632 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1372 KB Output is correct
13 Correct 151 ms 23380 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 72 ms 13364 KB Output is correct
18 Correct 1 ms 432 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 39 ms 6272 KB Output is correct
21 Correct 155 ms 23576 KB Output is correct
22 Correct 152 ms 23380 KB Output is correct
23 Correct 160 ms 23320 KB Output is correct
24 Correct 153 ms 23704 KB Output is correct
25 Correct 61 ms 13432 KB Output is correct
26 Correct 59 ms 13392 KB Output is correct
27 Correct 181 ms 23540 KB Output is correct
28 Correct 153 ms 23380 KB Output is correct

Subtask #3
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 464 KB Answer gives possible 1 while actual possible 0
5 Halted 0 ms 0 KB -

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 39 ms 6236 KB Output is correct
5 Correct 155 ms 23472 KB Output is correct
6 Correct 155 ms 23404 KB Output is correct
7 Correct 173 ms 23528 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 43 ms 6424 KB Output is correct
10 Correct 159 ms 23376 KB Output is correct
11 Correct 152 ms 23328 KB Output is correct
12 Correct 164 ms 23408 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 464 KB Output is correct
16 Correct 39 ms 6420 KB Output is correct
17 Correct 158 ms 23508 KB Output is correct
18 Correct 160 ms 23256 KB Output is correct
19 Correct 155 ms 23648 KB Output is correct
20 Correct 150 ms 23432 KB Output is correct

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1416 KB Output is correct
7 Correct 164 ms 23632 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1372 KB Output is correct
13 Correct 151 ms 23380 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 72 ms 13364 KB Output is correct
18 Correct 1 ms 432 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 39 ms 6272 KB Output is correct
21 Correct 155 ms 23576 KB Output is correct
22 Correct 152 ms 23380 KB Output is correct
23 Correct 160 ms 23320 KB Output is correct
24 Correct 153 ms 23704 KB Output is correct
25 Correct 61 ms 13432 KB Output is correct
26 Correct 59 ms 13392 KB Output is correct
27 Correct 181 ms 23540 KB Output is correct
28 Correct 153 ms 23380 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Incorrect 0 ms 464 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1416 KB Output is correct
7 Correct 164 ms 23632 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1372 KB Output is correct
13 Correct 151 ms 23380 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 72 ms 13364 KB Output is correct
18 Correct 1 ms 432 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 39 ms 6272 KB Output is correct
21 Correct 155 ms 23576 KB Output is correct
22 Correct 152 ms 23380 KB Output is correct
23 Correct 160 ms 23320 KB Output is correct
24 Correct 153 ms 23704 KB Output is correct
25 Correct 61 ms 13432 KB Output is correct
26 Correct 59 ms 13392 KB Output is correct
27 Correct 181 ms 23540 KB Output is correct
28 Correct 153 ms 23380 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Incorrect 0 ms 464 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -