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>
#include "gondola.h"
using namespace std;
int valid(int n, int v[]){
set<int> s;
for(int i = 0; i < n; i++)
s.insert(v[i]);
if((int) s.size() != n) return false;
for(int i = 0; i < n; i++){
int cur = v[i];
if(cur > n) continue;
int left = (cur == 1 ? n : cur - 1), right = (cur == n ? 1 : cur + 1);
int lefViz = (i == 0 ? v[n - 1] : v[i - 1]);
int rigViz = (i == n - 1 ? v[0] : v[i + 1]);
if(lefViz != left && lefViz <= n) return 0;
if(rigViz != right && rigViz <= n) return 0;
}
return 1;
}
int countReplacement(int n, int v[]){
return 0;
}
int replacement(int n, int v[], int g[]){
return 0;
}
# | 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... |