# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
103570 | SecretAgent007 | 곤돌라 (IOI14_gondola) | C++17 | 62 ms | 4728 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;
int valid(int n, int inputSeq[]){
int index = 0;
int num = n;
map< int, bool> visited;
for(int i = 0; i < n; i++){
if(visited[inputSeq[i]]) return 0;
visited[inputSeq[i]] = true;
if(inputSeq[i] <= num){
num = inputSeq[i];
index = i;
}
}
int start = (index-num+1+n)%n;
int curr = 1;
for(int i = start; i < n; i++){
if(inputSeq[i] <= n && inputSeq[i] != curr) return 0;
curr++;
}
for(int j = 0; j < start; j++){
if(inputSeq[j] <= n && inputSeq[j] != curr) return 0;
curr++;
}
return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]){
int index = 0;
int num = n;
int maxi = 0;
for(int i = 0; i < n; i++){
if(gondolaSeq[i] <= num){
num = gondolaSeq[i];
index = i;
}
maxi = max(maxi, gondolaSeq[i]);
}
int start = (index-num+1+n)%n;
int curr = 1;
map<int, int> mape;
int in;
for(int i = start; i < n; i++){
mape[gondolaSeq[i]] = curr;
if(gondolaSeq[i] == maxi) in = curr;
curr++;
}
for(int j = 0; j < start; j++){
mape[gondolaSeq[j]] = curr;
if(gondolaSeq[j] == maxi) in = curr;
curr++;
}
int c = 0;
for(int i = n+1; i <= maxi; i++){
if(mape[i] != 0){
replacementSeq[c] = mape[i];
}else{
replacementSeq[c] = in;
}
c++;
}
return c;
}
int countReplacement(int n, int inputSeq[]){
}
/*
int main(){
int n;
cin >> n;
int v[n];
int maxi = 0;
for(int i = 0; i < n; i++){
cin >> v[i];
maxi = max(maxi, v[i]);
}
int ans[maxi-n];
cout << replacement(n,v,ans) << endl;
for(int a : ans){
cout << a << ' ';
}
cout << endl;
}
*/
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... |