# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
67106 | 2018-08-13T10:42:49 Z | MrTEK | Hidden Sequence (info1cup18_hidden) | C++14 | 7 ms | 632 KB |
#include<bits/stdc++.h> #include "grader.h" using namespace std; #define mp make_pair #define pb push_back #define len(a) (int)a.size() #define fi first #define sc second #define d1(w) cerr<<#w<<":"<<w<<endl; #define d2(w,c) cerr<<#w<<":"<<w<<" "<<#c<<":"<<c<<endl; #define d3(w,c,z) cerr<<#w<<":"<<w<<" "<<#c<<":"<<c<<" "<<#z<<":"<<z<<endl; #define left ind+ind #define right ind+ind+1 #define mid (l+r)/2 #define FAST_IO ios_base::sync_with_stdio(false); #define endl '\n' const int maxn = 620; const long long LINF = 1e18; const int LOG = 31; const int INF = 1e9; const int N = 1e3 + 5; const int M = 4; const int SQ = 350; const int MOD = 998244353; vector < vector <int> > allvec[2]; vector <vector <int> > seq; int sz[2]; vector <int > v; void dfs(int step,int w) { if (step > sz[w]) { allvec[w].pb(v); return; } for (int i = 0 ; i < 2 ; i++) { v.pb(i); dfs(step + 1,w); v.pop_back(); } } bool my_isSubsequence (vector < int > v, vector <int> v2) { for (int i = 0 ; i < len(v2) ; i++) { bool flag = true; for (int j = 0 ; j < len(v); j++) { if (i + j >= len(v2) || v2[i + j] != v[j]) { flag = false; break; } } if (flag == true) return true; } return false; } vector < int > findSequence (int N) { if (N > 10) exit(0); sz[0] = N / 2 + 1; sz[1] = N; dfs(1,0); dfs(1,1); for (int i = 0 ; i < len(allvec[0]) ; i++) { if (isSubsequence(allvec[0][i])) { seq.pb(allvec[0][i]); } } for (int i = 0 ; i < len(allvec[1]) ; i++) { bool flag = true; for (int j = 0 ; j < len(seq); j++) { if (my_isSubsequence(seq[j],allvec[1][i]) == false) { flag = false; break; } } if (flag) { return allvec[1][i]; } } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 7 ms | 632 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 632 KB | Unexpected end of file - int32 expected |
2 | Halted | 0 ms | 0 KB | - |