# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
926838 | NintsiChkhaidze | Gondola (IOI14_gondola) | C++17 | 57 ms | 8272 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 "gondola.h"
#include <bits/stdc++.h>
#define pb push_back
#define s second
#define f first
#define ll long long
using namespace std;
int b[200005],c[200005],a[200005];
const int mod = 1e9 + 9;
int valid(int n, int gondolaSeq[]){
map <int,int> mp;
int k = -1;
for (int i=0;i<n;i++){
a[i] = gondolaSeq[i];
if (mp.find(a[i]) != mp.end()) return 0;
mp[a[i]] = 1;
if (a[i] > n) continue;
if (k == -1) k= i;
else if (a[k] > a[i]) k = i;
}
if (k==-1) return 1;
int m = 0;
int st = a[k];
for (int j = k; j < n; j++)
if (a[j] <= n) b[++m] = a[j],c[m] = st + (j - k);
for (int j = 0; j < k; j++)
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... |
# | 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... |