# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
64786 | Good | Zalmoxis (BOI18_zalmoxis) | C++17 | 334 ms | 7220 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 = 1e6 + 2;
int n, k, a[N];
deque <int> dq;
vector < pair <int, int> > vec;
int main(){
scanf("%d %d", &n, &k);
for(int i = 1; i <= n; i ++)
scanf("%d", &a[i]);
dq.push_back(30);
int id = 1;
while(id <= n){
int v = dq.front();
dq.pop_front();
if(v == a[id]){
id ++;
} else if(v < a[id]){
vec.push_back({id - 1, v});
} else {
v --;
if(v < 0) continue;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |