# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
904839 | simona1230 | Love Polygon (BOI18_polygon) | C++17 | 210 ms | 11576 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int n,names=1;
map<string,int> mp;
int nxt[100001],in[100001];
void read()
{
cin>>n;
for(int i=1; i<=n; i++)
{
string a,b;
cin>>a>>b;
if(!mp[a])mp[a]=names++;
if(!mp[b])mp[b]=names++;
nxt[mp[a]]=mp[b];
in[mp[b]]++;
if(a==b)nxt[mp[a]]=0;
}
if(n%2==1)
{
cout<<"-1"<<endl;
exit(0);
}
}
int used[100001];
queue<int> q;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |