| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1212176 | LIA | Gondola (IOI14_gondola) | C++17 | 0 ms | 0 KiB |
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef tuple<ll, ll, ll> plll;
typedef vector<plll> vplll;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<pll> vpll;
typedef vector<vector<pll>> vvpll;
typedef vector<vector<ll>> vvll;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
#define loop(i, s, e) for (ll i = (s); i < (e); ++i)
#define loopr(i, e, s) for (ll i = (e)-1; i >= (s); --i)
#define all(a) a.begin(), a.end()
const ll inf = 1e9 + 7;
int valid(int n, int inputSeq[]) {
bool b = 1;
ll cnt = 0;
vll inp;
vll vis(250001);
loop(i,0,n) {
vis[inputSeq[i]]++;
if (inputSeq[i] <=n) inp.push_back(inputSeq[i]);
}
for (auto it : inputSeq) if (vis[it]>1) b= false;
loop(i,1,n) {
if (inp[i] < inp[i-1] && cnt!= 0 ) b = false;
if (inp[i] < inp[i-1]) cnt++;
}
return (b==1 ? 1: 0);
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
return -2;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
return -3;
}