# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
903304 | Jawad_Akbar_JJ | Gondola (IOI14_gondola) | C++17 | 48 ms | 10304 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 <iostream>
#include <map>
#include <vector>
#include <algorithm>
#include "gondola.h"
using namespace std;
const int N = 1e5 + 10;
int valid(int n,int s[]){
int mn = 2e9;
int ss[n + n + 5] = {0};
map<int,bool> seeen;
for (int i=1;i<=n;i++)
ss[i] = ss[i + n] = s[i-1];
int ind = 0;
for (int i=1;i<=n;i++){
if (ss[i] <= n and ss[i] < mn)
ind = i;
mn = min(mn,ss[i]);
}
for (int i=1;i<=n;i++){
if (seeen[ss[i]])
return false;
seeen[ss[i]] = true;
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... |