# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
583414 | Mr_Husanboy | Gondola (IOI14_gondola) | C++14 | 38 ms | 4212 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;
#define F first
#define S second
int valid(int n, int a[])
{
vector<int> mp(500000,-1);
vector<pair<int,int>> pos;
for(int i=0;i<n;i++){
if(mp[a[i]]!=-1) return 0;
mp[a[i]]=i;
}
bool ok=1;
for(int i=1;i<=n;i++){
if(mp[i]!=-1){
pos.push_back({mp[i],i});
}
}
for(int i=1;i<pos.size();i++){
int d=abs(pos[i-1].F-pos[i].F);
if(pos[i-1].F>pos[i].F){
d=n-d;
}
if(d!=pos[i].S-pos[i-1].S) return 0;
}
return 1;
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
return -2;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
}
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... |