| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 132142 | 2019-07-18T10:50:17 Z | miguel | 곤돌라 (IOI14_gondola) | C++14 | 0 ms | 0 KB |
#include<bits/stdc++.h>
#include<gondola.h>
using namespace std;
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define int ll
#define sz size()
#define x first
#define y second
#define pi pair <int, int>
#define pii pair <int, pi>
#define vi vector <int>
const ll mod = 998244353;
int n;
int nxt(int lol, int n){
if(lol<n-1) return lol+1;
else return 0;
}
int nxtg(int lol, int n){
if(lol==n) return 1;
else return (lol+1);
}
bool valid(int n, vector <int> v){
int cnt[250001];
memset(cnt, 0, sizeof cnt);
int mn=250001, mx=0, br=0, idx;
for(int i=0; i<n; i++){
if(mn>v[i]){
mn=v[i];
idx=i;
}
mx=max(mx, v[i]);
}
int xd=idx;
if(v[xd]<=n && v[xd]!=mn+((xd-idx+n)%n)) return 0;
cnt[v[xd]]++;
xd=nxt(xd, n);
while(xd!=idx){
if(v[xd]<=n && v[xd]!=mn+((xd-idx+n)%n)) return 0;
cnt[v[xd]]++;
xd=nxt(xd, n);
}
for(int i=1; i<=n; i++){
if(cnt[i]>1) return 0;
}
for(int i=n+1; i<=mx; i++){
if(cnt[i]!=1) return 0;
}
return 1;
}