# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
397397 | KoD | Love Polygon (BOI18_polygon) | C++17 | 233 ms | 14508 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>
template <class T>
using Vec = std::vector<T>;
int main() {
int N;
std::cin >> N;
if (N % 2 == 1) {
std::cout << -1 << '\n';
return 0;
}
Vec<int> to(N);
{
Vec<std::string> U(N), V(N);
for (int i = 0; i < N; ++i) {
std::cin >> U[i] >> V[i];
}
auto cmp = U;
std::sort(cmp.begin(), cmp.end());
for (int i = 0; i < N; ++i) {
const int u = std::lower_bound(cmp.cbegin(), cmp.cend(), U[i]) - cmp.cbegin();
const int v = std::lower_bound(cmp.cbegin(), cmp.cend(), V[i]) - cmp.cbegin();
to[u] = v;
}
}
Vec<int> deg(N);
for (int i = 0; i < N; ++i) {
deg[to[i]] += 1;
}
# | 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... |