제출 #239531

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
239531		Autoratch	곤돌라 (IOI14_gondola)	C++14	80 / 100	28 ms	4992 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;

const int N = 1e6 + 2;
const int MOD = 1e9 + 9;

int repl[N],cnt[N];
set<int> s;

int valid(int n,int a[])
{
    int x,y = 0;
   // for(int i = 0;i < n;i++) s.insert(a[i]);
   // if(s.size()<n) return 0;
    for(int i = 0;i < n;i++) if(a[i]<=n) x = i,y = a[i];
    if(y==0) return 1;
    for(int i = 0;i < n;i++) if(a[i]<=n)
    {
        int z = y+i-x;
        if(z>n) z%=n;
        if(z<1) z+=n;
        if(z!=a[i]) return 0;
    }
    return 1;
}

int replacement(int n,int a[],int ans[])
{
    int x = 0,y = 1,mx = 0;
    for(int i = 0;i < n;i++) 
    {
        if(a[i]<=n) x = i,y = a[i];
        mx = max(mx,a[i]);
    }
    int ret = mx-n;
    int bx = mx;
    for(int i = 0;i < n;i++)
    {
        int z = y+i-x;
        if(z>n) z%=n;
        if(z<1) z+=n;
        if(z!=a[i]) repl[a[i]] = z;
    }
    for(int i = 0;i < ret;i++)
    {
        int j = i+n+1;
        if(!repl[j]) repl[j] = repl[bx],repl[bx] = j;
        ans[i] = repl[j];
    }
    return ret;
}

int countReplacement(int n,int a[])
{
    int x = 0,y = 0,mx = 0;
    for(int i = 0;i < n;i++) 
    {
        if(a[i]<=n) x = i,y = a[i];
        mx = max(mx,a[i]);
  //      s.insert(a[i]);
    }
    bool oh = false;
    if(!y) oh = true;
//    if(s.size()<n) return 0;
    for(int i = 0;i < n;i++)
    {
        int z = y+i-x;
        if(z>n) z%=n;
        if(z<1) z+=n;
        if(!oh and z!=a[i] and a[i]<=n) return 0;
        if(a[i]>n) repl[a[i]] = 1;
    }
    for(int i = 0;i < n;i++) cnt[a[i]]++;
    for(int i = 1e6;i >= 0;i--) cnt[i]+=cnt[i+1];
    long long res = 1;
    for(int i = n+1;i <= mx;i++) if(!repl[i]) res = (res*cnt[i])%MOD;
    if(oh) res = (res*n)%MOD;
    int ans = res;
    return ans;
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 0 / 10
• Subtask 4: 5 / 5
• Subtask 5: 10 / 10
• Subtask 6: 20 / 20
• Subtask 7: 5 / 5
• Subtask 8: 15 / 15
• Subtask 9: 15 / 15
• Subtask 10: 0 / 10