oj.uz

Submission #239542

# Submission time Handle Problem Language Result Execution time Memory
239542 2020-06-16T08:48:14 Z Autoratch Gondola (IOI14_gondola) C++14
100 / 100
 30 ms 2816 KB 
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;

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

int repl[N];

int valid(int n,int a[])
{
    int x,y = 0;
    for(int i = 0;i < n;i++) if(a[i]<=n) x = i,y = a[i];
    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(y and z!=a[i]) return 0;
    }
    sort(a,a+n);
    for(int i = 0;i < n-1;i++) if(a[i]==a[i+1]) 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;
}

long long poww(long long x,int y)
{
    if(y==0) return 1;
    if(y==1) return x%MOD;
    long long tmp = poww(x,y/2)%MOD;
    tmp = (tmp*tmp)%MOD;
    if(y%2==0) return tmp;
    return (tmp*x)%MOD;
}

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]);
    }
    bool oh = false;
    if(!y) oh = true;
    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;
    }
    sort(a,a+n);
    for(int i = 0;i < n-1;i++) if(a[i]==a[i+1]) return 0;
    long long res = 1;
    for(int i = -1;i < n;i++)
    {
        int l,r;
        if(i>=0) l = a[i]+1;
        else l = n+1;
        if(i<n) r = a[i+1]-1;
        else r = mx;
        l = max(l,n+1);
        if(l>r) continue;
        res = (res*poww(n-1-i,r-l+1))%MOD;
    }
    if(oh) res = (res*n)%MOD;
    int ans = res;
    return ans;
}

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:12:9: warning: 'x' may be used uninitialized in this function [-Wmaybe-uninitialized]
     int x,y = 0;
         ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 256 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 5 ms 384 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 256 KB Output is correct
6 Correct 12 ms 508 KB Output is correct
7 Correct 16 ms 640 KB Output is correct
8 Correct 16 ms 640 KB Output is correct
9 Correct 9 ms 384 KB Output is correct
10 Correct 20 ms 640 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 4 ms 256 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 12 ms 512 KB Output is correct
7 Correct 16 ms 640 KB Output is correct
8 Correct 16 ms 640 KB Output is correct
9 Correct 9 ms 384 KB Output is correct
10 Correct 21 ms 640 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 4 ms 256 KB Output is correct
13 Correct 10 ms 512 KB Output is correct
14 Correct 5 ms 256 KB Output is correct
15 Correct 17 ms 640 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 5 ms 384 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 15 ms 640 KB Output is correct
12 Correct 15 ms 640 KB Output is correct
13 Correct 18 ms 1664 KB Output is correct
14 Correct 14 ms 640 KB Output is correct
15 Correct 24 ms 2816 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 256 KB Output is correct

Subtask #8
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 4 ms 256 KB Output is correct

Subtask #9
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 4 ms 256 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 256 KB Output is correct
9 Correct 21 ms 640 KB Output is correct
10 Correct 19 ms 896 KB Output is correct
11 Correct 10 ms 512 KB Output is correct
12 Correct 11 ms 640 KB Output is correct
13 Correct 6 ms 384 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 256 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 4 ms 256 KB Output is correct
6 Correct 4 ms 256 KB Output is correct
7 Correct 4 ms 256 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Correct 22 ms 640 KB Output is correct
10 Correct 18 ms 1024 KB Output is correct
11 Correct 10 ms 512 KB Output is correct
12 Correct 11 ms 640 KB Output is correct
13 Correct 6 ms 384 KB Output is correct
14 Correct 26 ms 1152 KB Output is correct
15 Correct 30 ms 1656 KB Output is correct
16 Correct 9 ms 512 KB Output is correct
17 Correct 21 ms 1152 KB Output is correct
18 Correct 14 ms 872 KB Output is correct