답안 #113597

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
113597	2019-05-26T14:44:25 Z	MladenP	게임 (IOI14_game)	C++17	100 / 100	480 ms	24848 KB

game

//#include "grader.h"
#include <bits/stdc++.h>
#define STIZE(x) fprintf(stderr, "STIZE%d\n", x);
#define PRINT(x) fprintf(stderr, "%s = %d\n", #x, x);
#define NL(x) printf("%c", " \n"[(x)]);
#define lld long long
#define pii pair<int,int>
#define pb push_back
#define fi first
#define se second
#define all(a) begin(a),end(a)
#define sz(a) int((a).size())
#define LINF LLONG_MAX
#define INF INT_MAX
#define EPS 1e-9
#define MAXN 1510
using namespace std;

struct uNode {
    int parent, cnt;
};
uNode dsu[MAXN];
int edges[MAXN][MAXN];
int Root(int x) {
    while(x != dsu[x].parent) {
        dsu[x].parent = dsu[dsu[dsu[x].parent].parent].parent;
        x = dsu[x].parent;
    }
    return x;
}
int N;
void Connect(int a, int b) {
    int rootA = Root(a), rootB = Root(b);
    if(dsu[rootA].cnt > dsu[rootB].cnt) {
        dsu[rootB].parent = rootA;
        dsu[rootA].cnt += dsu[rootB].cnt;
        for(int i = 1; i <= N; i++) {
            edges[min(i, rootA)][max(i, rootA)] += edges[min(i, rootB)][max(i, rootB)];
        }
    }
    else  {
        dsu[rootA].parent = rootB;
        dsu[rootB].cnt += dsu[rootA].cnt;
        for(int i = 0; i < N; i++) {
            edges[min(i, rootB)][max(i, rootB)] += edges[min(i, rootA)][max(i, rootA)];
        }
    }
}
void initialize(int n) {
    N = n;
    for(int i = 0; i < n; i++) {
        dsu[i].parent = i; dsu[i].cnt = 1;
    }
}

int hasEdge(int u, int v) {
    int rootV = Root(v), rootU = Root(u);
    int minn = min(rootV, rootU); rootU = max(rootU, rootV), rootV = minn;
    int totEdges = dsu[rootV].cnt*dsu[rootU].cnt-edges[rootV][rootU];
    ///PRINT(totEdges);
    ///PRINT(dsu[rootV].cnt);
    ///PRINT(totEdges);
    if(totEdges == 1) return Connect(rootV, rootU), 1;
    else return edges[rootV][rootU]++, 0;
}
/*
int main() {
    int n; scanf("%d", &n);
    initialize(n);
    for(int i = 0; i < (n-1)*n/2; i++) {
        int x, y; scanf("%d%d", &x, &y);
        printf("%d\n", hasEdge(x, y));
    }
}
*/

Subtask #1
15.0 / 15.0

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

Subtask #2
27.0 / 27.0

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

