QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#759121 | #9570. Binary Tree | wht11 | TL | 1ms | 5684kb | C++20 | 3.4kb | 2024-11-17 21:50:19 | 2024-11-17 21:50:22 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
using PII = pair<int, int>;
#define endl "\n"
const int N = 2e5 + 5;
vector<int> G[N];
int siz[N], f[N], vis[N], cnt[N];
int lst = 0;
int mid = 0;
void dfs(int u, int fa)
{
f[u] = fa;
siz[u] = 1;
int flag = 1;
for (auto v : G[u])
{
if (v == fa || vis[v])
continue;
dfs(v, u);
if (siz[v] > lst / 2)
flag = 0;
siz[u] += siz[v];
}
if (vis[u])
return;
if (lst - siz[u] > lst / 2)
flag = 0;
if (flag)
mid = u;
}
void solve()
{
int n;
cin >> n;
for (int i = 1; i <= n; i++)
{
G[i].clear();
vis[i] = 0;
f[i] = 0;
siz[i] = 0;
}
for (int i = 1; i <= n; i++)
{
int u, v;
cin >> u >> v;
if (v)
{
G[i].push_back(v);
G[v].push_back(i);
}
if (u)
{
G[i].push_back(u);
G[u].push_back(i);
}
}
lst = n;
int rt = 1;
mid = 0;
while (1)
{
int x;
mid = rt;
dfs(rt,0);
lst=siz[rt];
dfs(rt, 0);
// cerr << "mid " << mid << endl;
vector<pair<int, int>> ve;
for (auto v : G[mid])
{
if (vis[v])
continue;
if (v == f[mid])
ve.emplace_back(lst - siz[mid], v);
else
ve.emplace_back(siz[v], v);
}
sort(ve.begin(), ve.end(), greater<pair<int, int>>());
if (ve.size() == 3)
{
cout << "? " << ve[0].second << " " << ve[1].second << endl;
cout.flush();
cin >> x;
if (x == 0)
{
vis[mid]=1;
rt = ve[0].second;
}
else if (x == 1)
{
vis[ve[0].second] = 1;
vis[ve[1].second] = 1;
rt=mid;
}
else
{
vis[mid]=1;
rt = ve[1].second;
}
}
else if (ve.size() == 2)
{
cout << "? " << ve[0].second << " " << ve[1].second << endl;
cout.flush();
cin >> x;
if (x == 0)
{
vis[mid] = 1;
rt = ve[0].second;
}
else if (x == 1)
{
cout << "! " << mid << endl;
return;
}
else
{
vis[mid] = 1;
rt = ve[1].second;
}
}
else if (ve.size() == 1)
{
cout << "? " << mid << " " << ve[0].second << endl;
cout.flush();
cin >> x;
if (x == 0)
{
cout << "! " << mid << endl;
cout.flush();
}
else
{
cout << "! " << ve[0].second << endl;
cout.flush();
}
return;
}
else
{
cout << "! " << rt << endl;
cout.flush();
return;
}
}
}
signed main()
{
IOS;
int t = 1;
cin >> t;
while (t--)
{
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 5684kb
input:
2 5 0 0 1 5 2 4 0 0 0 0 1 0 2 0 2 0 0 2
output:
? 3 5 ? 2 1 ! 2 ? 1 2 ! 2
result:
ok OK (2 test cases)
Test #2:
score: -100
Time Limit Exceeded
input:
5555 8 2 0 8 6 0 0 3 0 0 0 7 0 0 0 5 4 0 0 2 8 0 0 1 4 2 0 0 0 7 8 0 0 3 0 6 0 0 0 0 8 5 8 0 0 1 7 0 0 0 0 4 2 0 0 6 0 0 1 2 5 4 5 3 1 0 0 0 0 0 0 0 2 8 0 0 0 0 5 6 0 0 1 4 2 0 3 8 0 0 0 0 5 3 0 5 1 0 0 0 0 4 0 0 2 5 5 0 0 0 0 0 3 0 2 4 0 0 3 3 0 1 0 0 0 2 2 2 0 0 0 0 3 2 3 0 0 0 0 2 10 2 8 9 7 0 0 ...
output:
? 8 6 ? 4 5 ? 4 3 ! 3 ? 7 2 ? 8 7 ? 8 6 ! 8 ? 8 3 ? 8 4 ? 6 2 ! 2 ? 2 5 ? 2 3 ! 3 ? 5 7 ? 4 1 ! 4 ? 5 1 ? 5 4 ! 4 ? 4 2 ? 4 3 ! 4 ? 3 2 ! 2 ? 1 2 ! 1 ? 3 2 ! 2 ? 7 9 ? 7 4 ? 6 3 ! 3 ? 1 2 ! 1 ? 9 5 ? 2 1 ? 2 6 ! 2 ? 10 3 ? 8 6 ? 4 2 ! 4 ? 9 3 ? 9 7 ? 2 1 ! 2 ? 1 2 ! 2 ? 4 3 ? 7 1 ! 1 ? 4 9 ? 8 4 ? 8...