oj.uz

답안 #163380

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
163380 2019-11-13T04:08:15 Z dantoh000 Calvinball championship (CEOI15_teams) C++14
10 / 100
 193 ms 632 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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];
    }
    ll ct[2][n+1];
    ll ans = 0;
    for (int i = 0; i <= n; i++){
        ct[0][i] = 1;
    }
    for (int j = 0; j < n-1; j++){
        //printf("before: %d unique numbers, adding %d %lld\n",k[n-j-2],a[n-j-1]-1,ct[j%2][k[n-j-2]]);
        ans += (a[n-j-1]-1)*ct[j%2][k[n-j-2]];
        ans %= mod;
        for (int i = 1; i < n; i++){
            ct[1-j%2][i] = ct[j%2][i]+ct[j%2][i+1];
            ct[1-j%2][i] %= mod;
        }

    }
    printf("%d",ans+1);

}

Compilation message

teams.cpp: In function 'int main()':
teams.cpp:29:22: warning: format '%d' expects argument of type 'int', but argument 2 has type 'll {aka long long int}' [-Wformat=]
     printf("%d",ans+1);
                 ~~~~~^
teams.cpp:6: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:10: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

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

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Incorrect 2 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

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

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 256 KB Output isn't correct

Subtask #5
0 / 10.0

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

Subtask #6
0 / 10.0

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

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 190 ms 628 KB Output isn't correct

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

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