oj.uz

Submission #301092

# Submission time Handle Problem Language Result Execution time Memory
301092 2020-09-17T16:22:53 Z AmineWeslati Connecting Supertrees (IOI20_supertrees) C++14
75 / 100
 249 ms 30328 KB 
//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;

vi adj2[MX];
bool vis2[MX]; set<int> ss;



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

bool sub2(){
	FOR(i,0,N) FOR(j,i+1,N)  if(p[i][j]!=0 && p[i][j]!=1) return 0;
	return 1;
}
bool sub3(){
	FOR(i,0,N) FOR(j,i+1,N) if(p[i][j]!=0 && p[i][j]!=2) return 0;
	return 1;
}


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



bool check(vi vec[]){
	FOR(i,0,N){
		FOR(j,0,sz(vec[i])) FOR(k,j+1,sz(vec[i])) if(p[vec[i][j]][vec[i][k]]!=1) return 0;
		FOR(j,0,sz(vec[i])) FOR(k,i+1,N) FOR(l,0,sz(vec[k])){
			if(p[vec[i][j]][vec[k][l]]!=2) 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 if(sub2()||sub3()){
		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) vis[i]=false;
		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; //multiple edges
			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;
			}
		}
	}
	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

			//We are in a connected component 
			
			FOR(j,0,sz(vec)) FOR(k,j+1,sz(vec)){
				if(p[vec[k]][vec[j]]==1){
					adj2[vec[k]].pb(vec[j]);
					adj2[vec[j]].pb(vec[k]);
				}
			}
			FOR(j,0,N) vis2[j]=false;

			vi group[N]; int cnt=0;
			vi cy;
			for(auto u: vec) if(!vis2[u]){
				ss.clear(); dfs2(u);
				vi vv; for(auto x: ss) vv.pb(x);
				cy.pb(u);
				if(sz(vv)==1) continue;
				FOR(i,0,sz(vv)-1){
					res[vv[i]][vv[i+1]]=res[vv[i+1]][vv[i]]=1;
				}
				for(auto x: vv) group[cnt].pb(x);
				cnt++;
			}

			if(!check(group)) return 0;

			FOR(i,0,sz(cy)-1){
				res[cy[i]][cy[i+1]]=res[cy[i+1]][cy[i]]=1;
			}
			if(sz(cy)>1) res[cy.back()][cy[0]]=res[cy[0]][cy.back()]=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

0 0 0 0 0 
0 0 1 0 1 
0 1 0 1 0 
0 0 1 0 1 
0 1 0 1 0 
*/

/*
6
0 1 0 0 0 0
1 0 0 0 0 0
0 0 0 1 2 2
0 0 1 0 2 2
0 0 2 2 0 2
0 0 2 2 2 0

*/

