# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
317013 | 2020-10-29T01:01:15 Z | daniel920712 | Hidden Sequence (info1cup18_hidden) | C++14 | 400 ms | 39308 KB |
#include<bits/stdc++.h> #include "grader.h" using namespace std; vector < pair < vector < int > , int > > all; vector < int > temp; vector < int > findSequence (int N) { int i,j,ok=0,now=0; for(i=0;i<(1<<(N/2+1));i++) { temp.clear(); for(j=0;j<(N/2+1);j++) { if(i&(1<<j)) temp.push_back(1); else temp.push_back(0); } all.push_back(make_pair(temp,isSubsequence(temp))); } for(auto j:all) { for(auto k:j.first) printf("%d",k); printf(" %d\n",j.second); } for(i=0;i<(1<<N);i++) { temp.clear(); for(j=0;j<N;j++) { if(i&(1<<j)) temp.push_back(1); else temp.push_back(0); } ok=1; for(auto j:all) { now=0; for(auto k:temp) { if(now<N/2+1&&k==j.first[now]) now++; } if(now==N/2+1&&j.second==0) ok=0; if(now!=N/2+1&&j.second==1) ok=0; } if(ok) { //printf("aa\n"); return temp; } } temp.clear(); return temp; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 256 KB | Expected integer, but "00000" found |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1850 ms | 39308 KB | Time limit exceeded (wall clock) |
2 | Halted | 0 ms | 0 KB | - |