Submission #1026895

#TimeUsernameProblemLanguageResultExecution timeMemory
102689512345678Love Polygon (BOI18_polygon)C++17
0 / 100
2056 ms16988 KiB
#include <bits/stdc++.h> using namespace std; const int nx=1e5+5; int n, t, vs[nx], l[nx], res, cnt; string su[nx], sv[nx]; map<string, int> mp; int main() { cin.tie(NULL)->sync_with_stdio(false); cin>>n; for (int i=1; i<=n; i++) cin>>su[i]>>sv[i], mp[su[i]]=mp[sv[i]]=0; if (n%2) return cout<<-1, 0; for (auto &[x, y]:mp) y=++t; for (int i=1; i<=n; i++) l[mp[su[i]]]=mp[sv[i]]; for (int i=1; i<=n; i++) { if (vs[i]) continue; int sz=1, tmp=i; vs[i]=1; while (l[tmp]!=i) sz++, tmp=l[tmp], vs[tmp]=1; if (sz==2) continue; res+=sz/2; if (sz%2) cnt++; } res+=cnt/2; cout<<res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...