# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1119037 | lam280407 | Binaria (CCO23_day1problem1) | C++17 | 72 ms | 10120 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 vi vector<int>
#define pii pair<int, int>
#define fi first
#define se second
#define bit(n, i) ((n >> i) & 1)
#define all(x) (x).begin(), (x).end()
#define el '\n'
#define TASK "bai1"
using namespace std;
const int N = 1e6 + 6;
const int mode = 1e6 + 3;
int n, k, a[N];
namespace sub12{
int ans = 0;
void quay(string s){
if (s.size() == n){
s = '#' + s;
int len = 0, sum = 0;
for (int i = 1; i <= k; ++i) sum += (s[i] == '1');
if (sum != a[++len]) return;
for (int i = k + 1; i <= n; ++i){
sum -= (s[i - k] == '1');
sum += (s[i] == '1');
if (sum != a[++len]) return;
}
++ans;
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... |