답안 #300643

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
300643	2020-09-17T10:52:13 Z	AmineWeslati	슈퍼트리 잇기 (IOI20_supertrees)	C++14	40 / 100	280 ms	30200 KB

supertrees

//Never stop trying
#include "supertrees.h"
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef string str;
typedef long long ll;
//#define int ll
typedef double db;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef vector<str> vs;
typedef vector<ld> vd;
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)

const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 1001;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

#define dbg(x) cerr << " - " << #x << " : " << x << endl;
#define dbgs(x,y) cerr << " - " << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << " - " << #v << " : " << endl << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;

void IO() {
#ifndef ONLINE_JUDGE
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif
}



int N;
int p[MX][MX];
vi adj[MX];
bool vis[MX]; set<int> s;

void dfs(int u){
	vis[u]=true;
	s.insert(u);
	for(auto v: adj[u]) if(!vis[v])dfs(v);
}

bool sub1(){
	FOR(i,0,N) FOR(j,0,N) if(p[i][j]!=1) return 0;
	return 1;
}


int construct(vector<vi> P) {
	N=sz(P[0]);
	vector<vi> res(N,vi(N,-1));
	FOR(i,0,N) FOR(j,0,N) p[i][j]=P[i][j],res[i][j]=0;

	if(sub1()){
		FOR(i,0,N-1) res[i][i+1]=res[i+1][i]=1;
	}
	else{
		FOR(i,0,N) FOR(j,i+1,N) if(p[i][j]!=0){
			adj[i].pb(j); adj[j].pb(i);
		}
		FOR(i,0,N) if(!vis[i]){
			s.clear(); dfs(i);
			vi vec; for(auto x: s) vec.pb(x);
			if(sz(vec)==1) continue; //no edges to add
			//dbgv(vec);
			int cur=p[vec[0]][vec[1]];
			if(sz(vec)==2 && cur==2) return 0;
			FOR(j,0,sz(vec)) FOR(k,j+1,sz(vec)){
				if(p[vec[j]][vec[k]]!=cur) return 0;
			}
			FOR(i,0,sz(vec)){
				if(i<sz(vec)-1){
					res[vec[i]][vec[i+1]]=res[vec[i+1]][vec[i]]=1;
				}
				if(i==sz(vec)-1 && cur==2) res[vec[i]][vec[0]]=res[vec[0]][vec[i]]=1;
			}
		}
	}

	build(res);
	
	return 1;
}

/*
5
0 0 0 0 0
0 0 2 2 2
0 2 0 2 2
0 2 2 0 2
0 2 2 2 0
*/





/* Careful!!!
	.Array bounds
	.Infinite loops
	.Uninitialized variables / empty containers
	.Order of input

   Some insights:
	.Binary search
	.Graph representation
	.Write brute force code
	.Change your approach
*/

Compilation message

supertrees.cpp:4: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    4 | #pragma GCC optimization ("O3")
      | 
supertrees.cpp:5: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    5 | #pragma GCC optimization ("unroll-loops")
      | 
