Submission #1249154

#TimeUsernameProblemLanguageResultExecution timeMemory
1249154al95ireyizLogičari (COCI21_logicari)C++20
10 / 110
23 ms8264 KiB
//*** Bismillah ***// #pragma GCC optimize("O3", "fast-math", "unroll-loops", "no-stack-protector") #include <bits/stdc++.h> using namespace std; #if !defined(ONLINE_JUDGE) and !defined(EVAL) #include "template/debug.h" #else #define d(x...) #endif #define fr first #define er erase #define sc second #define in insert #define ll long long #define pb push_back #define vll vector<ll> #define pll pair<ll,ll> #define ull unsigned ll #define vpll vector<pll> #define len(x) (ll) x.size() #define all(x) x.begin(),x.end() const ll INF = 1e9; const ll INFL = 1e18; const ll MOD = 1e9+7; // const ll MOD = 998244353; const ll maxn = 2e5+5; ll n,m,k=0; vll g[maxn]; void _(ll &tt){ cin >> n; for(ll i = 1, a, b; i <= n; i ++){ cin >> a >> b; g[a].pb(b); g[b].pb(a); } ll leaf = -1; for(ll i = 1; i <= n; i ++){ if(len(g[i]) == 1){ leaf = i; break; } } if(leaf == -1){ cout << (n % 4 == 0 ? n / 2 : -1) << '\n'; return; } // 10 balliq hell } signed main() { ll tm = clock(); cin.tie(0)->sync_with_stdio(0); ll t = 1; // cin >> t; for(ll tt = 1; tt <= t; tt ++) { _(tt); } cerr << "\n\033[1;31mTime: \033[1;30m" \ << (double)(clock()-tm)/1000000 << "\033[1;32m seconds\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...