# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
825340 | QwertyPi | Love Polygon (BOI18_polygon) | C++14 | 306 ms | 43264 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;
const int MAXN = 1e5 + 11;
struct edge{
int u, v;
};
int p[MAXN];
set<int> G[MAXN];
bool done[MAXN];
template<class T>
using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
int32_t main(){
set<string> S; map<string, int> mp;
int n; cin >> n;
if(n % 2 == 1){
cout << -1 << endl;
return 0;
}
vector<pair<string, string>> ES;
vector<edge> E;
for(int i = 0; i < n; i++){
string s, t; cin >> s >> t; S.insert(s); S.insert(t);
ES.push_back({s, t});
}
int id = 0; for(auto i : S) mp[i] = id++;
for(int i = 0; i < n; i++){
E.push_back({mp[ES[i].first], mp[ES[i].second]});
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... |