# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1141628 | KasymK | Hidden Sequence (info1cup18_hidden) | C++20 | 1004 ms | 408 KiB |
#include "bits/stdc++.h"
#include "grader.h"
using namespace std;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i)
#define wr puts("----------------")
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
// vector<int> cyn;
// bool isSubsequence(vector<int> s){
// vector<bool> vis((int)cyn.size(), false);
// int last=0, sm=0;
// tr(it, s){
// bool did=0;
// while(last<(int)cyn.size()){
// if(cyn[last]==*it){
// vis[last]=1;
// did=1;
// sm++;
// }
// last++;
// if(did)
// break;
// }
// }
// return sm==(int)s.size();
// }
vector<int> findSequence(int n){
vector<int> s;
for(int mk = 0; mk < (1<<n); ++mk){
for(int i = 0; i < n; ++i)
s.pb(mk>>i&1);
if(isSubsequence(s))
return s;
s.clear();
}
}
// int main(){
// int n;
// scanf("%d", &n);
// for(int i = 1; i <= n; ++i){
// int x;
// scanf("%d", &x);
// cyn.pb(x);
// }
// vector<int> ans=findSequence(n);
// tr(it, ans)
// printf("%d ", *it);
// puts("");
// return 0;
// }
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |