oj.uz

Submission #239529

# Submission time Handle Problem Language Result Execution time Memory
239529 2020-06-16T07:15:00 Z Autoratch Gondola (IOI14_gondola) C++14
90 / 100
 56 ms 9080 KB 
#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;
}

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:15:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(s.size()<n) return 0;
        ~~~~~~~~^~
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:65:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(s.size()<n) return 0;
        ~~~~~~~~^~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 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 5 ms 384 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 16 ms 2176 KB Output is correct
7 Correct 37 ms 3704 KB Output is correct
8 Correct 28 ms 3968 KB Output is correct
9 Correct 11 ms 1536 KB Output is correct
10 Correct 30 ms 4608 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 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 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 17 ms 2304 KB Output is correct
7 Correct 34 ms 3708 KB Output is correct
8 Correct 27 ms 3968 KB Output is correct
9 Correct 11 ms 1536 KB Output is correct
10 Correct 32 ms 4600 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 21 ms 2176 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 46 ms 4728 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 5 ms 384 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 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 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 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 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 16 ms 640 KB Output is correct
13 Correct 16 ms 1408 KB Output is correct
14 Correct 15 ms 640 KB Output is correct
15 Correct 23 ms 2816 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 4224 KB Output is correct
2 Correct 9 ms 4224 KB Output is correct
3 Correct 9 ms 4224 KB Output is correct

Subtask #8
15.0 / 15.0

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

Subtask #9
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 4352 KB Output is correct
2 Correct 9 ms 4224 KB Output is correct
3 Correct 10 ms 4224 KB Output is correct
4 Correct 9 ms 4224 KB Output is correct
5 Correct 9 ms 4224 KB Output is correct
6 Correct 10 ms 4224 KB Output is correct
7 Correct 9 ms 4224 KB Output is correct
8 Correct 10 ms 4224 KB Output is correct
9 Correct 44 ms 8440 KB Output is correct
10 Correct 37 ms 7672 KB Output is correct
11 Correct 21 ms 6016 KB Output is correct
12 Correct 21 ms 6016 KB Output is correct
13 Correct 13 ms 4736 KB Output is correct

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 4224 KB Output is correct
2 Correct 10 ms 4224 KB Output is correct
3 Correct 10 ms 4224 KB Output is correct
4 Correct 9 ms 4224 KB Output is correct
5 Correct 10 ms 4224 KB Output is correct
6 Correct 9 ms 4224 KB Output is correct
7 Correct 10 ms 4224 KB Output is correct
8 Correct 10 ms 4224 KB Output is correct
9 Correct 44 ms 8440 KB Output is correct
10 Correct 40 ms 7672 KB Output is correct
11 Correct 19 ms 5992 KB Output is correct
12 Correct 22 ms 6016 KB Output is correct
13 Correct 13 ms 4736 KB Output is correct
14 Runtime error 56 ms 9080 KB Execution killed with signal 11 (could be triggered by violating memory limits)
15 Halted 0 ms 0 KB -