# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
96487 | 2019-02-09T16:45:58 Z | Camaroes | Hidden Sequence (info1cup18_hidden) | C++14 | 400 ms | 420 KB |
#include "grader.h" using namespace std; vector<int> findSequence(int N) { vector<int> ans (N, 0); for(;;) { if(isSubsequence(ans)) return ans; for(int i = 0; i < N; i++) { if(ans[i] == 0) { ans[i] = 1; i = N; } if(ans[i] == 1) { ans[i] = 0; } } } return ans; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Partially correct | 4 ms | 420 KB | Output is partially correct: Maximum length of a query = 8 |
2 | Partially correct | 4 ms | 376 KB | Output is partially correct: Maximum length of a query = 10 |
3 | Partially correct | 4 ms | 256 KB | Output is partially correct: Maximum length of a query = 8 |
4 | Partially correct | 7 ms | 376 KB | Output is partially correct: Maximum length of a query = 9 |
5 | Partially correct | 2 ms | 248 KB | Output is partially correct: Maximum length of a query = 7 |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1588 ms | 376 KB | Time limit exceeded (wall clock) |
2 | Halted | 0 ms | 0 KB | - |