oj.uz

답안 #153276

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
153276 2019-09-13T07:22:05 Z arnold518 곤돌라 (IOI14_gondola) C++14
75 / 100
 26 ms 2404 KB 
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 1e5;
const ll MOD = 1e9+9;

int valid(int N, int *A)
{
    int i, j;

    vector<int> S(A, A+N);
    sort(S.begin(), S.end());
    S.erase(unique(S.begin(), S.end()), S.end());
    if(S.size()!=N) return 0;

    int flag=-1;
    for(i=0; i<N; i++)
    {
        if(A[i]>N) continue;
        int t=(A[i]-1-i+N)%N;
        if(flag==-1) flag=t;
        else if(flag!=t) return 0;
    }
    return 1;
}

int replacement(int N, int *A, int *B)
{
    int i, j, ret=0;

    int flag=0;
    vector<pii> V;
    for(i=0; i<N; i++)
    {
        if(A[i]<=N)
        {
            flag=(A[i]-1-i+N)%N;
            continue;
        }
        V.push_back({A[i], i});
    }
    for(i=0; i<N; i++) A[i]=(i+flag)%N+1;
    sort(V.begin(), V.end());

    int now=N+1;
    for(i=0; i<V.size(); i++)
    {
        int p=V[i].first, q=V[i].second;
        while(A[q]!=p)
        {
            B[ret++]=A[q];
            A[q]=now++;
        }
    }
    return ret;
}

ll mypow(ll x, ll y)
{
    if(y==0) return 1;
    if(y%2) return mypow(x, y-1)*x%MOD;
    ll ret=mypow(x, y/2);
    return ret*ret%MOD;
}

int countReplacement(int N, int *A)
{
    int i, j; ll ans=1;
    if(!valid(N, A)) return 0;

    int flag=-1;
    vector<int> V; V.push_back(N);
    for(i=0; i<N; i++)
    {
        if(A[i]<=N) flag=0;
        else V.push_back(A[i]);
    }
    sort(V.begin(), V.end());
    if(flag==-1) for(i=1; i<V.size(); i++) ans=ans*mypow(V.size()-i, V[i]-V[i-1])%MOD;
    else for(i=1; i<V.size(); i++) ans=ans*mypow(V.size()-i, V[i]-V[i-1]-1)%MOD;
    return ans;
}

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:19:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(S.size()!=N) return 0;
        ~~~~~~~~^~~
gondola.cpp:14:12: warning: unused variable 'j' [-Wunused-variable]
     int i, j;
            ^
gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:51:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(i=0; i<V.size(); i++)
              ~^~~~~~~~~
gondola.cpp:34:12: warning: unused variable 'j' [-Wunused-variable]
     int i, j, ret=0;
            ^
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:84:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(flag==-1) for(i=1; i<V.size(); i++) ans=ans*mypow(V.size()-i, V[i]-V[i-1])%MOD;
                           ~^~~~~~~~~
gondola.cpp:85:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     else for(i=1; i<V.size(); i++) ans=ans*mypow(V.size()-i, V[i]-V[i-1]-1)%MOD;
                   ~^~~~~~~~~
gondola.cpp:73:12: warning: unused variable 'j' [-Wunused-variable]
     int i, j; ll ans=1;
            ^

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 252 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 11 ms 760 KB Output is correct
7 Correct 20 ms 1144 KB Output is correct
8 Correct 14 ms 1016 KB Output is correct
9 Correct 7 ms 632 KB Output is correct
10 Correct 20 ms 1144 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 10 ms 760 KB Output is correct
7 Correct 20 ms 1144 KB Output is correct
8 Correct 14 ms 1144 KB Output is correct
9 Correct 7 ms 632 KB Output is correct
10 Correct 20 ms 1144 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 10 ms 888 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 22 ms 1528 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 3 ms 380 KB Output is correct
9 Correct 3 ms 380 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 9 ms 760 KB Output is correct
12 Correct 14 ms 760 KB Output is correct
13 Correct 19 ms 1464 KB Output is correct
14 Correct 13 ms 760 KB Output is correct
15 Correct 24 ms 2404 KB Output is correct

Subtask #7
5.0 / 5.0

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

Subtask #8
15.0 / 15.0

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

Subtask #9
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 26 ms 1228 KB Output is correct
10 Correct 21 ms 1148 KB Output is correct
11 Correct 10 ms 760 KB Output is correct
12 Correct 12 ms 760 KB Output is correct
13 Incorrect 4 ms 504 KB Output isn't correct

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 26 ms 1200 KB Output is correct
10 Correct 22 ms 1144 KB Output is correct
11 Correct 10 ms 760 KB Output is correct
12 Correct 11 ms 760 KB Output is correct
13 Incorrect 4 ms 508 KB Output isn't correct
14 Halted 0 ms 0 KB -