답안 #381674

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
381674	2021-03-25T15:05:14 Z	Aryan_Raina	게임 (IOI14_game)	C++14	42 / 100	1000 ms	1132 KB

game

#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include "game.h"
#include<bits/stdc++.h>
using namespace std;

struct UFDS {
    int n, cc;
    vector<int> len, par;
    void init(int x) {
        n = cc = x;
        par.resize(n+2);
        len.assign(n+2, 1);
        iota(par.begin(), par.end(), 0);
    }
    int fin(int v) { return par[v] == v ? v : par[v] = fin(par[v]); }
    bool join(int a, int b) {
        a = fin(a); b = fin(b);
        if(a == b) return false;
        if(len[a] < len[b])
            swap(a, b);
        par[b] = a;
        len[a]+=len[b];
        cc--;
        return true;
    }
};

int n; bool adj[1505][1501];
void initialize(int _n) {
	n = _n; 
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < i; j++) adj[i][j] = adj[j][i] = 1;
	}
}

int hasEdge(int u, int v) {
	if (u < v) swap(u, v);
	UFDS ufds; ufds.init(n);
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < i; j++) if (!(i == u && j == v) && adj[i][j]) {
			ufds.join(i, j);
		}
	}
	if (ufds.cc == 1) {
		adj[u][v] = adj[v][u] = 0;
		return 0;
	} else {
		return 1;
	}
}

Compilation message

game.cpp:2: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    2 | #pragma GCC optimization ("O3")
      | 
game.cpp:3: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    3 | #pragma GCC optimization ("unroll-loops")
      |

Subtask #1
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	1 ms	364 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct

Subtask #2
27.0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	2 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	512 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	1 ms	364 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	3 ms	364 KB	Output is correct
26	Correct	3 ms	364 KB	Output is correct
27	Correct	3 ms	364 KB	Output is correct
28	Correct	3 ms	364 KB	Output is correct
29	Correct	3 ms	364 KB	Output is correct
30	Correct	3 ms	364 KB	Output is correct
31	Correct	3 ms	364 KB	Output is correct
32	Correct	3 ms	364 KB	Output is correct
33	Correct	3 ms	364 KB	Output is correct
34	Correct	52 ms	492 KB	Output is correct
35	Correct	50 ms	620 KB	Output is correct
36	Correct	51 ms	492 KB	Output is correct
37	Correct	50 ms	492 KB	Output is correct
38	Correct	50 ms	492 KB	Output is correct
39	Correct	51 ms	492 KB	Output is correct
40	Correct	49 ms	492 KB	Output is correct
41	Correct	50 ms	492 KB	Output is correct
42	Correct	50 ms	620 KB	Output is correct
43	Correct	37 ms	492 KB	Output is correct
44	Correct	38 ms	512 KB	Output is correct
45	Correct	44 ms	492 KB	Output is correct
46	Correct	44 ms	492 KB	Output is correct
47	Correct	44 ms	492 KB	Output is correct
48	Correct	44 ms	492 KB	Output is correct
49	Correct	44 ms	492 KB	Output is correct
50	Correct	44 ms	620 KB	Output is correct
51	Correct	45 ms	620 KB	Output is correct
52	Correct	44 ms	492 KB	Output is correct
53	Correct	46 ms	492 KB	Output is correct
54	Correct	45 ms	492 KB	Output is correct

Subtask #3
0 / 58.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	1 ms	364 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	3 ms	364 KB	Output is correct
26	Correct	3 ms	364 KB	Output is correct
27	Correct	3 ms	368 KB	Output is correct
28	Correct	3 ms	364 KB	Output is correct
29	Correct	3 ms	364 KB	Output is correct
30	Correct	3 ms	364 KB	Output is correct
31	Correct	3 ms	364 KB	Output is correct
32	Correct	3 ms	364 KB	Output is correct
33	Correct	3 ms	364 KB	Output is correct
34	Correct	50 ms	492 KB	Output is correct
35	Correct	51 ms	492 KB	Output is correct
36	Correct	50 ms	492 KB	Output is correct
37	Correct	50 ms	492 KB	Output is correct
38	Correct	51 ms	620 KB	Output is correct
39	Correct	51 ms	620 KB	Output is correct
40	Correct	50 ms	492 KB	Output is correct
41	Correct	50 ms	492 KB	Output is correct
42	Correct	50 ms	492 KB	Output is correct
43	Correct	36 ms	492 KB	Output is correct
44	Correct	36 ms	492 KB	Output is correct
45	Correct	45 ms	492 KB	Output is correct
46	Correct	44 ms	492 KB	Output is correct
47	Correct	44 ms	492 KB	Output is correct
48	Correct	44 ms	492 KB	Output is correct
49	Correct	46 ms	492 KB	Output is correct
50	Correct	45 ms	492 KB	Output is correct
51	Correct	44 ms	492 KB	Output is correct
52	Correct	44 ms	492 KB	Output is correct
53	Correct	45 ms	492 KB	Output is correct
54	Correct	45 ms	492 KB	Output is correct
55	Execution timed out	1092 ms	1132 KB	Time limit exceeded
56	Halted	0 ms	0 KB	-

답안 #381674

Compilation message

Subtask #1 15.0 / 15.0

Subtask #2 27.0 / 27.0

Subtask #3 0 / 58.0

Subtask #1
15.0 / 15.0

Subtask #2
27.0 / 27.0

Subtask #3
0 / 58.0