supertrees.cpp: In function 'void IO()':
supertrees.cpp:51:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   51 |  freopen("input.txt", "r", stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
supertrees.cpp:52:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   52 |  freopen("output.txt", "w", stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	13 ms	2048 KB	Output is correct
7	Correct	238 ms	26192 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	13 ms	2048 KB	Output is correct
7	Correct	238 ms	26192 KB	Output is correct
8	Correct	0 ms	384 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	10 ms	2048 KB	Output is correct
13	Correct	275 ms	25976 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	0 ms	384 KB	Output is correct
16	Correct	6 ms	1792 KB	Output is correct
17	Correct	129 ms	18936 KB	Output is correct
18	Correct	1 ms	384 KB	Output is correct
19	Correct	0 ms	384 KB	Output is correct
20	Correct	60 ms	7800 KB	Output is correct
21	Correct	270 ms	26608 KB	Output is correct
22	Correct	280 ms	26104 KB	Output is correct
23	Correct	255 ms	28152 KB	Output is correct
24	Correct	227 ms	25976 KB	Output is correct
25	Correct	120 ms	16632 KB	Output is correct
26	Correct	110 ms	16120 KB	Output is correct
27	Correct	247 ms	29176 KB	Output is correct
28	Correct	246 ms	25976 KB	Output is correct

Subtask #3
19.0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	1 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Correct	16 ms	2048 KB	Output is correct
9	Correct	228 ms	25976 KB	Output is correct
10	Correct	1 ms	384 KB	Output is correct
11	Correct	0 ms	384 KB	Output is correct
12	Correct	11 ms	2176 KB	Output is correct
13	Correct	245 ms	30200 KB	Output is correct
14	Correct	0 ms	384 KB	Output is correct
15	Correct	1 ms	416 KB	Output is correct
16	Correct	6 ms	1792 KB	Output is correct
17	Correct	119 ms	18936 KB	Output is correct
18	Correct	0 ms	384 KB	Output is correct
19	Correct	0 ms	384 KB	Output is correct
20	Correct	0 ms	384 KB	Output is correct
21	Correct	58 ms	7800 KB	Output is correct
22	Correct	240 ms	26616 KB	Output is correct
23	Correct	233 ms	26104 KB	Output is correct
24	Correct	254 ms	29304 KB	Output is correct
25	Correct	98 ms	16120 KB	Output is correct
26	Correct	106 ms	16632 KB	Output is correct
27	Correct	239 ms	26048 KB	Output is correct
28	Correct	250 ms	28148 KB	Output is correct
29	Correct	98 ms	16120 KB	Output is correct

Subtask #4
0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	59 ms	7800 KB	Output is correct
5	Correct	235 ms	26616 KB	Output is correct
6	Correct	227 ms	26104 KB	Output is correct
7	Correct	247 ms	28152 KB	Output is correct
8	Correct	0 ms	384 KB	Output is correct
9	Correct	58 ms	7800 KB	Output is correct
10	Correct	235 ms	26744 KB	Output is correct
11	Correct	232 ms	26104 KB	Output is correct
12	Correct	252 ms	29176 KB	Output is correct
13	Correct	0 ms	384 KB	Output is correct
14	Correct	0 ms	384 KB	Output is correct
15	Incorrect	1 ms	384 KB	Answer gives possible 0 while actual possible 1
16	Halted	0 ms	0 KB	-

Subtask #5
0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	13 ms	2048 KB	Output is correct
7	Correct	238 ms	26192 KB	Output is correct
8	Correct	0 ms	384 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	10 ms	2048 KB	Output is correct
13	Correct	275 ms	25976 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	0 ms	384 KB	Output is correct
16	Correct	6 ms	1792 KB	Output is correct
17	Correct	129 ms	18936 KB	Output is correct
18	Correct	1 ms	384 KB	Output is correct
19	Correct	0 ms	384 KB	Output is correct
20	Correct	60 ms	7800 KB	Output is correct
21	Correct	270 ms	26608 KB	Output is correct
22	Correct	280 ms	26104 KB	Output is correct
23	Correct	255 ms	28152 KB	Output is correct
24	Correct	227 ms	25976 KB	Output is correct
25	Correct	120 ms	16632 KB	Output is correct
26	Correct	110 ms	16120 KB	Output is correct
27	Correct	247 ms	29176 KB	Output is correct
28	Correct	246 ms	25976 KB	Output is correct
29	Correct	1 ms	384 KB	Output is correct
30	Correct	1 ms	384 KB	Output is correct
31	Correct	0 ms	384 KB	Output is correct
32	Correct	0 ms	384 KB	Output is correct
33	Correct	1 ms	384 KB	Output is correct
34	Correct	1 ms	384 KB	Output is correct
35	Correct	1 ms	384 KB	Output is correct
36	Correct	16 ms	2048 KB	Output is correct
37	Correct	228 ms	25976 KB	Output is correct
38	Correct	1 ms	384 KB	Output is correct
39	Correct	0 ms	384 KB	Output is correct
40	Correct	11 ms	2176 KB	Output is correct
41	Correct	245 ms	30200 KB	Output is correct
42	Correct	0 ms	384 KB	Output is correct
43	Correct	1 ms	416 KB	Output is correct
44	Correct	6 ms	1792 KB	Output is correct
45	Correct	119 ms	18936 KB	Output is correct
46	Correct	0 ms	384 KB	Output is correct
47	Correct	0 ms	384 KB	Output is correct
48	Correct	0 ms	384 KB	Output is correct
49	Correct	58 ms	7800 KB	Output is correct
50	Correct	240 ms	26616 KB	Output is correct
51	Correct	233 ms	26104 KB	Output is correct
52	Correct	254 ms	29304 KB	Output is correct
53	Correct	98 ms	16120 KB	Output is correct
54	Correct	106 ms	16632 KB	Output is correct
55	Correct	239 ms	26048 KB	Output is correct
56	Correct	250 ms	28148 KB	Output is correct
57	Correct	98 ms	16120 KB	Output is correct
58	Correct	1 ms	384 KB	Output is correct
59	Correct	0 ms	384 KB	Output is correct
60	Correct	6 ms	1792 KB	Output is correct
61	Correct	118 ms	20600 KB	Output is correct
62	Correct	0 ms	384 KB	Output is correct
63	Correct	0 ms	384 KB	Output is correct
64	Correct	0 ms	384 KB	Output is correct
65	Incorrect	26 ms	5372 KB	Answer gives possible 0 while actual possible 1
66	Halted	0 ms	0 KB	-

Subtask #6
0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	13 ms	2048 KB	Output is correct
7	Correct	238 ms	26192 KB	Output is correct
8	Correct	0 ms	384 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	10 ms	2048 KB	Output is correct
13	Correct	275 ms	25976 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	0 ms	384 KB	Output is correct
16	Correct	6 ms	1792 KB	Output is correct
17	Correct	129 ms	18936 KB	Output is correct
18	Correct	1 ms	384 KB	Output is correct
19	Correct	0 ms	384 KB	Output is correct
20	Correct	60 ms	7800 KB	Output is correct
21	Correct	270 ms	26608 KB	Output is correct
22	Correct	280 ms	26104 KB	Output is correct
23	Correct	255 ms	28152 KB	Output is correct
24	Correct	227 ms	25976 KB	Output is correct
25	Correct	120 ms	16632 KB	Output is correct
26	Correct	110 ms	16120 KB	Output is correct
27	Correct	247 ms	29176 KB	Output is correct
28	Correct	246 ms	25976 KB	Output is correct
29	Correct	1 ms	384 KB	Output is correct
30	Correct	1 ms	384 KB	Output is correct
31	Correct	0 ms	384 KB	Output is correct
32	Correct	0 ms	384 KB	Output is correct
33	Correct	1 ms	384 KB	Output is correct
34	Correct	1 ms	384 KB	Output is correct
35	Correct	1 ms	384 KB	Output is correct
36	Correct	16 ms	2048 KB	Output is correct
37	Correct	228 ms	25976 KB	Output is correct
38	Correct	1 ms	384 KB	Output is correct
39	Correct	0 ms	384 KB	Output is correct
40	Correct	11 ms	2176 KB	Output is correct
41	Correct	245 ms	30200 KB	Output is correct
42	Correct	0 ms	384 KB	Output is correct
43	Correct	1 ms	416 KB	Output is correct
44	Correct	6 ms	1792 KB	Output is correct
45	Correct	119 ms	18936 KB	Output is correct
46	Correct	0 ms	384 KB	Output is correct
47	Correct	0 ms	384 KB	Output is correct
48	Correct	0 ms	384 KB	Output is correct
49	Correct	58 ms	7800 KB	Output is correct
50	Correct	240 ms	26616 KB	Output is correct
51	Correct	233 ms	26104 KB	Output is correct
52	Correct	254 ms	29304 KB	Output is correct
53	Correct	98 ms	16120 KB	Output is correct
54	Correct	106 ms	16632 KB	Output is correct
55	Correct	239 ms	26048 KB	Output is correct
56	Correct	250 ms	28148 KB	Output is correct
57	Correct	98 ms	16120 KB	Output is correct
58	Correct	0 ms	384 KB	Output is correct
59	Correct	0 ms	384 KB	Output is correct
60	Correct	0 ms	384 KB	Output is correct
61	Correct	59 ms	7800 KB	Output is correct
62	Correct	235 ms	26616 KB	Output is correct
63	Correct	227 ms	26104 KB	Output is correct
64	Correct	247 ms	28152 KB	Output is correct
65	Correct	0 ms	384 KB	Output is correct
66	Correct	58 ms	7800 KB	Output is correct
67	Correct	235 ms	26744 KB	Output is correct
68	Correct	232 ms	26104 KB	Output is correct
69	Correct	252 ms	29176 KB	Output is correct
70	Correct	0 ms	384 KB	Output is correct
71	Correct	0 ms	384 KB	Output is correct
72	Incorrect	1 ms	384 KB	Answer gives possible 0 while actual possible 1
73	Halted	0 ms	0 KB	-

답안 #300643

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 10.0 / 10.0

Subtask #3 19.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
19.0 / 19.0

Subtask #4
0 / 35.0

Subtask #5
0 / 21.0

Subtask #6
0 / 4.0