# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
734939 | sandry24 | 곤돌라 (IOI14_gondola) | C++17 | 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>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#include "gondola.h"
map<int, int> freq;
int valid(int n, int inputSeq[]){
int index_under_n = -1;
for(int i = 0; i < n; i++){
freq[inputSeq[i]]++;
if(freq[inputSeq[i]] > 1)
return 0;
if(inputSeq[i] <= n)
index_under_n = i;
}
if(index_under_n == -1)
return 1;
int index = (index_under_n == n-1 ? 0 : index_under_n + 1);
int next = (inputSeq[index_under_n] == n ? 1 : inputSeq[index_under_n] + 1);
while(index != index_under_n){
if(inputSeq[index] < n){
if(inputSeq[index] != next){
return 0;
}
}
index = (index == n-1 ? 0 : index + 1);
next = (next == n ? 1 : next + 1);
}
return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]){
int index = -1, cnt = 0, next;
for(int i = 0; i < n; i++)
if(gondolaSeq[i] <= n)
index = i;
if(index == -1){
index = 0;
next = 1;
} else next = gondolaSeq[index];
vector<pi> temp;
int current = n+1;
while(cnt != n){
if(gondolaSeq[index] != next)
temp.pb({gondolaSeq[index], next});
index = (index == n-1 ? 0 : index + 1);
next = (next == n ? 1 : next + 1);
cnt++;
}
sort(temp.begin(), temp.end());
int ind = 0;
for(int i = 0; i < temp.size(); i++){
while(temp[i].f != temp[i].s){
replacementSeq[ind] = temp[i].s;
temp[i].s = current;
current++;
ind++;
}
}
return ind;
}
ll bin_pow(ll a, ll b, ll mod){
ll ans = 1;
while(b > 0){
if(b & 1)
ans = ans * a % mod;
a = a * a % mod;
b /= 2;
}
return ans;
}
int countReplacement(int n, int inputSeq[]){
if(!valid(n, inputSeq))
return 0;
return 1
}