# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1119036 | quanquai | Binaria (CCO23_day1problem1) | C++11 | 18 ms | 12388 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>
using namespace std;
#define i64 long long
#define i32 int
#define all(v) (v).begin(), (v).end()
#define task "binaria"
const int N = 1024;
const int mod = 1e6 + 3;
int n, k;
int a[N];
namespace sub3 {
bool check() {
return n <= 1000;
}
i64 dp[N][1 << 11];
void solve() {
for (int msk = 0; msk < (1 << k); msk++) {
if (__builtin_popcount(msk) == a[1]) {
dp[1][msk] = 1;
}
}
for (int i = 2; i <= n - k + 1; i++) {
for (int msk = 0; msk < (1 << k); msk++) {
if (__builtin_popcount(msk) != a[i - 1]) continue;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |