# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
967934 | LittleOrange | Binaria (CCO23_day1problem1) | C++17 | 90 ms | 16208 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;
using ll = long long;
const ll mod = 1e6+3;
ll rev(ll x){
ll r = 1,p=mod-2;
while(p){
if(p&1) r = r*x%mod;
x=x*x%mod;
p>>=1;
}
return r;
}
int main(){
ios::sync_with_stdio(0);cin.tie(0);
ll n,k;
cin >> n >> k;
vector<ll> a(n-k+1);
for(ll &i : a) cin >> i;
vector<ll> b(n,-1);
for(ll i = 1;i<n-k+1;i++){
if (a[i]<a[i-1]){
b[i-1] = 1;
b[i+k-1] = 0;
}else if (a[i]>a[i-1]){
b[i-1] = 0;
b[i+k-1] = 1;
}else{
}
# | 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... |