# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
67125 | 2018-08-13T11:02:03 Z | ege_eksi | Hidden Sequence (info1cup18_hidden) | C++14 | 400 ms | 452 KB |
#include<bits/stdc++.h> #include "grader.h" using namespace std; vector<int> S; bool generateAll(int n) { if(S.size() == n) { if(isSubsequence(S) == true) { return true; } else { return false; } } S.push_back(0); if(generateAll(n) == true) { return true; } S.pop_back(); S.push_back(1); if(generateAll(n) == true) { return true; } S.pop_back(); return false; } vector < int > findSequence (int N) { generateAll(N); return S; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 4 ms | 376 KB | Output is partially correct: Maximum length of a query = 8 |
2 | Partially correct | 7 ms | 440 KB | Output is partially correct: Maximum length of a query = 10 |
3 | Partially correct | 4 ms | 440 KB | Output is partially correct: Maximum length of a query = 8 |
4 | Partially correct | 3 ms | 440 KB | Output is partially correct: Maximum length of a query = 9 |
5 | Partially correct | 3 ms | 440 KB | Output is partially correct: Maximum length of a query = 7 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 685 ms | 452 KB | Time limit exceeded (wall clock) |
2 | Halted | 0 ms | 0 KB | - |