oj.uz

답안 #1008998

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1008998 2024-06-27T07:41:34 Z SulA 낙하산 고리들 (IOI12_rings) C++17
0 / 100
 4000 ms 30932 KB 
#include <vector>
using namespace std;
vector<vector<int>> adj;
vector<int> degree;
int n;

void Init(int N_) {
    n = N_;
    adj.resize(n, vector<int>{});
    degree.resize(n, 0);
}

void Link(int u, int v) {
    adj[u].push_back(v);
    adj[v].push_back(u);
    degree[u]++, degree[v]++;
}

int CountCritical() {
    int cnt = 0;
    for (int u = 0; u < n; u++) {
        // trying to remove node u
        for (int v : adj[u]) {
            degree[v]--;
        }
        bool isCritical = true;
        for (int v = 0; v < n; v++) {
            if (v == u) continue;
            isCritical &= degree[v] <= 2;
        }
        cnt += isCritical;
        for (int v : adj[u]) {
            degree[v]++;
        }
    }
    return cnt;
}

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 8 ms 708 KB Output is correct
3 Correct 14 ms 808 KB Output is correct
4 Incorrect 1 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4006 ms 30932 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 8 ms 708 KB Output is correct
3 Correct 14 ms 808 KB Output is correct
4 Incorrect 1 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 8 ms 708 KB Output is correct
3 Correct 14 ms 808 KB Output is correct
4 Incorrect 1 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 8 ms 708 KB Output is correct
3 Correct 14 ms 808 KB Output is correct
4 Incorrect 1 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -