# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
315132 | thtsshz_bgwrswh | Mouse (info1cup19_mouse) | C++17 | 0 ms | 256 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.
#pragma GCC optimize("Ofast")
#include "grader.h"
#include<stdio.h>
#include<algorithm>
#include<assert.h>
using namespace std;
int num[260];
vector<int> temp,temp2;
//int N=5;
//vector<int> target={1,2,3,4,5};
//int query(vector<int> vec){
// int i,cnt=0;
// for(i=0;i<N;i++){
// if(vec[i]==target[i])
// cnt++;
// }
// return cnt;
//}
int Q(int n,int id,int j){
int i,a,b;
for(i=1;i<=n;i++)
if(i!=j){
a=i;
break;
}
// for(i=1;i<=n;i++)
// if(i!=j&&i!=a){
// b=i;
// break;
// }
for(i=0;i<n;i++){
temp[i]=a;
// temp2[i]=b;
}
temp[id]=j;
return query(temp)>=2;
}
void solve(int n){
//assert(n>=3);
int i,j;
temp.resize(n+1);
// temp2.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+1);
for(i=0;i<n;i++)
ans[i]=num[i];
query(ans);
}
//int main(){
// solve(5);
//}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |