# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
749974 | Abrar_Al_Samit | Gondola (IOI14_gondola) | C++17 | 47 ms | 4968 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>
using namespace std;
const int nax = 1e5 + 3;
const int mod = 1e9 + 9;
map<int,int>cnt;
int expected[nax];
void get_expected(int n, int inputSeq[]) {
for(int i=0; i<n; ++i) {
expected[i] = 0;
}
int min_at = min_element(inputSeq, inputSeq+n) - inputSeq;
int cur_val = inputSeq[min_at];
int cur_id = min_at;
if(cur_val>n) return;
for(int i=cur_id; ; ++i, ++cur_val) {
if(i==n) i = 0;
if(cur_val>n) cur_val = 1;
if(expected[i]) break;
expected[i] = cur_val;
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... |