제출 #716508

#제출 시각아이디문제언어결과실행 시간메모리
716508ajab_01Love Polygon (BOI18_polygon)C++17
0 / 100
205 ms13740 KiB
#include<bits/stdc++.h> using namespace std; const int N = 1e5 + 5; vector<int> g[N]; map<string , int> mp; int ans , n , num; bool deg[N] , vis[N] , ch = 1; int main(){ ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> n; for(int i = 0 ; i < n ; i++){ string a , b; cin >> a >> b; if(mp.find(a) == mp.end()) mp[a] = num++; if(mp.find(b) == mp.end()) mp[b] = num++; g[mp[a]].push_back(mp[b]); deg[mp[b]] = 1; } if(n & 1){ cout << -1 << '\n'; return 0; } for(int i = 0 ; i < n ; i++) ch &= deg[i]; if(ch){ vector<int> vec; for(int i = 1 ; i <= n ; i++){ int len = 0 , ver = i; while(!vis[ver]){ len++; vis[ver] = 1; ver = g[ver][0]; } if(len == 2) continue; vec.push_back(len); } int cnt = 0; for(int i : vec){ ans += i / 2; if(i & 1) cnt++; } ans += cnt - 1; cout << ans << '\n'; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...