oj.uz

Submission #244560

# Submission time Handle Problem Language Result Execution time Memory
244560 2020-07-04T09:42:59 Z SomeoneUnknown Calvinball championship (CEOI15_teams) C++14
70 / 100
 60 ms 65540 KB 
#include <bits/stdc++.h>
using namespace std;

int main(){
    long long n;
    scanf("%lld", &n);
    long long dp[n+1][n+1]; //ways to fill A slots with a previously used B
    for(long long i = 0; i <= n; i++){
        dp[0][i] = 1;
    }
    for(long long i = 1; i <= n; i++){
        for(long long j = 0; j <= n-i; j++){
            dp[i][j] = dp[i-1][j+1] + (j * dp[i-1][j]);
            dp[i][j] %= 1000007;
        }
    }
    long long tal = 1;
    long long hsf = 0;
    for(long long i = 1; i <= n; i++){
        long long x;
        scanf("%lld", &x);
        tal += dp[n-i][hsf] * (x-1);
        tal %= 1000007;
        hsf = max(hsf, x);
    }
    printf("%lld", tal);
}

Compilation message

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

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 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 256 KB Output is correct
3 Correct 4 ms 384 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 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 4 ms 384 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 512 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 2304 KB Output is correct
2 Correct 5 ms 2304 KB Output is correct
3 Correct 6 ms 2304 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7296 KB Output is correct
2 Correct 9 ms 7296 KB Output is correct
3 Correct 9 ms 7168 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 60 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 58 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 56 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -