1a:I[10086,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"AdSenseInsert"] 1b:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"CodeViewer"] 1c:T688,#include using namespace std; const int MX = 1e6+1; pair arr[MX]; int ans[MX]; vector> adj[MX]; // edge no, to where bool used[MX], seen[MX]; void go(int s, int t) { //printf("letting edge %d to use node %d\n", s, t); ans[s] = t; if(used[t]) { cout << "-1\n"; exit(0); } used[t] = 1; } void dfs(int u, int e, int par) { if(seen[u]) return; //printf("enter u=%d\n", u); //if(par != -1) printf("dfs used edge %d->%d. edge number is %d\n", par, u, e); seen[u] = 1; for(auto pr: adj[u]) { int i, v; tie(i, v) = pr; dfs(v, i, u); } if(e != -1) { if(!used[u]) go(e, u); else go(e, par); } for(auto pr: adj[u]) { if(pr.second == par || ans[pr.first] != 0x3f3f3f3f) continue; if(!used[u]) go(pr.first,u); else go(pr.first,pr.second); } //printf("exit u=%d\n", u); } int main() { ios::sync_with_stdio(0);cin.tie(0); memset(ans, 0x3f, sizeof ans); int n; cin >> n; map,int> mp; for(int i=0; i> arr[i].first >> arr[i].second; if(arr[i].first > arr[i].second) swap(arr[i].first, arr[i].second); else if(arr[i].first == arr[i].second) { go(i, arr[i].first); continue; } if(mp.count(arr[i])) { go(mp[arr[i]], arr[i].first); go(i, arr[i].second); mp[arr[i]] = -1; } else { mp[arr[i]] = i; } } for(int i=1; i

코드 #6018