| # | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 180605 | 2020-01-09T04:43:50 Z | FieryPhoenix | Gondola (IOI14_gondola) | C++11 | 0 ms | 0 KB |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <iomanip>
#include <deque>
#include <cassert>
#include <ctime>
#include <cstring>
#include <cstdlib>
#include <chrono>
#include <ctime>
#include <random>
#include <stack>
#include <unordered_set>
#include <unordered_map>
#include <iterator>
#include <climits>
#include "gondola.h"
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef long long ll;
typedef long double ld;
#define INF 2001001001
#define MOD 1000000007
int valid(int N, int arr[]){
set<int>st;
int pos=-1;
for (int i=0;i<N;i++){
if (st.count(arr[i]))
return 0;
st.insert(arr[i]);
if (arr[i]<=N)
pos=i;
}
if (pos==-1)
return 1;
for (int i=0;i<N;i++){
int j=(pos+i)%N;
int target=arr[pos]+i;
if (target>N)
target-=N;
if (arr[j]<=N && arr[j]!=target)
return 0;
}
return 1;
}