답안 #348392

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
348392	2021-01-14T20:58:12 Z	iliccmarko	게임 (IOI14_game)	C++14	100 / 100	626 ms	25580 KB

game

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define INF 1000000000
#define LINF 1000000000000000LL
#define pb push_back
#define all(x) x.begin(), x.end()
#define len(s) (int)s.size()
#define test_case { int t; cin>>t; while(t--)solve(); }
#define single_case solve();
#define line cerr<<"----------"<<endl;
#define ios { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cerr.tie(NULL); }
#define mod 1000000007LL
int n;
const int N = 1505;
int parent[N], s[N];
int cnt[N][N];
vector<int> g[N];

int find_parent(int u)
{
    if(parent[u]==u) return u;
    return parent[u] = find_parent(parent[u]);
}

void _union(int u, int v)
{
    u = find_parent(u);
    v = find_parent(v);
    if(u!=v)
    {
        if(s[u]<s[v]) swap(u, v);
        for(int i = 1;i<=n;i++)
        {
            cnt[i][u] += cnt[i][v];
        }
        for(int x : g[v])
        {
            g[u].pb(x);
        }
        parent[v] = u;
        s[u] += s[v];
    }
}

void initialize(int N)
{
    n = N;
    for(int i = 1;i<=n;i++) g[i].pb(i);
    for(int i = 1;i<=n;i++) parent[i] = i, s[i] = 1;
}

int hasEdge(int u, int v)
{
    u++;
    v++;
    int a = find_parent(u);
    int b = find_parent(v);
    int w = s[a]*s[b];
    if(s[b]<s[a])
    {
        for(int i : g[b])
        {
            w -= cnt[i][a];
        }
    }
    else
        for(int i : g[a])
    {
        w -= cnt[i][b];
    }
    //cout<<u<<" "<<v<<" "<<a<<" "<<b<<" "<<w<<endl;
    cnt[u][b]++;
    cnt[v][a]++;
    if(w==1)
    {
        _union(a, b);
        return 1;
    }
    return 0;
}

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	0 ms	364 KB	Output is correct
10	Correct	0 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	0 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	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	1 ms	492 KB	Output is correct
26	Correct	1 ms	492 KB	Output is correct
27	Correct	1 ms	492 KB	Output is correct
28	Correct	1 ms	492 KB	Output is correct
29	Correct	1 ms	492 KB	Output is correct
30	Correct	1 ms	492 KB	Output is correct
31	Correct	1 ms	492 KB	Output is correct
32	Correct	1 ms	492 KB	Output is correct
33	Correct	1 ms	492 KB	Output is correct
34	Correct	2 ms	748 KB	Output is correct
35	Correct	2 ms	748 KB	Output is correct
36	Correct	2 ms	748 KB	Output is correct
37	Correct	2 ms	748 KB	Output is correct
38	Correct	2 ms	748 KB	Output is correct
39	Correct	2 ms	748 KB	Output is correct
40	Correct	2 ms	748 KB	Output is correct
41	Correct	2 ms	748 KB	Output is correct
42	Correct	2 ms	748 KB	Output is correct
43	Correct	2 ms	748 KB	Output is correct
44	Correct	3 ms	748 KB	Output is correct
45	Correct	2 ms	748 KB	Output is correct
46	Correct	2 ms	748 KB	Output is correct
47	Correct	2 ms	748 KB	Output is correct
48	Correct	2 ms	748 KB	Output is correct
49	Correct	2 ms	748 KB	Output is correct
50	Correct	2 ms	748 KB	Output is correct
51	Correct	2 ms	804 KB	Output is correct
52	Correct	2 ms	748 KB	Output is correct
53	Correct	2 ms	748 KB	Output is correct
54	Correct	2 ms	748 KB	Output is correct

