Kuroni and the Celebration----------------------------------思维(交互题)

This is an interactive problem.

After getting AC after 13 Time Limit Exceeded verdicts on a geometry problem, Kuroni went to an Italian restaurant to celebrate this holy achievement. Unfortunately, the excess sauce disoriented him, and he’s now lost!

The United States of America can be modeled as a tree (why though) with n vertices. The tree is rooted at vertex r, wherein lies Kuroni’s hotel.

Kuroni has a phone app designed to help him in such emergency cases. To use the app, he has to input two vertices u and v, and it’ll return a vertex w, which is the lowest common ancestor of those two vertices.

However, since the phone’s battery has been almost drained out from live-streaming Kuroni’s celebration party, he could only use the app at most ⌊n2⌋ times. After that, the phone would die and there will be nothing left to help our dear friend! 😦

As the night is cold and dark, Kuroni needs to get back, so that he can reunite with his comfy bed and pillow(s). Can you help him figure out his hotel’s location?

Interaction
The interaction starts with reading a single integer n (2≤n≤1000), the number of vertices of the tree.

Then you will read n−1 lines, the i-th of them has two integers xi and yi (1≤xi,yi≤n, xi≠yi), denoting there is an edge connecting vertices xi and yi. It is guaranteed that the edges will form a tree.

Then you can make queries of type “? u v” (1≤u,v≤n) to find the lowest common ancestor of vertex u and v.

After the query, read the result w as an integer.

In case your query is invalid or you asked more than ⌊n2⌋ queries, the program will print −1 and will finish interaction. You will receive a Wrong answer verdict. Make sure to exit immediately to avoid getting other verdicts.

When you find out the vertex r, print “! r” and quit after that. This query does not count towards the ⌊n2⌋ limit.

Note that the tree is fixed beforehand and will not change during the queries, i.e. the interactor is not adaptive.

After printing any query do not forget to print end of line and flush the output. Otherwise, you might get Idleness limit exceeded. To do this, use:

fflush(stdout) or cout.flush() in C++;
System.out.flush() in Java;
flush(output) in Pascal;
stdout.flush() in Python;
see the documentation for other languages.
Hacks

To hack, use the following format:

The first line should contain two integers n and r (2≤n≤1000, 1≤r≤n), denoting the number of vertices and the vertex with Kuroni’s hotel.

The i-th of the next n−1 lines should contain two integers xi and yi (1≤xi,yi≤n) — denoting there is an edge connecting vertex xi and yi.

The edges presented should form a tree.

Example
inputCopy
6
1 4
4 2
5 3
6 3
2 3

3

4

4

outputCopy

? 5 6

? 3 1

? 1 2

! 4
Note
Note that the example interaction contains extra empty lines so that it’s easier to read. The real interaction doesn’t contain any empty lines and you shouldn’t print any extra empty lines as well.

The image below demonstrates the tree in the sample test:

题意:
给定n个点，n-1条边，每次向系统询问两个点，它会告诉你两点的lca
最多询问[n/2]次

解析:
首先我们可以从叶子节点出手。假设存在两个叶子节点(u,v) 如果lca(u,v)==u或着lca(u,v)==v 那么一定可以确定根，根就是lca(u,v)。
第一步: 我们在建边的时候，记录每个节点的度。
第二步: 把度为1的依次加入到队列中
第三步: 如果队列中的lca(u,v)既不等于u，又不等于v,那么就删除这两个节点，更新和他们有关联的边。再回到第二步

注意: 如果队列中只剩下一个，那么这一定是根

#include<bits/stdc++.h>
using namespace std;
const int N=2e5+1000;
vector<int> G[N];
int d[N];
int n;
int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n-1;i++)
	{
		int a,b;
		scanf("%d %d",&a,&b);
		G[a].push_back(b);G[b].push_back(a);
		d[a]++;d[b]++;
	}
	queue<int> q;
	for(int i=1;i<=n;i++)
	{
		if(d[i]==1) q.push(i);
	}
	int ans=-1;
	while(q.size()>1)
	{
		int u=q.front();q.pop();
		int v=q.front();q.pop();
		printf("? %d %d\n",u,v);
		fflush(stdout);//用来清空输出缓存区的
		int lca;
		scanf("%d",&lca);
		if(lca==u||lca==v)
		{
			printf("! %d\n",lca);
			return 0;
		}
		for(int i=0;i<G[u].size();i++)
		{
			int j=G[u][i];
			d[j]--;
			if(d[j]==1) q.push(j);
		}
		for(int i=0;i<G[v].size();i++)
		{
			int j=G[v][i];
			d[j]--;
			if(d[j]==1) q.push(j);
		}
	}
	if(ans=-1) ans=q.front();
	printf("! %d\n",ans);
}