oj.uz

답안 #539056

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
539056 2022-03-18T10:39:46 Z alextodoran Calvinball championship (CEOI15_teams) C++17
100 / 100
 244 ms 544 KB 
/**
 ____ ____ ____ ____ ____
||a |||t |||o |||d |||o ||
||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|

**/

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N_MAX = 10000;

const int MOD = (int) 1e6 + 7;

int N;
int A[N_MAX + 2];

int first[N_MAX + 2];
int teamsPref[N_MAX + 2];

int dp[2][N_MAX + 2];

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    cin >> N;
    for (int i = 1; i <= N; i++) {
        cin >> A[i];
        teamsPref[i] = teamsPref[i - 1];
        if (first[A[i]] == 0) {
            first[A[i]] = i;
            teamsPref[i]++;
        }
    }

    int answer = 0;
    fill(dp[1] + 1, dp[1] + N + 1, 1);
    for (int i = N; i >= 1; i--) {
        for (int k = 0; k < i; k++) {
            // dp[i][k] = number of assignments of i..N, when there are already k teams opened
            dp[0][k] = ((ll) dp[1][k] * k + dp[1][k + 1]) % MOD;
        }
        // Try any possible value of B[i]<A[i] and count the assignments for the rest
        for (int x = 1; x < A[i]; x++) {
            answer += dp[1][teamsPref[i - 1] + (i < first[x])];
            if (answer >= MOD) {
                answer -= MOD;
            }
        }
        swap(dp[0], dp[1]);
    }
    answer++;
    cout << answer << "\n";

    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 340 KB Output is correct
2 Correct 5 ms 416 KB Output is correct
3 Correct 6 ms 324 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 424 KB Output is correct
2 Correct 14 ms 384 KB Output is correct
3 Correct 11 ms 324 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 244 ms 472 KB Output is correct

Subtask #9
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 66 ms 448 KB Output is correct
2 Correct 62 ms 452 KB Output is correct
3 Correct 80 ms 472 KB Output is correct

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 171 ms 496 KB Output is correct
2 Correct 186 ms 492 KB Output is correct
3 Correct 238 ms 544 KB Output is correct