# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
132147 | miguel | Gondola (IOI14_gondola) | C++14 | 0 ms | 0 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<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 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;
}
int replacement( int n, int num[], int se[] ) {return 0;}
int countReplacement( int n, int num[] ) {return 0;}