| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1360441 | gvancak | 곤돌라 (IOI14_gondola) | C++20 | 0 ms | 0 KiB |
#include "gondola.h"
#include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define ll long long
using namespace std;
int gondolaSequence[100001];
int replacementSequence[250001];
int valid(int n, int inputSeq[])
{
int a[n+5];
for (int i=0; i<n; i++) a[i]=inputSeq[i];
map <ll,ll> m;
m.clear();
bool ok=0;
int x,y;
x=a[0]; y=0;
for (int i=0; i<n; i++){
m[a[i]]++;
if (m[a[i]]>1){
ok=1; break;
}
if (x>a[i]){
x=a[i]; y=i;
}
}
if (ok) return 0;
if (x>n) return 1;
for (int i=0; i<n; i++) a[i+n]=a[i];
for (int i=y; i<y+n; i++){
if (x>n) x-=n;
if (a[i]>n || a[i]==x){
x++; continue;
}
ok=1; break;
}
if (ok) return 0;
return 1;
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
return -2;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
return -3;
}
/*
int main()
{
int i, n, tag;
int nr;
assert(scanf("%d", &tag)==1);
assert(scanf("%d", &n)==1);
for(i=0;i< n;i++)
assert( scanf("%d", &gondolaSequence[i]) ==1);
switch (tag){
case 1: case 2: case 3:
printf("%d\n", valid(n, gondolaSequence));
break;
case 4: case 5: case 6:
nr = replacement(n, gondolaSequence, replacementSequence);
printf("%d ", nr);
if (nr > 0)
{
for (i=0; i<nr-1; i++)
printf("%d ", replacementSequence[i]);
printf("%d\n", replacementSequence[nr-1]);
}
else printf("\n");
break;
case 7: case 8: case 9: case 10:
printf("%d\n", countReplacement(n, gondolaSequence));
break;
}
return 0;
}*/