# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1235683 | Aisha | Hidden Sequence (info1cup18_hidden) | C++20 | 18 ms | 416 KiB |
#include "bits/stdc++.h"
#include "grader.h"
using namespace std;
vector <int> findSequence(int n) {
vector <int> ans;
int cnt0 = 0, cnt1 = 0;
vector <int> q;
for (int i = 1; i <= n; i ++) {
q.push_back(0);
bool ok = isSubsequence(q);
if (ok) cnt0 ++;
else break;
}
cnt1 = n - cnt0;
//cout << cnt0 << ' ' << cnt1 << endl;
q.clear();
int x = 1; q.push_back(0);
while (cnt1 > 0) {
int k = 0;
for (int i = 1; i <= cnt1; i ++) {
q.push_back(1);
// for (int j : q) cout << j << ' ';
// cout << endl;
bool ok = isSubsequence(q);
// cout << ok << endl;
if (ok) k ++;
else break;
}
for (int i = 1; i <= cnt1 - k; i ++) ans.push_back(1);
ans.push_back(0);
x ++;
q.clear();
for (int i = 1; i <= x; i ++) q.push_back(0);
cnt1 = k;
}
for (int i = x + 1; i <= cnt0; i ++) ans.push_back(0);
return ans;
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |