oj.uz

답안 #784148

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
784148 2023-07-15T18:50:55 Z serifefedartar Logičari (COCI21_logicari) C++17
10 / 110
 27 ms 7304 KB 
#include <bits/stdc++.h>
using namespace std;

#define fast ios::sync_with_stdio(0);cin.tie(0);
typedef long long ll;
#define f first
#define s second
#define MAXN 100005

vector<vector<int>> graph;
int main() {
    fast
    int n;
    cin >> n;

    graph = vector<vector<int>>(n+1, vector<int>(0));
    int deg[n+1];
    memset(deg, 0, sizeof(deg));
    for (int i = 0; i < n; i++) {
        int u, v;
        cin >> u >> v;
        graph[u].push_back(v);
        graph[v].push_back(u);
        deg[u]++;
        deg[v]++;
    }

    bool control = true;
    for (int i = 1; i <= n; i++)
        if (deg[i] != 2)
            control = false;

    if (control) {
        if (n % 4 == 0)
            cout << n / 2 << endl;
        else
            cout << -1 << endl;
    }
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 22 ms 7248 KB Output is correct
6 Correct 27 ms 7224 KB Output is correct
7 Correct 23 ms 7304 KB Output is correct
8 Correct 22 ms 7240 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 22 ms 7248 KB Output is correct
6 Correct 27 ms 7224 KB Output is correct
7 Correct 23 ms 7304 KB Output is correct
8 Correct 22 ms 7240 KB Output is correct
9 Incorrect 0 ms 212 KB Output isn't correct
10 Halted 0 ms 0 KB -