oj.uz

Submission #163300

# Submission time Handle Problem Language Result Execution time Memory
163300 2019-11-12T13:40:28 Z dantoh000 Calvinball championship (CEOI15_teams) C++14
30 / 100
 230 ms 556 KB 
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000007;
int main(){
    int n; scanf("%d",&n);
    int a[n];
    int k[n];
    for (int i = 0; i < n; i++) {
        scanf("%d",&a[i]);
        if (i) k[i] = max(k[i-1],a[i]);
        else k[i] = a[i];
    }
    int ct[2][n+1];
    int ans = a[n-1];
    for (int i = 1; i <= n; i++){
        ct[0][i] = 1;
    }
    for (int j = 1; j < n; j++){
        ct[j%2][1] = ct[1-j%2][1];
        for (int i = 2; i < n; i++){
            ct[j%2][i] = (i-1)*ct[1-j%2][i]+ct[1-j%2][i+1];
            ct[j%2][i] %= mod;
        }
        //printf("adding %d %d\n",a[n-j-1]-1,ct[j%2][k[n-j-1]]);
        ans += (a[n-j-1]-1)*ct[j%2][k[n-j-1]];
        ans %= mod;
    }
    printf("%d",ans);

}

Compilation message

teams.cpp: In function 'int main()':
teams.cpp:5:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     int n; scanf("%d",&n);
            ~~~~~^~~~~~~~~
teams.cpp:9: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 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

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

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 227 ms 556 KB Output isn't correct

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 59 ms 504 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 230 ms 548 KB Output isn't correct
2 Halted 0 ms 0 KB -