oj.uz

답안 #872765

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
872765 2023-11-13T17:24:56 Z HuyQuang_re_Zero 곤돌라 (IOI14_gondola) C++14
90 / 100
 42 ms 5068 KB 
#include <bits/stdc++.h>
#define ll long long
#define db long double
#define II pair <ll,ll>
#define III pair <ll,II>
#define IV pair <vector <int>,vector <int> >
#define TII pair <treap*,treap*>
#define fst first
#define snd second
#define BIT(x,i) ((x>>i)&1)
#define pi acos(-1)
#define to_radian(x) (x*pi/180.0)
#define to_degree(x) (x*180.0/pi)
#define Log(x) (31-__builtin_clz((int)x))
#define LogLL(x) (63-__builtin_clzll((ll)x))
#include "gondola.h"
using namespace std;
int n,i,a[250005],d[250005];
int valid(int n,int a[])
{
    int last_u=0,last_i=0;
    for(i=0;i<n;i++)
    {
        int u=a[i];
        if(d[u]) return 0;
        d[u]=1;
        if(u>n) continue;
        if(last_u>0 && (u-last_u+n)%n!=(i-last_i+n)%n)
            return 0;
        last_u=u; last_i=i;
    }
    return 1;
}
int m,res[250005],pos[250005],last[250005];
int replacement(int n,int a[], int res[])
{
    int ma=0,m=0;
    memset(last,-1,sizeof(last));
    for(i=0;i<n;i++) ma=max(ma,a[i]),last[a[i]]=i;
    for(i=1;i<=n;i++)
        if(last[i]>-1) break;
    if(i>n)
    {
        for(i=0;i<n;i++) a[i]=i+1;
    }
    else
    {
        int u=i,pos=last[i];
        a[pos]=i;
        for(i=pos+1;i<n;i++)
        {
            if(u==n) u=1; else u++;
            a[i]=u;
        }
        u=a[pos];
        for(i=pos-1;i>=0;i--)
        {
            if(u==1) u=n; else u--;
            a[i]=u;
        }
    }
    for(i=0;i<n;i++) pos[a[i]]=i;
    set <int> Replace;
    for(i=1;i<=n;i++)
        if(last[i]==-1) Replace.insert(i);
    for(i=n+1;i<=ma;i++)
        if(last[i]==-1)
        {
            int u=*Replace.begin(); Replace.erase(u);
            a[pos[u]]=i; pos[i]=pos[u];
            Replace.insert(i);
            res[m++]=u;
        }
        else
        {
            int u=a[last[i]]; Replace.erase(u);
            a[pos[u]]=i; pos[i]=pos[u];
            res[m++]=u;
        }
    return m;
}

const ll mod=round(1e9)+9;
ll lt(ll a,ll b)
{
    if(b==0) return 1;
    ll tg=lt(a,b/2);
    return (b%2==0) ? tg*tg%mod : tg*tg%mod*a%mod;
}
int countReplacement(int n,int a[])
{
    if(!valid(n,a)) return 0;
    vector <int> val;
    for(i=0;i<n;i++)
        if(a[i]>n) val.push_back(a[i]);
    int last=n,left=val.size();
    ll res=1;
    if(left==n) res=n;
    sort(val.begin(),val.end());
    for(int x:val)
    {
        res=res*lt(left,x-last-1)%mod;
        last=x; left--;
    }
    return res;
}

/*
int main()
{
    freopen("gondola.inp","r",stdin);
    freopen("gondola.out","w",stdout);
    cin>>n;
    for(i=0;i<n;i++) cin>>a[i];
    cout<<countReplacement(n,a);
}
*/

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 444 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 6 ms 604 KB Output is correct
8 Correct 6 ms 860 KB Output is correct
9 Correct 3 ms 604 KB Output is correct
10 Correct 7 ms 1116 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 4 ms 604 KB Output is correct
7 Correct 6 ms 604 KB Output is correct
8 Correct 6 ms 856 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 7 ms 1012 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 3 ms 856 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 7 ms 600 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2648 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2648 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2648 KB Output is correct
10 Correct 2 ms 2652 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2508 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 7 ms 2908 KB Output is correct
12 Correct 7 ms 2908 KB Output is correct
13 Correct 30 ms 4684 KB Output is correct
14 Correct 7 ms 2904 KB Output is correct
15 Correct 42 ms 5068 KB Output is correct

Subtask #7
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct

Subtask #8
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct

Subtask #9
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 11 ms 1752 KB Output is correct
10 Correct 10 ms 1628 KB Output is correct
11 Correct 4 ms 1372 KB Output is correct
12 Correct 4 ms 1368 KB Output is correct
13 Correct 1 ms 604 KB Output is correct

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 11 ms 1752 KB Output is correct
10 Correct 9 ms 1496 KB Output is correct
11 Correct 4 ms 1368 KB Output is correct
12 Correct 5 ms 1112 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Runtime error 8 ms 996 KB Execution killed with signal 11
15 Halted 0 ms 0 KB -