| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 385871 | mehrdad_sohrabi | 곤돌라 (IOI14_gondola) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
// Black lives matter
#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;
typedef long long int ll;
typedef complex<double> point;
typedef long double ld;
#define pb push_back
#define pii pair < ll , ll >
#define F first
#define S second
//#define endl '\n'
#define int long long
#define sync ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#define kill(x) return cout<<x<<'\n', 0;
const int N=25e4+10;
ll mod=1e9+9;
int32_t valid(int32_t n, int32_t input[]){
ll id=-1;
for (int i=0;i<n;i++){
if (input[i]<=n){
id=i;
}
}
ll z=input[id]-id+n;
z%=n;
for (int i=0;i<n;i++){
if (input[i]<=n){
ll f=input[i]-i+n;
f%=n;
if (f!=z) return 0;
}
}
vector <int> a;
for (int i=0;i<n;i++){
a.pb(input[i]);
}
sort(a.begin(),a.end());
for (int i=1;i<a.size();i++){
if (a[i]==a[i-1]) return 0;
}
return 1;
}
ll ja[N];
int32_t WW[N];
ll val[N];
int32_t replacement(int32_t n, int32_t input[], int32_t replacementSeq[]){
vector <int> a;
ll id=-1;
for (int i=0;i<n;i++){
val[i+1]=i+1;
if (input[i]<=n) id=i;
}
if (id!=-1){
val[id+1]=input[id];
ll z=input[id];
// cout << z << endl;
for (int i=(id+1)%n;i!=id;i=(i+1)%n){
z++;
if (z==n+1) z=1;
val[i+1]=z;
}
// for (int i=1;i<=n;i++) cout << val[i] << " ";
// cout << endl;
}
for (int i=0;i<n;i++){
ja[input[i]]=val[i+1];
if (val[i+1]==0) cout << 1/0;
a.pb(input[i]);
}
sort(a.begin(),a.end());
vector <int> ans;
deque <int> b;
ll z=a.back();
while(z>n){
if (size() && z==a.back()){
a.pop_back();
b.pb(z);
if (ja[z]==0) cout << 1/0;
// cout << z << endl;
}
else{
ans.pb(z);
ja[z]=ja[b.front()];
b.pop_front();
b.pb(z);
}
z--;
}
sort(b.begin(),b.end());
reverse(b.begin(),b.end());
for (auto u : b){
ans.pb(ja[u]);
}
reverse(ans.begin(),ans.end());
for (int i=0;i<ans.size();i++){
replacementSeq[i]=ans[i];
// if (ans[i]==0) cout << 1/0;
}
return ans.size();
}
int32_t countReplacement(int32_t n, int32_t input[]){
ll id=-1;
for (int i=0;i<n;i++){
if (input[i]<=n){
id=i;
}
}
ll z=input[id]-id+n;
z%=n;
for (int i=0;i<n;i++){
if (input[i]<=n){
ll f=input[i]-i+n;
f%=n;
if (f!=z) return 0;
}
}
vector <int> a;
for (int i=0;i<n;i++){
a.pb(input[i]);
}
sort(a.begin(),a.end());
for (int i=1;i<a.size();i++){
if (a[i]==a[i-1]) return 0;
}
ll ans=1;
z=a.back();
ll cnt=0;
while(z>n){
if (a.back()==z){
a.pop_back();
cnt++;
}
else{
ans*=cnt;
ans%=mod;
}
z--;
}
if (id==-1){
for (int i=1;i<=n;i++){
ans*=i;
ans%=mod;
}
}
return ans;
}
/*
int32_t in[N];
int32_t main(){
ll n;
cin >> n;
for (int i=1;i<=n;i++){
cin >> in[i-1];
}
ll z=replacement(n,in,WW);
cout << z << endl;
for (int i=0;i<z;i++) cout << WW[i] << " ";
}
*/
/*
int gondolaSequence[100001];
int replacementSequence[250001];
int32_t main()
{
int i, n, tag;
int nr;
assert(scanf("%d", &tag)==1);
assert(scanf("%d", &n)==1);
for(i=0;i< n;i++)
assert( scanf("%d", &gondolaSequence[i]) ==1);
switch (tag){
case 1: case 2: case 3:
printf("%d\n", valid(n, gondolaSequence));
break;
case 4: case 5: case 6:
nr = replacement(n, gondolaSequence, replacementSequence);
printf("%d ", nr);
if (nr > 0)
{
for (i=0; i<nr-1; i++)
printf("%d ", replacementSequence[i]);
printf("%d\n", replacementSequence[nr-1]);
}
else printf("\n");
break;
case 7: case 8: case 9: case 10:
printf("%d\n", countReplacement(n, gondolaSequence));
break;
}
return 0;
}
*/