답안 #790201

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
790201	2023-07-22T12:03:32 Z	Andrey	슈퍼트리 잇기 (IOI20_supertrees)	C++14	56 / 100	159 ms	28000 KB

supertrees

#include "supertrees.h"
#include <vector>
#include<bits/stdc++.h>
using namespace std;

vector<vector<int>> ans(0);
vector<vector<int>> haha(0);
vector<bool> bruh(3001,true);
int n;
vector<int> col(3000,-1);
vector<int> no(3000,-1);

void dfs(int a, int c) {
    col[a] = c;
    if(a != c) {
        ans[a][c] = 1;
        ans[c][a] = 1;
    }
    for(int i = 0; i < n; i++) {
        if(col[i] == -1 && haha[a][i] == 1) {
            dfs(i,c);
        }
    }
}

int construct(vector<vector<int>> p) {
    n = p[0].size();
    haha = p;
    vector<int> wut(0);
    for(int i = 0; i < n; i++) {
        ans.push_back(vector<int> (n));
    }
    for(int i = 0; i < n; i++) {
        if(col[i] == -1) {
            dfs(i,i);
            wut.push_back(i);
        }
    }
    for(int i = 0; i < wut.size(); i++) {
        if(no[wut[i]] == -1) {
            vector<int> wow(0);
            wow.push_back(wut[i]);
            no[wut[i]] = i;
            for(int j = 0; j < wut.size(); j++) {
                if(haha[wut[i]][wut[j]] == 2 && no[wut[j]] == -1) {
                    bruh[j] = false;
                    wow.push_back(wut[j]);
                    no[wut[j]] = i;
                }
            }
          /*  if(wow.size() == 2) {
                return 0;
            }*/
            if(wow.size() > 1) {
                for(int j = 0; j < wow.size(); j++) {
                    ans[wow[j]][wow[(j+1)%(int)wow.size()]] = 1;
                    ans[wow[(j+1)%(int)wow.size()]][wow[j]] = 1;
                }
            }
        }
    }
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < n; j++) {
            if(i != j) {
                if((col[i] == col[j]) && haha[i][j] != 1) {
                    return 0;
                }
                if((col[i] != col[j] && no[col[i]] == no[col[j]]) && haha[i][j] != 2) {
                    return 0;
                }
                if(no[col[i]] != no[col[j]] && haha[i][j] != 0) {
                    return 0;
                }
            }
        }
    }
    build(ans);
    return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:39:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |     for(int i = 0; i < wut.size(); i++) {
      |                    ~~^~~~~~~~~~~~
supertrees.cpp:44:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |             for(int j = 0; j < wut.size(); j++) {
      |                            ~~^~~~~~~~~~~~
supertrees.cpp:55:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |                 for(int j = 0; j < wow.size(); j++) {
      |                                ~~^~~~~~~~~~~~

Subtask #1
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	7 ms	1324 KB	Output is correct
7	Correct	147 ms	25996 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	7 ms	1324 KB	Output is correct
7	Correct	147 ms	25996 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	6 ms	1364 KB	Output is correct
13	Correct	149 ms	26020 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	3 ms	852 KB	Output is correct
17	Correct	65 ms	16024 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	38 ms	6684 KB	Output is correct
21	Correct	155 ms	27980 KB	Output is correct
22	Correct	148 ms	27924 KB	Output is correct
23	Correct	159 ms	28000 KB	Output is correct
24	Correct	153 ms	27908 KB	Output is correct
25	Correct	62 ms	17984 KB	Output is correct
26	Correct	62 ms	18028 KB	Output is correct
27	Correct	153 ms	27988 KB	Output is correct
28	Correct	151 ms	27980 KB	Output is correct

Subtask #3
0 / 19.0

#	결과	메모리	Grader output
1	Correct	212 KB	Output is correct
2	Correct	212 KB	Output is correct
3	Correct	212 KB	Output is correct
4	Incorrect	212 KB	Answer gives possible 1 while actual possible 0
5	Halted	0 KB	-

Subtask #4
35.0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	37 ms	6720 KB	Output is correct
5	Correct	153 ms	26200 KB	Output is correct
6	Correct	152 ms	26228 KB	Output is correct
7	Correct	156 ms	26288 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	38 ms	6904 KB	Output is correct
10	Correct	152 ms	26176 KB	Output is correct
11	Correct	149 ms	26188 KB	Output is correct
12	Correct	158 ms	26288 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	324 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	38 ms	6904 KB	Output is correct
17	Correct	154 ms	26248 KB	Output is correct
18	Correct	154 ms	26192 KB	Output is correct
19	Correct	153 ms	26292 KB	Output is correct
20	Correct	152 ms	26384 KB	Output is correct

Subtask #5
0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	7 ms	1324 KB	Output is correct
7	Correct	147 ms	25996 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	6 ms	1364 KB	Output is correct
13	Correct	149 ms	26020 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	3 ms	852 KB	Output is correct
17	Correct	65 ms	16024 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	38 ms	6684 KB	Output is correct
21	Correct	155 ms	27980 KB	Output is correct
22	Correct	148 ms	27924 KB	Output is correct
23	Correct	159 ms	28000 KB	Output is correct
24	Correct	153 ms	27908 KB	Output is correct
25	Correct	62 ms	17984 KB	Output is correct
26	Correct	62 ms	18028 KB	Output is correct
27	Correct	153 ms	27988 KB	Output is correct
28	Correct	151 ms	27980 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Correct	0 ms	212 KB	Output is correct
31	Correct	0 ms	212 KB	Output is correct
32	Incorrect	0 ms	212 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	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	7 ms	1324 KB	Output is correct
7	Correct	147 ms	25996 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	6 ms	1364 KB	Output is correct
13	Correct	149 ms	26020 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	3 ms	852 KB	Output is correct
17	Correct	65 ms	16024 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	38 ms	6684 KB	Output is correct
21	Correct	155 ms	27980 KB	Output is correct
22	Correct	148 ms	27924 KB	Output is correct
23	Correct	159 ms	28000 KB	Output is correct
24	Correct	153 ms	27908 KB	Output is correct
25	Correct	62 ms	17984 KB	Output is correct
26	Correct	62 ms	18028 KB	Output is correct
27	Correct	153 ms	27988 KB	Output is correct
28	Correct	151 ms	27980 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Correct	0 ms	212 KB	Output is correct
31	Correct	0 ms	212 KB	Output is correct
32	Incorrect	0 ms	212 KB	Answer gives possible 1 while actual possible 0
33	Halted	0 ms	0 KB	-

답안 #790201

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 10.0 / 10.0

Subtask #3 0 / 19.0

Subtask #4 35.0 / 35.0

Subtask #5 0 / 21.0

Subtask #6 0 / 4.0

Subtask #1
11.0 / 11.0

Subtask #2
10.0 / 10.0

Subtask #3
0 / 19.0

Subtask #4
35.0 / 35.0

Subtask #5
0 / 21.0

Subtask #6
0 / 4.0