oj.uz

답안 #550639

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
550639 2022-04-18T18:13:01 Z Vladth11 Calvinball championship (CEOI15_teams) C++14
70 / 100
 979 ms 596 KB 
#include <bits/stdc++.h>
#define debug(x) cerr << #x << " " << x << "\n"
#define debugs(x) cerr << #x << " " << x << " "
 
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
 
const ll NMAX = 10001;
const ll VMAX = 10001;
const ll INF = (1LL << 55);
const ll MOD = 1000007;
const ll BLOCK = 1000000;
const ll base = 1000000001;
const ll nr_of_bits = 18;
 
int dp[3][NMAX][3];
int v[NMAX];
 
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n, i, j;
    cin >> n;
    for(i = 1; i <= n; i++){
        cin >> v[i];
    }
    dp[0][0][1] = 1;
    int sum = 0;
    for(i = 1; i <= n; i++){
        int act = i&1;
        int last = 1 - act;
        for(j = 1; j <= i; j++){
            /// Nu deschid culoare noua
            dp[act][j][0] = (dp[last][j][0] * j) % MOD;
            dp[act][j][0] += (dp[last][j][1] * min(j, v[i] - 1)) % MOD;
            dp[act][j][0] %= MOD;
            if(j >= v[i])
                dp[act][j][1] = dp[last][j][1];
            dp[act][j][2] = (dp[last][j][2] * j) % MOD;
            dp[act][j][2] += (dp[last][j][1] * max(0, j - v[i])) % MOD;
            dp[act][j][2] %= MOD;
            /// Deschid o culoare noua
            dp[act][j][0] += dp[last][j - 1][0];
            dp[act][j][0] %= MOD;
            if(j < v[j]){
                dp[act][j][0] += dp[last][j - 1][1];
                dp[act][j][0] %= MOD;
            }
            if(j == v[i]){
                dp[act][j][1] += dp[last][j - 1][1];
                dp[act][j][1] %= MOD;
            }
            dp[act][j][2] += dp[last][j - 1][2];
            dp[act][j][2] %= MOD;
            if(j > v[i]){
                dp[act][j][2] += dp[last][j - 1][1] % MOD;
                dp[act][j][2] %= MOD;
            }
            if(i == n){
                sum += dp[act][j][0];
                sum %= MOD;
            }
        }
      for(j = 0; j < NMAX; j++)
        dp[last][j][0] = dp[last][j][1] = dp[last][j][2] = 0;
    }
    cout << sum + 1;
 
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

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

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 548 KB Output is correct
2 Correct 20 ms 532 KB Output is correct
3 Correct 24 ms 456 KB Output is correct

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 831 ms 576 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 271 ms 576 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 979 ms 596 KB Output isn't correct
2 Halted 0 ms 0 KB -