Submission #658405

#TimeUsernameProblemLanguageResultExecution timeMemory
658405FoxyyLogičari (COCI21_logicari)C++17
10 / 110
41 ms6036 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define Foxyy cin.tie(0); cout.sync_with_stdio(0); cout.tie(0); struct Solver { int& n; vector<vector<int>>& adj; void solve() { if (n % 4 != 0) { cout << "-1\n"; return; } cout << n/2 << '\n'; } }; signed main() { Foxyy int T = 1; // cin >> T; while(T--) { int n; cin >> n; vector<vector<int>> adj(n); for (int i = 0; i < n; i++) { int a, b; cin >> a >> b; a--, b--; adj[a].push_back(b); adj[b].push_back(a); } Solver solver{n, adj}; solver.solve(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...