oj.uz

답안 #239534

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
239534 2020-06-16T07:30:34 Z Autoratch 곤돌라 (IOI14_gondola) C++14
90 / 100
 27 ms 4992 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];

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;
}

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]);
    }
assert(mx<=1e6);
    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;
        if(a[i]>n) repl[a[i]] = 1;
    }
    sort(a,a+n);
    for(int i = 0;i < n-1;i++) if(a[i]==a[i+1]) return 0;
    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:12:9: warning: 'x' may be used uninitialized in this function [-Wmaybe-uninitialized]
     int x,y = 0;
         ^

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 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 256 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 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 5 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 21 ms 640 KB Output is correct
8 Correct 17 ms 640 KB Output is correct
9 Correct 9 ms 384 KB Output is correct
10 Correct 24 ms 640 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 516 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 12 ms 512 KB Output is correct
7 Correct 17 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 22 ms 640 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 10 ms 512 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 18 ms 640 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 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 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

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 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
11 Correct 15 ms 640 KB Output is correct
12 Correct 18 ms 640 KB Output is correct
13 Correct 18 ms 1408 KB Output is correct
14 Correct 15 ms 640 KB Output is correct
15 Correct 24 ms 2944 KB Output is correct

Subtask #7
5.0 / 5.0

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 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 4224 KB Output is correct

Subtask #9
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 4224 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 9 ms 4224 KB Output is correct
7 Correct 9 ms 4224 KB Output is correct
8 Correct 9 ms 4224 KB Output is correct
9 Correct 27 ms 4992 KB Output is correct
10 Correct 24 ms 4736 KB Output is correct
11 Correct 15 ms 4992 KB Output is correct
12 Correct 16 ms 4736 KB Output is correct
13 Correct 12 ms 4480 KB Output is correct

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 4224 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 9 ms 4224 KB Output is correct
7 Correct 9 ms 4224 KB Output is correct
8 Correct 9 ms 4224 KB Output is correct
9 Correct 27 ms 4992 KB Output is correct
10 Correct 25 ms 4856 KB Output is correct
11 Correct 15 ms 4992 KB Output is correct
12 Correct 16 ms 4736 KB Output is correct
13 Correct 13 ms 4480 KB Output is correct
14 Runtime error 21 ms 1152 KB Execution killed with signal 11 (could be triggered by violating memory limits)
15 Halted 0 ms 0 KB -