| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1002611 | codexistent | 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 MOD 1000000009
#define ll long long
#define FOR(i, a, b) for(ll i = a; i <= b; i++)
int diff(int n, int a, int b){
if(b >= a) return b - a;
else return (n - a) + b;
}
int valid(int n, int inputSeq[]){
pair<int, int> prev = make_pair(-1, 0);
set<int> s;
FOR(i, 0, n - 1){
if(inputSeq[i] <= n){
if(prev.first == -1){
prev = make_pair(i, inputSeq[i]);
}else{
if((((prev.second + diff(n, prev.first, i)) % n) == 0 ? n : ((prev.second + diff(n, prev.first, i)) % n)) != inputSeq[i]) return 0;
prev = make_pair(i, inputSeq[i]);
}
}else{
if(s.find(inputSeq[i]) != s.end()) return 0;
s.insert(inputSeq[i]);
}
}
return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]){
int idx = -1, mx = -1;
vector<pair<int, int> > v;
FOR(i, 0, n - 1){
if(gondolaSeq[i] <= n){
idx = gondolaSeq[i] - i;
if(idx <= 0) idx += n;
}else{
v.push_back(make_pair(gondolaSeq[i], i));
}
mx = max(mx, gondolaSeq[i]);
}
sort(v.begin(), v.end());
if(idx == -1) idx = 1;
set<int> s;
FOR(i, 0, (int)(v.size() - 2)) {
s.insert(v[i].first);
replacementSeq[v[i].first - n - 1] = ((idx + v[i].second) % n == 0) ? n : ((idx + v[i].second) % n);
}
if(v.size()){
int prev = ((idx + v[v.size() - 1].second) % n == 0) ? n : ((idx + v[v.size() - 1].second) % n);
FOR(i, n + 1, mx) {
if(s.find(i) == s.end()) {
replacementSeq[i - (n + 1)] = prev;
prev = i;
}
}
}
return mx - n;
}
int countReplacement(int n, int inputSeq[]){
if(!valid(n, inputSeq)) return 0;
ll r = 1, c = 0, mx = -1;
set<ll> s;
bool fct = true;
FOR(i, 0, n - 1){
if(inputSeq[i] <= n) fct = false;
else{
c++, s.insert(inputSeq[i]);
}
mx = max(mx, inputSeq[i]);
}
ll c2 = 0;
FOR(i, n + 1, mx){
if(s.find(i) == s.end()){
r = (r * (c - c2)) % MOD;
}else{
c2++;
}
}
if(fct){
FOR(i, 1, n) r = (r * (i)) % MOD;
}
return r;
}