# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
315497 | 2020-10-23T01:32:11 Z | daniel920712 | Mouse (info1cup19_mouse) | C++14 | 2279 ms | 131080 KB |
#include <iostream> #include <stdio.h> #include <stdlib.h> #include <algorithm> #include "grader.h" using namespace std; vector < int > how; bool have[500]={0}; map < vector < int > , int > all; int Query(vector < int > tt) { if(all.find(tt)==all.end()) all[tt]=query(tt); return all[tt]; } void solve(int N) { int a,b,c,now,i,j,k,ok; how.clear(); for(i=0;i<N;i++) { how.push_back(i+1); have[i+1]=0; } for(i=0;i<N;i++) { for(j=1;j<=N;j++) { if(!have[j]) { how[i]=j; now=0; for(k=1;k<=N;k++) { if(!have[k]&&k!=j) { how[i+now+1]=k; now++; } } } a=Query(how); if(a==N) return; if(i==0) { ok=1; for(k=i+1;k<N;k++) { swap(how[i],how[k]); b=Query(how); if(b==N) return; swap(how[i],how[k]); if(a>b) continue; else { ok=0; break; } } if(ok) { have[how[i]]=1; break; } } else { swap(how[i],how[0]); b=Query(how); if(b==N) return; swap(how[i],how[0]); if(a-b==2) { have[how[i]]=1; break; } } } } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 256 KB | Correct! Number of queries: 25 |
2 | Correct | 0 ms | 256 KB | Correct! Number of queries: 11 |
3 | Correct | 1 ms | 256 KB | Correct! Number of queries: 23 |
4 | Correct | 1 ms | 256 KB | Correct! Number of queries: 39 |
5 | Correct | 1 ms | 256 KB | Correct! Number of queries: 33 |
6 | Correct | 1 ms | 256 KB | Correct! Number of queries: 23 |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 256 KB | Correct! Number of queries: 25 |
2 | Correct | 0 ms | 256 KB | Correct! Number of queries: 11 |
3 | Correct | 1 ms | 256 KB | Correct! Number of queries: 23 |
4 | Correct | 1 ms | 256 KB | Correct! Number of queries: 39 |
5 | Correct | 1 ms | 256 KB | Correct! Number of queries: 33 |
6 | Correct | 1 ms | 256 KB | Correct! Number of queries: 23 |
7 | Correct | 28 ms | 632 KB | Correct! Number of queries: 1300 |
8 | Correct | 28 ms | 760 KB | Correct! Number of queries: 1500 |
9 | Correct | 18 ms | 632 KB | Correct! Number of queries: 1100 |
10 | Correct | 23 ms | 632 KB | Correct! Number of queries: 1300 |
11 | Correct | 16 ms | 512 KB | Correct! Number of queries: 1000 |
12 | Correct | 23 ms | 632 KB | Correct! Number of queries: 1300 |
13 | Correct | 20 ms | 632 KB | Correct! Number of queries: 1200 |
14 | Correct | 27 ms | 760 KB | Correct! Number of queries: 1600 |
15 | Correct | 26 ms | 760 KB | Correct! Number of queries: 1500 |
16 | Correct | 31 ms | 632 KB | Correct! Number of queries: 1400 |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 256 KB | Correct! Number of queries: 25 |
2 | Correct | 0 ms | 256 KB | Correct! Number of queries: 11 |
3 | Correct | 1 ms | 256 KB | Correct! Number of queries: 23 |
4 | Correct | 1 ms | 256 KB | Correct! Number of queries: 39 |
5 | Correct | 1 ms | 256 KB | Correct! Number of queries: 33 |
6 | Correct | 1 ms | 256 KB | Correct! Number of queries: 23 |
7 | Correct | 28 ms | 632 KB | Correct! Number of queries: 1300 |
8 | Correct | 28 ms | 760 KB | Correct! Number of queries: 1500 |
9 | Correct | 18 ms | 632 KB | Correct! Number of queries: 1100 |
10 | Correct | 23 ms | 632 KB | Correct! Number of queries: 1300 |
11 | Correct | 16 ms | 512 KB | Correct! Number of queries: 1000 |
12 | Correct | 23 ms | 632 KB | Correct! Number of queries: 1300 |
13 | Correct | 20 ms | 632 KB | Correct! Number of queries: 1200 |
14 | Correct | 27 ms | 760 KB | Correct! Number of queries: 1600 |
15 | Correct | 26 ms | 760 KB | Correct! Number of queries: 1500 |
16 | Correct | 31 ms | 632 KB | Correct! Number of queries: 1400 |
17 | Runtime error | 2279 ms | 131080 KB | Execution killed with signal 9 (could be triggered by violating memory limits) |
18 | Halted | 0 ms | 0 KB | - |