# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1011671 | snpmrnhlol | Worst Reporter 3 (JOI18_worst_reporter3) | C++17 | 404 ms | 32388 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;
const int N = 5e5;
int v[N];
array <int,3> trains[N + 1];
struct query{
int t,l,r,id;
}q2[N];
int ans[N];
int main(){
int n,q;
cin>>n>>q;
for(int i = 0;i < n;i++){
cin>>v[i];
if(i){
if(v[i]%v[i - 1] == 0){
v[i] = v[i]/v[i - 1]*v[i - 1];
}else{
v[i] = v[i]/v[i - 1]*v[i - 1] + v[i - 1];
}
}
}
int cnt = 0;
trains[cnt++] = {0,0,1};
int nr = 0;
for(int i = 0;i < n;i++){
if(i && v[i] != v[i - 1]){
trains[cnt++] = {-i,-i + nr - 1,v[i - 1]};
nr = 1;
}else nr++;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |