Submission #59885

# Submission time Handle Problem Language Result Execution time Memory
59885 2018-07-23T08:33:54 Z hamzqq9 Game (IOI14_game) C++14
42 / 100
1000 ms 2164 KB
#include "game.h"
#include<bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define sz(x) x.size()
using namespace std;

#define N 1505

set< pair<int,int> > edge_set[N];

int ata[N],n;

int bul(int node) {

	if(ata[node]==node) return node;

	return ata[node]=bul(ata[node]);

}

bool ok[N][N];
int cnt=0;

void initialize(int n) {

	::n=n;

	for(int i=0;i<n;i++) {

		for(int j=0;j<n;j++) ok[i][j]=1;

	}

}

bool vis[N];

void dfs(int node) {

	if(vis[node]) return ;

	vis[node]=1;

	for(int i=0;i<n;i++) {

		if(ok[node][i]) dfs(i);

	}

}

int hasEdge(int u, int v) { 

	memset(vis,0,sizeof(vis));

	ok[u][v]=ok[v][u]=0;

	dfs(u);

	if(vis[v]) return 0;

	return ok[u][v]=ok[v][u]=1;
	
}
/*
#include <cstdio>
#include <cassert>
#include "game.h"

int read_int() {
    int x;
    assert(scanf("%d", &x) == 1);
    return x;
}

int bab[N];

int fin(int node) {

	if(bab[node]==node) return node;

	return bab[node]=fin(bab[node]);

}

void bug(vector< pair<int,int> > ed,int n) {

	flag=1;

	initialize(n);

	for(auto x:ed) {

		printf("%d %d\n",x.st,x.nd);

		printf("%d\n",hasEdge(x.st,x.nd));

	}

}

int main() {

    int n, u, v;
    n = 5;

    vector< pair<int,int> > ed;

    for(int i=0;i<n;i++) {

    	for(int j=0;j<i;j++) {

    		ed.push_back(mp(i,j));

    	}

    }

    int tot=0;

    do {

    	int comp=n;

    	for(int i=0;i<n;i++) bab[i]=i;

		initialize(n);
		for (int i = 0; i < n * (n - 1) / 2; i++) {
		    u = ed[i].st;
		    v = ed[i].nd;
		  //  printf("%d %d ",u,v);

		    int res=hasEdge(u,v);

		    if(res) {

		    	int bu=fin(u);
		    	int bv=fin(v);

		    	if(bu!=bv) {

		    		bab[bu]=bv;

		    		comp--;

		    	}

		    }

		    if(comp==1 && i<n*(n-1)/2-1) {

		    	bug(ed,n);

		    	return 0;

		    } 

		}

		if(comp>1) {

			bug(ed,n);

			return 0;

		}

	} while(next_permutation(ed.begin(),ed.end()));

    return 0;
}
*/
# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 520 KB Output is correct
4 Correct 3 ms 520 KB Output is correct
5 Correct 3 ms 520 KB Output is correct
6 Correct 2 ms 520 KB Output is correct
7 Correct 2 ms 520 KB Output is correct
8 Correct 3 ms 612 KB Output is correct
9 Correct 3 ms 668 KB Output is correct
10 Correct 3 ms 668 KB Output is correct
11 Correct 3 ms 668 KB Output is correct
12 Correct 2 ms 668 KB Output is correct
13 Correct 3 ms 668 KB Output is correct
14 Correct 3 ms 668 KB Output is correct
15 Correct 3 ms 668 KB Output is correct
16 Correct 4 ms 668 KB Output is correct
17 Correct 2 ms 668 KB Output is correct
18 Correct 3 ms 668 KB Output is correct
19 Correct 2 ms 668 KB Output is correct
20 Correct 3 ms 668 KB Output is correct
21 Correct 2 ms 764 KB Output is correct
22 Correct 2 ms 764 KB Output is correct
23 Correct 2 ms 764 KB Output is correct
24 Correct 4 ms 764 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 764 KB Output is correct
2 Correct 3 ms 764 KB Output is correct
3 Correct 2 ms 764 KB Output is correct
4 Correct 2 ms 764 KB Output is correct
5 Correct 3 ms 764 KB Output is correct
6 Correct 3 ms 764 KB Output is correct
7 Correct 2 ms 764 KB Output is correct
8 Correct 3 ms 764 KB Output is correct
9 Correct 3 ms 764 KB Output is correct
10 Correct 3 ms 764 KB Output is correct
11 Correct 4 ms 764 KB Output is correct
12 Correct 3 ms 764 KB Output is correct
13 Correct 3 ms 764 KB Output is correct
14 Correct 3 ms 764 KB Output is correct
15 Correct 3 ms 764 KB Output is correct
16 Correct 4 ms 764 KB Output is correct
17 Correct 3 ms 764 KB Output is correct
18 Correct 2 ms 764 KB Output is correct
19 Correct 3 ms 764 KB Output is correct
20 Correct 4 ms 764 KB Output is correct
21 Correct 3 ms 764 KB Output is correct
22 Correct 3 ms 764 KB Output is correct
23 Correct 2 ms 764 KB Output is correct
24 Correct 2 ms 764 KB Output is correct
25 Correct 5 ms 764 KB Output is correct
26 Correct 6 ms 764 KB Output is correct
27 Correct 7 ms 764 KB Output is correct
28 Correct 5 ms 764 KB Output is correct
29 Correct 5 ms 764 KB Output is correct
30 Correct 5 ms 764 KB Output is correct
31 Correct 8 ms 764 KB Output is correct
32 Correct 4 ms 764 KB Output is correct
33 Correct 6 ms 764 KB Output is correct
34 Correct 125 ms 956 KB Output is correct
35 Correct 128 ms 956 KB Output is correct
36 Correct 121 ms 972 KB Output is correct
37 Correct 130 ms 972 KB Output is correct
38 Correct 114 ms 972 KB Output is correct
39 Correct 115 ms 972 KB Output is correct
40 Correct 127 ms 972 KB Output is correct
41 Correct 125 ms 972 KB Output is correct
42 Correct 125 ms 972 KB Output is correct
43 Correct 81 ms 972 KB Output is correct
44 Correct 86 ms 972 KB Output is correct
45 Correct 90 ms 972 KB Output is correct
46 Correct 98 ms 972 KB Output is correct
47 Correct 90 ms 1112 KB Output is correct
48 Correct 90 ms 1112 KB Output is correct
49 Correct 102 ms 1112 KB Output is correct
50 Correct 104 ms 1112 KB Output is correct
51 Correct 104 ms 1112 KB Output is correct
52 Correct 97 ms 1224 KB Output is correct
53 Correct 98 ms 1224 KB Output is correct
54 Correct 116 ms 1224 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 1224 KB Output is correct
2 Correct 3 ms 1224 KB Output is correct
3 Correct 3 ms 1224 KB Output is correct
4 Correct 3 ms 1224 KB Output is correct
5 Correct 3 ms 1224 KB Output is correct
6 Correct 3 ms 1224 KB Output is correct
7 Correct 3 ms 1224 KB Output is correct
8 Correct 3 ms 1224 KB Output is correct
9 Correct 3 ms 1224 KB Output is correct
10 Correct 3 ms 1224 KB Output is correct
11 Correct 3 ms 1224 KB Output is correct
12 Correct 3 ms 1224 KB Output is correct
13 Correct 2 ms 1224 KB Output is correct
14 Correct 3 ms 1224 KB Output is correct
15 Correct 2 ms 1224 KB Output is correct
16 Correct 2 ms 1224 KB Output is correct
17 Correct 3 ms 1224 KB Output is correct
18 Correct 2 ms 1224 KB Output is correct
19 Correct 3 ms 1224 KB Output is correct
20 Correct 2 ms 1224 KB Output is correct
21 Correct 3 ms 1224 KB Output is correct
22 Correct 3 ms 1224 KB Output is correct
23 Correct 3 ms 1224 KB Output is correct
24 Correct 2 ms 1224 KB Output is correct
25 Correct 5 ms 1224 KB Output is correct
26 Correct 6 ms 1224 KB Output is correct
27 Correct 6 ms 1224 KB Output is correct
28 Correct 6 ms 1224 KB Output is correct
29 Correct 7 ms 1224 KB Output is correct
30 Correct 5 ms 1224 KB Output is correct
31 Correct 5 ms 1224 KB Output is correct
32 Correct 6 ms 1224 KB Output is correct
33 Correct 7 ms 1224 KB Output is correct
34 Correct 115 ms 1264 KB Output is correct
35 Correct 127 ms 1264 KB Output is correct
36 Correct 121 ms 1264 KB Output is correct
37 Correct 116 ms 1264 KB Output is correct
38 Correct 132 ms 1264 KB Output is correct
39 Correct 113 ms 1264 KB Output is correct
40 Correct 116 ms 1264 KB Output is correct
41 Correct 111 ms 1264 KB Output is correct
42 Correct 125 ms 1324 KB Output is correct
43 Correct 64 ms 1324 KB Output is correct
44 Correct 61 ms 1324 KB Output is correct
45 Correct 92 ms 1324 KB Output is correct
46 Correct 91 ms 1324 KB Output is correct
47 Correct 88 ms 1324 KB Output is correct
48 Correct 88 ms 1424 KB Output is correct
49 Correct 98 ms 1424 KB Output is correct
50 Correct 110 ms 1424 KB Output is correct
51 Correct 100 ms 1424 KB Output is correct
52 Correct 98 ms 1424 KB Output is correct
53 Correct 99 ms 1484 KB Output is correct
54 Correct 100 ms 1536 KB Output is correct
55 Execution timed out 1079 ms 2164 KB Time limit exceeded
56 Halted 0 ms 0 KB -