oj.uz

Submission #1076955

# Submission time Handle Problem Language Result Execution time Memory
1076955 2024-08-26T19:48:54 Z ArthuroWich Parachute rings (IOI12_rings) C++17
0 / 100
 4000 ms 10328 KB 
#include<bits/stdc++.h>
using namespace std;
vector<int> adj[200005], vis;
int n, ans = 0;
bool f = 1;
void Init(int N_) {
    n = N_;
    ans = n;
}
void dfs(int i, int p, int s) {
    if (vis[i]) {
        f = 0;
        return;
    }
    vis[i] = 1;
    for (int j : adj[i]) {
        if (j == p || j == s) {
            continue;
        }
        dfs(j, i, s);
    }
}
int calc(int a) {
    vis.resize(n, 0);
    f = 1;
    for (int i = 0; i < n; i++) {
        if (i != a && adj[i].size()-count(adj[i].begin(), adj[i].end(), a) > 2) {
            f = 0;
            break;
        }
        if (vis[i] || i == a) {
            continue;
        }
        dfs(i, -1, a);
    }
    vis.clear();
    return f;
}
void Link(int A, int B) {
    adj[A].push_back(B);
    adj[B].push_back(A);
    ans = 0;
    for (int i = 0; i < n; i++) {
        ans += calc(i);
    }
}
int CountCritical() {
    return ans;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4952 KB Output is correct
2 Execution timed out 4029 ms 5212 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Runtime error 6 ms 10328 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4952 KB Output is correct
2 Execution timed out 4029 ms 5212 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4952 KB Output is correct
2 Execution timed out 4029 ms 5212 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4952 KB Output is correct
2 Execution timed out 4029 ms 5212 KB Time limit exceeded
3 Halted 0 ms 0 KB -