Submission #315083

#	Time	Username	Problem	Language	Result	Execution time	Memory
315083		thtsshz_bgwrswh	Mouse (info1cup19_mouse)	C++17	0 / 100	0 ms	384 KiB

mouse

#pragma GCC optimize("Ofast")
#include "grader.h"
#include<stdio.h>
#include<algorithm>
using namespace std;
int num[260];
vector<int> temp;
int Q(int n,int id,int j){	
	int i;
	for(i=0;i<n;i++)
		temp[i]=0;
	temp[id]=j;
	return query(temp);
}
void solve(int n){
	int i,j;
	temp.resize(n+1);
	for(i=0;i<n;i++)
		for(j=1;j<=n;j++){
			if(Q(n,i,j)){
				num[i]=j;
				break;
			}
		}
	vector<int> ans(n);
	for(i=0;i<n;i++)
		ans[i]=num[i];
	query(ans);
}

• Subtask 1: 0 / 13
• Subtask 2: 0 / 38
• Subtask 3: 0 / 49