oj.uz

Submission #244468

# Submission time Handle Problem Language Result Execution time Memory
244468 2020-07-04T06:37:32 Z cheeheng Calvinball championship (CEOI15_teams) C++14
100 / 100
 832 ms 632 KB 
#include <bits/stdc++.h>
using namespace std;

const int MOD = 1000007;

int A[10005];
int dp[2][10005][2];
int prefixMax[10005];

int n;

/*
int dp(int i, int cur_max, int same_so_far){
    if(i == n){
        return 1;
    }else if(memo[i][cur_max][same_so_far] != -1){
        return memo[i][cur_max][same_so_far];
    }else{
        long long ans = 0;

        if(same_so_far){
            for(int j = 1; j <= A[i]; j ++){
                ans += dp(i+1, max(cur_max, j), j == A[i]);
            }
        }else{
            for(int j = 1; j <= cur_max+1; j ++){
                ans += dp(i+1, max(cur_max, j), 0);
            }
        }

        return memo[i][cur_max][same_so_far] = ans%MOD;
    }
}*/

int main(){
    scanf("%d", &n);

    prefixMax[0] = 0;
    for(int i = 0; i < n; i ++){
        scanf("%d", &A[i]);
        prefixMax[i+1] = max(prefixMax[i], A[i]);
    }

    for(int i = n; i >= 0; i --){
        //long long prefix_sum = dp[(i+1)&1][max(cur_max, 0)][0];
        for(int cur_max = 0; cur_max <= n; cur_max ++){
            for(int same_so_far = 0; same_so_far < 2; same_so_far ++){
                if(i == n){
                    dp[i&1][cur_max][same_so_far] = 1;
                }else{
                    long long ans = 0;

                    if(same_so_far){
                        if(cur_max == prefixMax[i]){
                            for(int j = 1; j <= A[i]; j ++){
                                ans += dp[(i+1)&1][max(cur_max, j)][j == A[i]];
                            }
                        }
                    }else{
                        //prefix_sum += dp[(i+1)&1][max(cur_max, 0)][0];
                        ans = cur_max*(long long)dp[(i+1)&1][cur_max][0] + dp[(i+1)&1][cur_max+1][0];
                        /*for(int j = 1; j <= cur_max+1; j ++){
                            ans += dp[(i+1)&1][max(cur_max, j)][0];
                        }*/
                    }

                    dp[i&1][cur_max][same_so_far] = ans%MOD;
                }
            }
        }
    }

    printf("%d", dp[0][0][1]);
    return 0;
}

Compilation message

teams.cpp: In function 'int main()':
teams.cpp:36:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
teams.cpp:40:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &A[i]);
         ~~~~~^~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 256 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 5 ms 256 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory 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

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 4 ms 256 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory 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

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 384 KB Output is correct
2 Correct 8 ms 384 KB Output is correct
3 Correct 8 ms 384 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 384 KB Output is correct
2 Correct 12 ms 384 KB Output is correct
3 Correct 12 ms 404 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 787 ms 632 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 185 ms 512 KB Output is correct
2 Correct 180 ms 512 KB Output is correct
3 Correct 206 ms 612 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 738 ms 596 KB Output is correct
2 Correct 730 ms 592 KB Output is correct
3 Correct 832 ms 588 KB Output is correct