| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1242472 | edga1 | Gondola (IOI14_gondola) | C++20 | 10 ms | 1728 KiB |
#include <bits/stdc++.h>
#include "gondola.h"
#define pb push_back
using namespace std;
int valid(int n, int inputSeq[])
{
int m=1e9,p;
for(int i=0; i<n; i++){
if(inputSeq[i]<m){
m=inputSeq[i];
p=i;
}
}
vector<int> seq;
for(int i=p; i<n; i++) seq.pb(inputSeq[i]);
for(int i=0; i<p; i++) seq.pb(inputSeq[i]);
vector<int> o;
for(int i=0; i<n; i++){
if(seq[i]<=n) o.pb(seq[i]);
}
sort(inputSeq, inputSeq+n);
for(int i=0; i<n-1; i++){
if(inputSeq[i]==inputSeq[i+1]) return 0;
}
for(int i=0; i<o.size()-1; i++){
if(o[i]>o[i+1]) return 0;
}
return 1;
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
return -2;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
return -3;
}
| # | 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... | ||||
