# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
389570 | casperwang | Binary Subsequences (info1cup17_binary) | C++14 | 1031 ms | 1620 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define int long long
#define pb emplace_back
using namespace std;
#define debug(args...) kout("[ " + string(#args) + " ]", args)
void kout() { cerr << endl; }
template <class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ',kout(b...); }
template <class T> void pary(T L, T R) { while (L != R) cerr << *L << " \n"[++L==R]; }
const int MAXN = 2000;
const int K = 12;
const int INF = 1e18;
int T, N;
vector <string> arr;
vector <string> tmp;
bool ans[MAXN+1];
string str[MAXN+1];
bool check(const string &a, const string &b) {
int j = 0;
for (int i = 0; i < a.size(); i++)
if (j < b.size() && a[i] == b[j]) j++;
return j == b.size();
}
void init() {
for (int i = 1; i <= K; i++) {
for (int j = 0; j < (1<<i); j++) {
string now = "";
for (int k = 0; k < i; k++)
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |