# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
935717 | 2024-02-29T12:23:02 Z | dilanyan | Logičari (COCI21_logicari) | C++17 | 23 ms | 9444 KB |
//-------------dilanyan------------\\ #define _CRT_SECURE_NO_WARNINGS #include<bits/stdc++.h> #include<stdio.h> using namespace std; //------------------Kargpefines--------------------\\ #define ll long long #define pb push_back #define all(u) (u).begin(), (u).end() #define pqueue priority_queue #define upper upper_bound #define lower lower_bound #define umap unordered_map #define uset unordered_set void KarginSet(string name = "") { ios_base::sync_with_stdio(false); cin.tie(NULL); if (name.size()) { freopen((name + ".in").c_str(), "r", stdin); freopen((name + ".out").c_str(), "w", stdout); } } //-------------------KarginConstants------------------\\ const ll mod = 1000000007; const ll inf = 1e9; //-------------------KarginCode-----------------------\\ const int N = 200005; vector<int> g[N]; void KarginSolve() { int n; cin >> n; for (int i = 0; i < n;i++) { int u, v; cin >> u >> v; g[u].pb(v), g[v].pb(u); } int s = 0; for (int i = 1;i <= n;i++) { if (g[i].size() == 2) s++; } if (s == n) { if (n & 1) cout << -1 << '\n'; else if ((n / 2) & 1) cout << -1 << '\n'; else cout << n / 2 << '\n'; } } int main() { KarginSet(); int test = 1; //cin >> test; while (test--) { KarginSolve(); } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 4956 KB | Output is correct |
2 | Correct | 1 ms | 4956 KB | Output is correct |
3 | Correct | 1 ms | 4956 KB | Output is correct |
4 | Correct | 1 ms | 4956 KB | Output is correct |
5 | Correct | 22 ms | 9384 KB | Output is correct |
6 | Correct | 22 ms | 9444 KB | Output is correct |
7 | Correct | 21 ms | 9268 KB | Output is correct |
8 | Correct | 23 ms | 9308 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 4956 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 4956 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 4956 KB | Output is correct |
2 | Correct | 1 ms | 4956 KB | Output is correct |
3 | Correct | 1 ms | 4956 KB | Output is correct |
4 | Correct | 1 ms | 4956 KB | Output is correct |
5 | Correct | 22 ms | 9384 KB | Output is correct |
6 | Correct | 22 ms | 9444 KB | Output is correct |
7 | Correct | 21 ms | 9268 KB | Output is correct |
8 | Correct | 23 ms | 9308 KB | Output is correct |
9 | Incorrect | 1 ms | 4956 KB | Output isn't correct |
10 | Halted | 0 ms | 0 KB | - |