Subtask #3
58.0 / 58.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	2 ms	384 KB	Output is correct
4	Correct	2 ms	384 KB	Output is correct
5	Correct	2 ms	384 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	2 ms	384 KB	Output is correct
8	Correct	2 ms	384 KB	Output is correct
9	Correct	2 ms	384 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	2 ms	384 KB	Output is correct
12	Correct	2 ms	384 KB	Output is correct
13	Correct	2 ms	384 KB	Output is correct
14	Correct	2 ms	384 KB	Output is correct
15	Correct	2 ms	384 KB	Output is correct
16	Correct	2 ms	384 KB	Output is correct
17	Correct	2 ms	384 KB	Output is correct
18	Correct	2 ms	384 KB	Output is correct
19	Correct	2 ms	384 KB	Output is correct
20	Correct	2 ms	384 KB	Output is correct
21	Correct	2 ms	384 KB	Output is correct
22	Correct	2 ms	384 KB	Output is correct
23	Correct	2 ms	384 KB	Output is correct
24	Correct	2 ms	384 KB	Output is correct
25	Correct	3 ms	512 KB	Output is correct
26	Correct	2 ms	512 KB	Output is correct
27	Correct	2 ms	512 KB	Output is correct
28	Correct	2 ms	512 KB	Output is correct
29	Correct	2 ms	512 KB	Output is correct
30	Correct	2 ms	512 KB	Output is correct
31	Correct	2 ms	508 KB	Output is correct
32	Correct	2 ms	512 KB	Output is correct
33	Correct	2 ms	512 KB	Output is correct
34	Correct	3 ms	768 KB	Output is correct
35	Correct	3 ms	768 KB	Output is correct
36	Correct	4 ms	768 KB	Output is correct
37	Correct	3 ms	768 KB	Output is correct
38	Correct	4 ms	768 KB	Output is correct
39	Correct	3 ms	768 KB	Output is correct
40	Correct	3 ms	768 KB	Output is correct
41	Correct	3 ms	768 KB	Output is correct
42	Correct	3 ms	768 KB	Output is correct
43	Correct	3 ms	384 KB	Output is correct
44	Correct	3 ms	768 KB	Output is correct
45	Correct	3 ms	768 KB	Output is correct
46	Correct	3 ms	768 KB	Output is correct
47	Correct	3 ms	640 KB	Output is correct
48	Correct	3 ms	768 KB	Output is correct
49	Correct	4 ms	768 KB	Output is correct
50	Correct	4 ms	640 KB	Output is correct
51	Correct	4 ms	684 KB	Output is correct
52	Correct	3 ms	768 KB	Output is correct
53	Correct	4 ms	640 KB	Output is correct
54	Correct	3 ms	768 KB	Output is correct
55	Correct	44 ms	4728 KB	Output is correct
56	Correct	44 ms	4684 KB	Output is correct
57	Correct	46 ms	4600 KB	Output is correct
58	Correct	48 ms	4668 KB	Output is correct
59	Correct	44 ms	4600 KB	Output is correct
60	Correct	44 ms	4676 KB	Output is correct
61	Correct	54 ms	4600 KB	Output is correct
62	Correct	42 ms	4664 KB	Output is correct
63	Correct	46 ms	4744 KB	Output is correct
64	Correct	37 ms	2168 KB	Output is correct
65	Correct	42 ms	4128 KB	Output is correct
66	Correct	44 ms	4600 KB	Output is correct
67	Correct	44 ms	4656 KB	Output is correct
68	Correct	48 ms	4728 KB	Output is correct
69	Correct	43 ms	4708 KB	Output is correct
70	Correct	44 ms	4728 KB	Output is correct
71	Correct	43 ms	4728 KB	Output is correct
72	Correct	43 ms	4600 KB	Output is correct
73	Correct	43 ms	4728 KB	Output is correct
74	Correct	42 ms	4600 KB	Output is correct
75	Correct	43 ms	4600 KB	Output is correct
76	Correct	100 ms	8440 KB	Output is correct
77	Correct	100 ms	8568 KB	Output is correct
78	Correct	98 ms	8440 KB	Output is correct
79	Correct	99 ms	8568 KB	Output is correct
80	Correct	98 ms	8440 KB	Output is correct
81	Correct	106 ms	8624 KB	Output is correct
82	Correct	97 ms	8568 KB	Output is correct
83	Correct	97 ms	8476 KB	Output is correct
84	Correct	93 ms	8440 KB	Output is correct
85	Correct	166 ms	13052 KB	Output is correct
86	Correct	166 ms	13140 KB	Output is correct
87	Correct	169 ms	13160 KB	Output is correct
88	Correct	175 ms	13020 KB	Output is correct
89	Correct	173 ms	13020 KB	Output is correct
90	Correct	170 ms	13148 KB	Output is correct
91	Correct	171 ms	13048 KB	Output is correct
92	Correct	167 ms	13048 KB	Output is correct
93	Correct	169 ms	13160 KB	Output is correct
94	Correct	383 ms	24784 KB	Output is correct
95	Correct	375 ms	24840 KB	Output is correct
96	Correct	374 ms	24696 KB	Output is correct
97	Correct	378 ms	24748 KB	Output is correct
98	Correct	380 ms	24848 KB	Output is correct
99	Correct	480 ms	24832 KB	Output is correct
100	Correct	416 ms	24824 KB	Output is correct

답안 #113597

Compilation message

Subtask #1 15.0 / 15.0

Subtask #2 27.0 / 27.0

Subtask #3 58.0 / 58.0

Subtask #1
15.0 / 15.0

Subtask #2
27.0 / 27.0

Subtask #3
58.0 / 58.0