# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1038869 | vjudge1 | Binaria (CCO23_day1problem1) | C++17 | 1 ms | 2512 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 fi first
#define se second
#define pb emplace_back
#define sz(x) int(x.size())
#define all(x) x.begin(), x.end()
const int mod = 1e6+3;
int n,k;
int a[mod];
void inp(){
ios_base::sync_with_stdio(0);
cin.tie(NULL); cout.tie(NULL);
cin>>n>>k;
for(int i=1;i<=n-k+1;i++){
cin>>a[i];
}
}
int v[mod];
signed main(){
inp();
v[1]=1;
for(int i=2;i<=n-k+1;i++){
if(a[i]==a[i-1]){
v[i+k-1]= v[i-1];
# | 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... |