| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1319079 | muhammad-ahmad | Hidden Sequence (info1cup18_hidden) | C++20 | 0 ms | 0 KiB |
#include "grader.h"
#include <bits/stdc++.h>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <map>
#include <vector>
#include <iomanip>
#include <string>
#include <queue>
#include <set>
#include <deque>
#include <numeric>
#include <stack>
#include <chrono>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
void fast_io() {
// freopen("", "r", stdin);
// freopen("", "w", stdout);
// ios::sync_with_stdio(0);
// cin.tie();
// cout.tie();
cout << setprecision(9);
}
#define int long long
// #define endl '\n'
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define fi first
#define se second
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
vector<int> findSequence (int n){
vector<int> s;
s.push_back(0);
bool x = isSubsequence(s);
if (!x) s[0] = 1;
for (int I = 1; i < n; i++){
int N = s.size();
for (int i = 0; i <= N; i++){
vector<int> t;
for (int j = 0; j < i; j++){
t.push_back(s[j]);
}
t.push_back(0);
for (int j = i; j < N; j++){
t.push_back(s[j]);
}
x = isSubsequence(t);
if (x){
swap(t, s);
break;
}
}
if (s.size() > I) continue;
for (int i = 0; i <= N; i++){
vector<int> t;
for (int j = 0; j < i; j++){
t.push_back(s[j]);
}
t.push_back(1);
for (int j = i; j < N; j++){
t.push_back(s[j]);
}
x = isSubsequence(t);
if (x){
swap(t, s);
break;
}
}
}
}
//
// void solve() {
//
// }
//
// signed main() {
// fast_io();
// srand(chrono::steady_clock::now().time_since_epoch().count());
// int tc = 1;
// cin >> tc;
// while (tc--) solve();
// return 0;
// }