Subtask #3
58.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	0 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	1 ms	492 KB	Output is correct
26	Correct	1 ms	492 KB	Output is correct
27	Correct	1 ms	492 KB	Output is correct
28	Correct	1 ms	492 KB	Output is correct
29	Correct	1 ms	492 KB	Output is correct
30	Correct	1 ms	492 KB	Output is correct
31	Correct	1 ms	492 KB	Output is correct
32	Correct	1 ms	492 KB	Output is correct
33	Correct	1 ms	492 KB	Output is correct
34	Correct	2 ms	748 KB	Output is correct
35	Correct	2 ms	748 KB	Output is correct
36	Correct	2 ms	748 KB	Output is correct
37	Correct	2 ms	748 KB	Output is correct
38	Correct	2 ms	748 KB	Output is correct
39	Correct	2 ms	748 KB	Output is correct
40	Correct	2 ms	748 KB	Output is correct
41	Correct	2 ms	748 KB	Output is correct
42	Correct	2 ms	748 KB	Output is correct
43	Correct	2 ms	748 KB	Output is correct
44	Correct	3 ms	748 KB	Output is correct
45	Correct	2 ms	748 KB	Output is correct
46	Correct	2 ms	748 KB	Output is correct
47	Correct	2 ms	748 KB	Output is correct
48	Correct	2 ms	748 KB	Output is correct
49	Correct	2 ms	748 KB	Output is correct
50	Correct	2 ms	748 KB	Output is correct
51	Correct	2 ms	748 KB	Output is correct
52	Correct	2 ms	748 KB	Output is correct
53	Correct	2 ms	780 KB	Output is correct
54	Correct	2 ms	748 KB	Output is correct
55	Correct	53 ms	4204 KB	Output is correct
56	Correct	54 ms	4332 KB	Output is correct
57	Correct	53 ms	4224 KB	Output is correct
58	Correct	52 ms	4204 KB	Output is correct
59	Correct	52 ms	4332 KB	Output is correct
60	Correct	52 ms	4332 KB	Output is correct
61	Correct	52 ms	4204 KB	Output is correct
62	Correct	53 ms	4204 KB	Output is correct
63	Correct	52 ms	4204 KB	Output is correct
64	Correct	48 ms	4204 KB	Output is correct
65	Correct	48 ms	4204 KB	Output is correct
66	Correct	52 ms	4332 KB	Output is correct
67	Correct	52 ms	4204 KB	Output is correct
68	Correct	53 ms	4204 KB	Output is correct
69	Correct	52 ms	4204 KB	Output is correct
70	Correct	52 ms	4204 KB	Output is correct
71	Correct	76 ms	4332 KB	Output is correct
72	Correct	72 ms	4204 KB	Output is correct
73	Correct	76 ms	4204 KB	Output is correct
74	Correct	76 ms	4204 KB	Output is correct
75	Correct	76 ms	4188 KB	Output is correct
76	Correct	133 ms	6780 KB	Output is correct
77	Correct	129 ms	6764 KB	Output is correct
78	Correct	122 ms	6764 KB	Output is correct
79	Correct	124 ms	6764 KB	Output is correct
80	Correct	129 ms	9068 KB	Output is correct
81	Correct	144 ms	9196 KB	Output is correct
82	Correct	128 ms	9068 KB	Output is correct
83	Correct	124 ms	9068 KB	Output is correct
84	Correct	127 ms	9068 KB	Output is correct
85	Correct	237 ms	13548 KB	Output is correct
86	Correct	246 ms	13548 KB	Output is correct
87	Correct	250 ms	13548 KB	Output is correct
88	Correct	246 ms	13548 KB	Output is correct
89	Correct	252 ms	13548 KB	Output is correct
90	Correct	240 ms	13548 KB	Output is correct
91	Correct	255 ms	13548 KB	Output is correct
92	Correct	247 ms	13676 KB	Output is correct
93	Correct	239 ms	13676 KB	Output is correct
94	Correct	626 ms	25580 KB	Output is correct
95	Correct	600 ms	25452 KB	Output is correct
96	Correct	597 ms	25324 KB	Output is correct
97	Correct	604 ms	25452 KB	Output is correct
98	Correct	598 ms	25468 KB	Output is correct
99	Correct	594 ms	25348 KB	Output is correct
100	Correct	605 ms	25324 KB	Output is correct

답안 #348392

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