/*
9
0 1 0 0 0 0 0 0 0
1 0 0 0 0 0 0 0 0
0 0 0 1 2 2 2 2 2
0 0 1 0 2 2 2 2 2
0 0 2 2 0 2 2 2 1
0 0 2 2 2 0 1 1 2
0 0 2 2 2 1 0 1 2
0 0 2 2 2 1 1 0 2
0 0 2 2 1 2 2 2 0


0 1 0 0 0 0 0 0 0 
1 0 0 0 0 0 0 0 0 
0 0 0 1 1 1 0 0 0 
0 0 1 0 0 0 0 0 0 
0 0 1 0 0 1 0 0 1 
0 0 1 0 1 0 1 0 0 
0 0 0 0 0 1 0 1 0 
0 0 0 0 0 0 1 0 0 
0 0 0 0 1 0 0 0 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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 10 ms 2048 KB Output is correct
7 Correct 234 ms 26000 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 10 ms 2048 KB Output is correct
7 Correct 234 ms 26000 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 0 ms 384 KB Output is correct
12 Correct 10 ms 2048 KB Output is correct
13 Correct 235 ms 26104 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 6 ms 1792 KB Output is correct
17 Correct 119 ms 18936 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 59 ms 7928 KB Output is correct
21 Correct 238 ms 26616 KB Output is correct
22 Correct 233 ms 26104 KB Output is correct
23 Correct 242 ms 28152 KB Output is correct
24 Correct 228 ms 26104 KB Output is correct
25 Correct 106 ms 16632 KB Output is correct
26 Correct 108 ms 16144 KB Output is correct
27 Correct 244 ms 29432 KB Output is correct
28 Correct 235 ms 26104 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory 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 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 10 ms 2048 KB Output is correct
9 Correct 233 ms 26104 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 2304 KB Output is correct
13 Correct 245 ms 30328 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 118 ms 18920 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 60 ms 7928 KB Output is correct
22 Correct 244 ms 26616 KB Output is correct
23 Correct 244 ms 26232 KB Output is correct
24 Correct 246 ms 29304 KB Output is correct
25 Correct 108 ms 16120 KB Output is correct
26 Correct 107 ms 16760 KB Output is correct
27 Correct 230 ms 26104 KB Output is correct
28 Correct 249 ms 28408 KB Output is correct
29 Correct 106 ms 16248 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 59 ms 7948 KB Output is correct
5 Correct 233 ms 26744 KB Output is correct
6 Correct 235 ms 26028 KB Output is correct
7 Correct 249 ms 28408 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 59 ms 7928 KB Output is correct
10 Correct 243 ms 26636 KB Output is correct
11 Correct 228 ms 26104 KB Output is correct
12 Correct 247 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 Correct 1 ms 384 KB Output is correct
16 Correct 63 ms 7928 KB Output is correct
17 Correct 235 ms 26616 KB Output is correct
18 Correct 235 ms 26872 KB Output is correct
19 Correct 236 ms 26360 KB Output is correct
20 Correct 235 ms 26232 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 10 ms 2048 KB Output is correct
7 Correct 234 ms 26000 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 0 ms 384 KB Output is correct
12 Correct 10 ms 2048 KB Output is correct
13 Correct 235 ms 26104 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 6 ms 1792 KB Output is correct
17 Correct 119 ms 18936 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 59 ms 7928 KB Output is correct
21 Correct 238 ms 26616 KB Output is correct
22 Correct 233 ms 26104 KB Output is correct
23 Correct 242 ms 28152 KB Output is correct
24 Correct 228 ms 26104 KB Output is correct
25 Correct 106 ms 16632 KB Output is correct
26 Correct 108 ms 16144 KB Output is correct
27 Correct 244 ms 29432 KB Output is correct
28 Correct 235 ms 26104 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 0 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 0 ms 384 KB Output is correct
36 Correct 10 ms 2048 KB Output is correct
37 Correct 233 ms 26104 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 2304 KB Output is correct
41 Correct 245 ms 30328 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 0 ms 384 KB Output is correct
44 Correct 6 ms 1792 KB Output is correct
45 Correct 118 ms 18920 KB Output is correct
46 Correct 0 ms 384 KB Output is correct
47 Correct 1 ms 384 KB Output is correct
48 Correct 0 ms 384 KB Output is correct
49 Correct 60 ms 7928 KB Output is correct
50 Correct 244 ms 26616 KB Output is correct
51 Correct 244 ms 26232 KB Output is correct
52 Correct 246 ms 29304 KB Output is correct
53 Correct 108 ms 16120 KB Output is correct
54 Correct 107 ms 16760 KB Output is correct
55 Correct 230 ms 26104 KB Output is correct
56 Correct 249 ms 28408 KB Output is correct
57 Correct 106 ms 16248 KB Output is correct
58 Incorrect 0 ms 384 KB Answer gives possible 1 while actual possible 0
59 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 10 ms 2048 KB Output is correct
7 Correct 234 ms 26000 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 0 ms 384 KB Output is correct
12 Correct 10 ms 2048 KB Output is correct
13 Correct 235 ms 26104 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 6 ms 1792 KB Output is correct
17 Correct 119 ms 18936 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 59 ms 7928 KB Output is correct
21 Correct 238 ms 26616 KB Output is correct
22 Correct 233 ms 26104 KB Output is correct
23 Correct 242 ms 28152 KB Output is correct
24 Correct 228 ms 26104 KB Output is correct
25 Correct 106 ms 16632 KB Output is correct
26 Correct 108 ms 16144 KB Output is correct
27 Correct 244 ms 29432 KB Output is correct
28 Correct 235 ms 26104 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 0 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 0 ms 384 KB Output is correct
36 Correct 10 ms 2048 KB Output is correct
37 Correct 233 ms 26104 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 2304 KB Output is correct
41 Correct 245 ms 30328 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 0 ms 384 KB Output is correct
44 Correct 6 ms 1792 KB Output is correct
45 Correct 118 ms 18920 KB Output is correct
46 Correct 0 ms 384 KB Output is correct
47 Correct 1 ms 384 KB Output is correct
48 Correct 0 ms 384 KB Output is correct
49 Correct 60 ms 7928 KB Output is correct
50 Correct 244 ms 26616 KB Output is correct
51 Correct 244 ms 26232 KB Output is correct
52 Correct 246 ms 29304 KB Output is correct
53 Correct 108 ms 16120 KB Output is correct
54 Correct 107 ms 16760 KB Output is correct
55 Correct 230 ms 26104 KB Output is correct
56 Correct 249 ms 28408 KB Output is correct
57 Correct 106 ms 16248 KB Output is correct
58 Correct 0 ms 384 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 0 ms 384 KB Output is correct
61 Correct 59 ms 7948 KB Output is correct
62 Correct 233 ms 26744 KB Output is correct
63 Correct 235 ms 26028 KB Output is correct
64 Correct 249 ms 28408 KB Output is correct
65 Correct 0 ms 384 KB Output is correct
66 Correct 59 ms 7928 KB Output is correct
67 Correct 243 ms 26636 KB Output is correct
68 Correct 228 ms 26104 KB Output is correct
69 Correct 247 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 Correct 1 ms 384 KB Output is correct
73 Correct 63 ms 7928 KB Output is correct
74 Correct 235 ms 26616 KB Output is correct
75 Correct 235 ms 26872 KB Output is correct
76 Correct 236 ms 26360 KB Output is correct
77 Correct 235 ms 26232 KB Output is correct
78 Incorrect 0 ms 384 KB Answer gives possible 1 while actual possible 0
79 Halted 0 ms 0 KB -