QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#667340#9484. Colored Complete GraphwallcrackWA 1ms3588kbC++20968b2024-10-22 22:17:172024-10-22 22:17:27

Judging History

This is the latest submission verdict.

  • [2024-10-22 22:17:27]
  • Judged
  • Verdict: WA
  • Time: 1ms
  • Memory: 3588kb
  • [2024-10-22 22:17:17]
  • Submitted

answer

#include<bits/stdc++.h>
using namespace std;
int query(int u,int v)
{
	cout<<endl;
	cout<<"? "<<u<<" "<<v<<endl;
	char res;
	cin>>res;
	return res=='R';
}
void answer(vector<pair<int,int>> &edge)
{
	cout<<"!"<<endl;
	for(auto [u,v]:edge)
		cout<<u<<" "<<v<<endl;
}
int main()
{
	int n;
	cin>>n;
	vector<pair<int,int>> blueEdge,redEdge;
	vector<int>bluePoint,redPoint;
	for(int i=2;i<=n;i++)
	{
		int res=query(1,i);
		if(res)
		{
			redEdge.push_back(make_pair(1,i));
			redPoint.push_back(i);
		}
		else 
		{
			blueEdge.push_back(make_pair(1,i));
			bluePoint.push_back(i);
		}
	}
	for(int i=0,j=0;i<redPoint.size() and j<bluePoint.size();)
	{
		int u=redPoint[i],v=bluePoint[j];
		int res=query(u,v);
		if(res)
		{
			redEdge.push_back(make_pair(u,v));
			j++;
		}
		else 
		{
			blueEdge.push_back(make_pair(u,v));
			i++;
		}
	}
	if(blueEdge.size()>=n-1)answer(blueEdge);
	else answer(redEdge);
	return 0;
}

详细

Test #1:

score: 0
Wrong Answer
time: 1ms
memory: 3588kb

input:

3

output:


? 1 2

result:

wrong answer invalid question