Submission #315258

#TimeUsernameProblemLanguageResultExecution timeMemory
315258daniel920712Mouse (info1cup19_mouse)C++14
13 / 100
3065 ms384 KiB
#include <iostream> #include <stdio.h> #include <stdlib.h> #include <algorithm> #include "grader.h" using namespace std; vector < vector < int > > all; vector < int > con; vector < int > how; bool have[500]={0}; vector < int > tt; int N,now=0,t; int cmp(vector < int > a, vector < int > b) { int i; int N=a.size(),con=0; for(i=0;i<N;i++) if(a[i]==b[i]) con++; return con; } bool F(int here) { int ok=1,i,j,xx; //printf("%d\n",now); if(here==N) { /*for(i=0;i<N;i++) printf("%d ",how[i]); printf("\n");*/ //printf("qqqq\n"); for(i=0;i<now;i++) { //printf("qqq %d %d\n",tt[i],con[i]); if(tt[i]!=con[i]) ok=0; } if(ok) { t=query(how); //printf("%d\n",t); all.push_back(how); return 1; } return 0; } for(i=0;i<now;i++) if(tt[i]>con[i]) return 0; for(i=1;i<=N;i++) { if(!have[i]) { how[here]=i; for(j=0;j<now;j++) if(all[j][here]==i) tt[j]++; have[i]=1; xx=F(here+1); //printf("%d %d %d\n",here,i,now); have[i]=0; for(j=0;j<now;j++) if(all[j][here]==i) tt[j]--; if(xx) return 1; } } return 0; } void solve(int N) { ::N=N; how.clear(); all.clear(); con.clear(); tt.clear(); int i,x,ok=1; now=0; t=0; for(i=0;i<N;i++) how.push_back(i+1); while(t!=N) { //printf("aa\n"); for(i=0;i<N;i++) how[i]=i+1; x=0; for(auto i:all) { tt[x]=0; x++; } F(0); //printf("bbbbbb\n"); con.push_back(t); tt.push_back(0); now++; //break; } }

Compilation message (stderr)

mouse.cpp: In function 'void solve(int)':
mouse.cpp:71:13: warning: unused variable 'ok' [-Wunused-variable]
   71 |     int i,x,ok=1;
      |             ^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...