oj.uz

답안 #43784

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
43784 2018-03-23T18:24:22 Z PowerOfNinjaGo 곤돌라 (IOI14_gondola) C++14
75 / 100
 31 ms 2548 KB 
//Power Of Ninja Go
#include <bits/stdc++.h>
#ifdef atom
    #include "grader.cpp"
#else
    #include "gondola.h"
#endif
using namespace std;
typedef long long ll; typedef pair<int, int> ii;
#define X first
#define Y second
#define vi vector<int>
#define vii vector< ii >
#define pb push_back
int valid(int n, int arr[])
{
    for(int i = 0; i< n; i++) arr[i]--;
    vi vec;
    for(int i = 0; i< n; i++) vec.pb(arr[i]);
    sort(vec.begin(), vec.end()); vec.resize(unique(vec.begin(), vec.end())-vec.begin());
    if(vec.size() != n) return 0;
    vi tmp;
    for(int i = 0; i< n; i++) if(arr[i]< n) tmp.pb((arr[i]-i+n)%n);
    sort(tmp.begin(), tmp.end()); tmp.resize(unique(tmp.begin(), tmp.end())-tmp.begin());
    return (tmp.size()<= 1);
}
int replacement(int n, int arr[], int ans[])
{
    for(int i = 0; i< n; i++) arr[i]--;
    vi tmp;
    for(int i = 0; i< n; i++) if(arr[i]< n) tmp.pb((arr[i]-i+n)%n);
    sort(tmp.begin(), tmp.end()); tmp.resize(unique(tmp.begin(), tmp.end())-tmp.begin());
    int q = tmp.size();
    int st = q?tmp[0]:0;
    vii strange;
    for(int i = 0; i< n; i++) if(arr[i]>= n) strange.pb(ii(arr[i], (i+st)%n));
    sort(strange.begin(), strange.end());
    int ptr = 0;
    for(int i = 0; i< strange.size(); i++)
    {
        //printf("%d %d\n", strange[i].X, strange[i].Y);
        int prv = i?strange[i-1].X:n-1;
        int rounds = strange[i].X-prv;
        rounds--;
        ans[ptr++] = strange[i].Y+1;
        while(rounds--)
        {
            ans[ptr] = n+ptr;
            ptr++;
        }
    }
    return ptr;
}

//----------------------
const int md = 1e9+9;
int mul(int a, int b)
{
    return (1LL*a*b)%md;
}
int ninja(int a, int b)
{
    if(b == 0) return 1;
    int x = ninja(a, b/2);
    int y = mul(x, x);
    if(b%2) y = mul(y, a);
    return y;
}
int countReplacement(int n, int arr[])
{
    if(!valid(n, arr)) return 0;
    vi tmp;
    for(int i = 0; i< n; i++) if(arr[i]< n) tmp.pb((arr[i]-i+n)%n);
    sort(tmp.begin(), tmp.end()); tmp.resize(unique(tmp.begin(), tmp.end())-tmp.begin());
    int q = tmp.size();
    int st = q?tmp[0]:0;
    vii strange;
    for(int i = 0; i< n; i++) if(arr[i]>= n) strange.pb(ii(arr[i], (i+st)%n));
    sort(strange.begin(), strange.end());
    int ptr = 0;
    int res = 1;
    for(int i = 0; i< strange.size(); i++)
    {
        //printf("%d %d\n", strange[i].X, strange[i].Y);
        int prv = i?strange[i-1].X:n-1;
        int rounds = strange[i].X-prv;
        rounds--;
        //printf("pow %d %d\n", strange.size()-i, rounds);
        res = mul(res, ninja(strange.size()-i, rounds));
    }
    return res;
}

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:21:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(vec.size() != n) return 0;
                   ^
gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:39:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i< strange.size(); i++)
                     ^
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:82:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i< strange.size(); i++)
                     ^
gondola.cpp:80:9: warning: unused variable 'ptr' [-Wunused-variable]
     int ptr = 0;
         ^

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 1 ms 352 KB Output is correct
3 Correct 1 ms 424 KB Output is correct
4 Correct 1 ms 496 KB Output is correct
5 Correct 1 ms 512 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 548 KB Output is correct
2 Correct 2 ms 548 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 11 ms 1368 KB Output is correct
7 Correct 23 ms 1496 KB Output is correct
8 Correct 17 ms 1888 KB Output is correct
9 Correct 6 ms 1888 KB Output is correct
10 Correct 21 ms 2020 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2020 KB Output is correct
2 Correct 1 ms 2020 KB Output is correct
3 Correct 1 ms 2020 KB Output is correct
4 Correct 2 ms 2020 KB Output is correct
5 Correct 1 ms 2020 KB Output is correct
6 Correct 10 ms 2020 KB Output is correct
7 Correct 20 ms 2020 KB Output is correct
8 Correct 15 ms 2020 KB Output is correct
9 Correct 6 ms 2020 KB Output is correct
10 Correct 25 ms 2020 KB Output is correct
11 Correct 2 ms 2020 KB Output is correct
12 Correct 2 ms 2020 KB Output is correct
13 Correct 11 ms 2020 KB Output is correct
14 Correct 2 ms 2020 KB Output is correct
15 Correct 29 ms 2020 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2020 KB Output is correct
2 Correct 2 ms 2020 KB Output is correct
3 Correct 1 ms 2020 KB Output is correct
4 Correct 2 ms 2020 KB Output is correct
5 Correct 1 ms 2020 KB Output is correct
6 Correct 1 ms 2020 KB Output is correct
7 Correct 2 ms 2020 KB Output is correct
8 Correct 2 ms 2020 KB Output is correct
9 Correct 2 ms 2020 KB Output is correct
10 Correct 2 ms 2020 KB Output is correct
11 Correct 13 ms 2020 KB Output is correct
12 Correct 14 ms 2020 KB Output is correct
13 Correct 30 ms 2020 KB Output is correct
14 Correct 13 ms 2020 KB Output is correct
15 Correct 22 ms 2548 KB Output is correct

Subtask #7
5.0 / 5.0

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

Subtask #8
15.0 / 15.0

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

Subtask #9
0 / 15.0

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

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2548 KB Output is correct
2 Correct 1 ms 2548 KB Output is correct
3 Correct 1 ms 2548 KB Output is correct
4 Correct 1 ms 2548 KB Output is correct
5 Correct 1 ms 2548 KB Output is correct
6 Correct 1 ms 2548 KB Output is correct
7 Correct 1 ms 2548 KB Output is correct
8 Correct 2 ms 2548 KB Output is correct
9 Correct 31 ms 2548 KB Output is correct
10 Correct 21 ms 2548 KB Output is correct
11 Correct 9 ms 2548 KB Output is correct
12 Correct 13 ms 2548 KB Output is correct
13 Incorrect 3 ms 2548 KB Output isn't correct
14 Halted 0 ms 0 KB -