# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
765367 | 2023-06-24T11:40:50 Z | Ahmed57 | Hidden Sequence (info1cup18_hidden) | C++17 | 78 ms | 464 KB |
#include "grader.h" #include<bits/stdc++.h> using namespace std; vector<int>findSequence(int N){ int x= 0; vector<int>ch; for(int i = 0;i<N/2+1;i++)ch.push_back(x); if(isSubsequence(ch))x = 1; ch.clear(); int cut = 0; for(int i = 1;i<=N/2+1;i++){ ch.push_back(x); if(!isSubsequence(ch)){ cut = i-1; break; } } vector<int> ans(N); for(int i = 0;i<N;i++)ans[i] = !x; for(int i = 1;i<=cut;i++){ int l = 0; ch.clear(); for(int j = 0;j<i;j++)ch.push_back(x); ch.push_back(!x); while(isSubsequence(ch)){ l++; ch.push_back(!x); } long long lol = N-((cut-i)+l); if(lol<0){ return {0}; } ans[lol-1] = x; } return ans; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Partially correct | 1 ms | 208 KB | Output is partially correct: Maximum length of a query = 6 |
2 | Partially correct | 1 ms | 208 KB | Output is partially correct: Maximum length of a query = 7 |
3 | Partially correct | 1 ms | 208 KB | Output is partially correct: Maximum length of a query = 6 |
4 | Runtime error | 1 ms | 464 KB | Execution killed with signal 6 |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Partially correct | 32 ms | 208 KB | Output is partially correct: Maximum length of a query = 90 |
2 | Partially correct | 37 ms | 304 KB | Output is partially correct: Maximum length of a query = 96 |
3 | Partially correct | 54 ms | 208 KB | Output is partially correct: Maximum length of a query = 106 |
4 | Partially correct | 24 ms | 208 KB | Output is partially correct: Maximum length of a query = 83 |
5 | Partially correct | 76 ms | 208 KB | Output is partially correct: Maximum length of a query = 111 |
6 | Partially correct | 78 ms | 208 KB | Output is partially correct: Maximum length of a query = 151 |
7 | Partially correct | 64 ms | 288 KB | Output is partially correct: Maximum length of a query = 135 |
8 | Partially correct | 30 ms | 208 KB | Output is partially correct: Maximum length of a query = 96 |
9 | Partially correct | 59 ms | 208 KB | Output is partially correct: Maximum length of a query = 121 |
10 | Partially correct | 54 ms | 208 KB | Output is partially correct: Maximum length of a query = 105 |
11 | Partially correct | 64 ms | 208 KB | Output is partially correct: Maximum length of a query = 97 |
12 | Partially correct | 70 ms | 208 KB | Output is partially correct: Maximum length of a query = 150 |
13 | Partially correct | 54 ms | 208 KB | Output is partially correct: Maximum length of a query = 106 |