답안 #1062221

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1062221	2024-08-16T21:58:24 Z	wood	슈퍼트리 잇기 (IOI20_supertrees)	C++17	21 / 100	171 ms	24148 KB

supertrees

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

typedef long long ll;
typedef pair<int,int> p32;
typedef pair<ll,ll> p64;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define vi vector<int>
#define vp32 vector<p32>
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define MOD %1000000007
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <class T>
using Tree =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//never guess
//never debug without reviewing code
//never try adding ones or substracting them
//only step by step debug when necessay



int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
    vector<vi> res(n,vi(n));
    vector<vi> reps;
    bool done[n]; memset(done,0,sizeof done);
    for(int i = 0; i<n; i++){
        if(done[i])continue;
        done[i] = true;
        set<int> zeros, ones, twos;
        for(int j = 0; j<n; j++){
            if(p[i][j]==0) zeros.insert(j);
            else if(p[i][j]==1){
              ones.insert(j);
              done[j] = true;
            }
            else twos.insert(j);
        }
        for(int x : ones){
            for(int j = 0; j<n; j++)
                if((p[x][j]==0&&!zeros.count(j))||(p[x][j]==1&&!ones.count(j))||(p[x][j]==2&&!twos.count(j))) return 0;
        }
        vi comp(ones.begin(),ones.end());
        for(int j = 0; j<comp.size()-1; j++){
            int a = comp[j], b = comp[j+1];
            res[a][b] = res[b][a] = 1;
        }
    }
    build(res);
	return 1;
}

Compilation message

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

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	5 ms	1112 KB	Output is correct
7	Correct	126 ms	22020 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	5 ms	1112 KB	Output is correct
7	Correct	126 ms	22020 KB	Output is correct
8	Correct	1 ms	348 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	1368 KB	Output is correct
13	Correct	169 ms	23988 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	54 ms	14096 KB	Output is correct
18	Correct	1 ms	432 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	36 ms	6272 KB	Output is correct
21	Correct	131 ms	24148 KB	Output is correct
22	Correct	142 ms	23940 KB	Output is correct
23	Correct	130 ms	24072 KB	Output is correct
24	Correct	171 ms	24148 KB	Output is correct
25	Correct	59 ms	14416 KB	Output is correct
26	Correct	51 ms	14216 KB	Output is correct
27	Correct	133 ms	23892 KB	Output is correct
28	Correct	162 ms	24144 KB	Output is correct

Subtask #3
0 / 19.0

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

Subtask #4
0 / 35.0

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

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	5 ms	1112 KB	Output is correct
7	Correct	126 ms	22020 KB	Output is correct
8	Correct	1 ms	348 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	1368 KB	Output is correct
13	Correct	169 ms	23988 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	54 ms	14096 KB	Output is correct
18	Correct	1 ms	432 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	36 ms	6272 KB	Output is correct
21	Correct	131 ms	24148 KB	Output is correct
22	Correct	142 ms	23940 KB	Output is correct
23	Correct	130 ms	24072 KB	Output is correct
24	Correct	171 ms	24148 KB	Output is correct
25	Correct	59 ms	14416 KB	Output is correct
26	Correct	51 ms	14216 KB	Output is correct
27	Correct	133 ms	23892 KB	Output is correct
28	Correct	162 ms	24144 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	348 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	5 ms	1112 KB	Output is correct
7	Correct	126 ms	22020 KB	Output is correct
8	Correct	1 ms	348 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	1368 KB	Output is correct
13	Correct	169 ms	23988 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	54 ms	14096 KB	Output is correct
18	Correct	1 ms	432 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	36 ms	6272 KB	Output is correct
21	Correct	131 ms	24148 KB	Output is correct
22	Correct	142 ms	23940 KB	Output is correct
23	Correct	130 ms	24072 KB	Output is correct
24	Correct	171 ms	24148 KB	Output is correct
25	Correct	59 ms	14416 KB	Output is correct
26	Correct	51 ms	14216 KB	Output is correct
27	Correct	133 ms	23892 KB	Output is correct
28	Correct	162 ms	24144 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	348 KB	Answer gives possible 1 while actual possible 0
33	Halted	0 ms	0 KB	-

답안 #1062221

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 10.0 / 10.0

Subtask #3 0 / 19.0

Subtask #4 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
0 / 35.0

Subtask #5
0 / 21.0

Subtask #6
0 / 4.0