oj.uz

Submission #959687

# Submission time Handle Problem Language Result Execution time Memory
959687 2024-04-08T18:45:18 Z vjudge1 Game (IOI14_game) C++17
42 / 100
 1000 ms 11344 KB 
#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math,inline")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,lzcnt,mmx,abm,avx,avx2,fma")
#include "game.h"
#include <bits/stdc++.h>
using namespace std;
 
const int N = 1500;
 
int n, sum, deg[N], cnt[N];
unordered_set<int> vis, adj[N];
 
void dfs(int x) {
    vis.insert(x);
 
    sum++;

    for (int y : adj[x]) {
        if (vis.find(y) != vis.end()) continue;
 
        dfs(y);
    }
}
 
void initialize(int NN) {
    n = NN;
 
    memset(cnt, 0, sizeof(cnt));
    for (int i = 0; i < n; i++) {
        deg[i] = n;
        cnt[n]++;
    }
 
    for (int i = 0; i < n; i++) {
        for (int j = i+1; j < n; j++) {
            adj[i].insert(j);
            adj[j].insert(i);
        }
    }
}
 
int hasEdge(int u, int v) {
    adj[u].erase(v);
    adj[v].erase(u);
 
    deg[u]--;
    deg[v]--;

    cnt[deg[u]]++;
    cnt[deg[v]]++;

    if (cnt[deg[u]] >= deg[u]) {
        vis.clear();
        sum = 0;
        dfs(u);
        if (sum < n) {
            cnt[deg[u]]--;
            cnt[deg[v]]--;

            deg[u]++;
            deg[v]++;

            adj[u].insert(v);
            adj[v].insert(u);

            return 1;
        }
    }
 
    if (cnt[deg[v]] >= deg[v]) {
        vis.clear();
        sum = 0;
        dfs(v);
        if (sum < n) {
            cnt[deg[u]]--;
            cnt[deg[v]]--;

            deg[u]++;
            deg[v]++;

            adj[u].insert(v);
            adj[v].insert(u);

            return 1;
        }
    }
 
    return 0;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 600 KB Output is correct
24 Correct 0 ms 348 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 2 ms 348 KB Output is correct
26 Correct 2 ms 348 KB Output is correct
27 Correct 2 ms 348 KB Output is correct
28 Correct 2 ms 348 KB Output is correct
29 Correct 2 ms 348 KB Output is correct
30 Correct 2 ms 344 KB Output is correct
31 Correct 2 ms 348 KB Output is correct
32 Correct 2 ms 592 KB Output is correct
33 Correct 2 ms 592 KB Output is correct
34 Correct 38 ms 820 KB Output is correct
35 Correct 39 ms 604 KB Output is correct
36 Correct 45 ms 824 KB Output is correct
37 Correct 39 ms 840 KB Output is correct
38 Correct 38 ms 600 KB Output is correct
39 Correct 40 ms 824 KB Output is correct
40 Correct 38 ms 600 KB Output is correct
41 Correct 39 ms 600 KB Output is correct
42 Correct 39 ms 604 KB Output is correct
43 Correct 35 ms 604 KB Output is correct
44 Correct 33 ms 832 KB Output is correct
45 Correct 37 ms 604 KB Output is correct
46 Correct 37 ms 604 KB Output is correct
47 Correct 38 ms 600 KB Output is correct
48 Correct 35 ms 856 KB Output is correct
49 Correct 42 ms 844 KB Output is correct
50 Correct 38 ms 844 KB Output is correct
51 Correct 38 ms 604 KB Output is correct
52 Correct 37 ms 836 KB Output is correct
53 Correct 37 ms 604 KB Output is correct
54 Correct 38 ms 604 KB Output is correct

Subtask #3
0 / 58.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 532 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 360 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 3 ms 348 KB Output is correct
26 Correct 2 ms 348 KB Output is correct
27 Correct 2 ms 348 KB Output is correct
28 Correct 2 ms 348 KB Output is correct
29 Correct 2 ms 348 KB Output is correct
30 Correct 2 ms 348 KB Output is correct
31 Correct 2 ms 348 KB Output is correct
32 Correct 2 ms 344 KB Output is correct
33 Correct 2 ms 344 KB Output is correct
34 Correct 39 ms 604 KB Output is correct
35 Correct 40 ms 600 KB Output is correct
36 Correct 39 ms 804 KB Output is correct
37 Correct 39 ms 604 KB Output is correct
38 Correct 38 ms 840 KB Output is correct
39 Correct 44 ms 836 KB Output is correct
40 Correct 38 ms 604 KB Output is correct
41 Correct 40 ms 600 KB Output is correct
42 Correct 39 ms 600 KB Output is correct
43 Correct 36 ms 604 KB Output is correct
44 Correct 33 ms 604 KB Output is correct
45 Correct 38 ms 836 KB Output is correct
46 Correct 37 ms 604 KB Output is correct
47 Correct 36 ms 600 KB Output is correct
48 Correct 35 ms 604 KB Output is correct
49 Correct 37 ms 600 KB Output is correct
50 Correct 43 ms 604 KB Output is correct
51 Correct 39 ms 844 KB Output is correct
52 Correct 37 ms 604 KB Output is correct
53 Correct 37 ms 836 KB Output is correct
54 Correct 40 ms 820 KB Output is correct
55 Execution timed out 1006 ms 11344 KB Time limit exceeded
56 Halted 0 ms 0 KB -