| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 395286 | syl123456 | Fun Tour (APIO20_fun) | C++17 | 0 ms | 0 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 "fun.h"
#include <bits/stdc++.h>
#define all(i) (i).begin(), (i).end()
using namespace std;
typedef pair<int, int> pi;
typedef pair<int, pi> pp;
const int inf = 1 << 30;
template<typename T>
ostream& operator << (ostream &i, vector<T> j) {
i << '{';
for (auto ii : j) i << ii << ' ';
return i << '}';
}
int hoursRequired(int x, int xx) {int xxx;cout << "dis " << x << ' ' << xx << endl;cin >> xxx;return xxx;}
int attractionsBehind(int x, int xx) {int xxx;cout << "sz " << x << ' ' << xx << endl;cin >> xxx;return xxx;}
std::vector<int> createFunTour(int N, int Q) {
vector<int> dep(N), sz(N);
dep[0] = 0, sz[0] = N;
int cen = 0;
for (int i = 1; i < N; ++i) {
dep[i] = hoursRequired(0, i);
sz[i] = attractionsBehind(0, i);
if (dep[i] > dep[cen] && sz[i] > N / 2) cen = i;
}
vector<int> v[3], ch;
if (cen != 0) for (int i = 0; i < N; ++i) dep[i] = i == cen ? 0 : hoursRequired(cen, i);
for (int i = 0; i < N; ++i) if (dep[i] == 1) ch.push_back(i);
for (int j = 0; j < ch.size(); ++j) v[j].push_back(ch[j]);
for (int i = 0; i < N; ++i) if (dep[i] > 1) {
bool b = false;
for (int j = 0; j < ch.size() - 1; ++j) if (dep[i] == 1 + hoursRequired(ch[j], i)) {
v[j].push_back(i);
b = true;
break;
}
if (!b) v[ch.size() - 1].push_back(i);
}
for (int i = 0; i < 3; ++i) sort(all(v[i]), [&](int x, int y) {
return dep[x] < dep[y];
});
vector<int> ans;
int pre = -1;
for (int i = 0; i < N - 1; ++i) {
int tmp = -1;
for (int j = 0; j < 3; ++j) if (j != pre && !v[j].empty() && (tmp == -1 || dep[v[j].back()] > dep[v[tmp].back()]))
tmp = j;
ans.push_back(v[tmp].back());
v[tmp].pop_back();
pre = tmp;
}
ans.push_back(cen);
return ans;
}