oj.uz

답안 #244443

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
244443 2020-07-04T05:58:42 Z tqbfjotld Calvinball championship (CEOI15_teams) C++14
80 / 100
 1000 ms 760 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long

int mem[10005][2][2];


int n;
int MOD = 1000007LL;
int arr[10005];

main(){
    scanf("%lld",&n);
    for (int x = 0; x<n; x++){
        scanf("%lld",&arr[x]);
    }
    memset(mem,-1,sizeof(mem));
    for (int x = n-1; x>=0; x--){
        for (int high = 1; high<=x+1; high++){
            for (int bound = 0; bound<2; bound++){
                if (x == n-1){
                    mem[high][bound][0] = bound?arr[x]:high+1;
                    //printf("pos %lld high %lld bound %lld: %lld\n",x,high,bound,mem[high][bound][0]);
                    continue;
                }
                if (bound){
                    mem[high][bound][0] = mem[max(high,arr[x]-1)][0][1]*(arr[x]-1);
                    mem[high][bound][0] %= MOD;
                    mem[high][bound][0] += mem[max(high,arr[x])][1][1];
                    mem[high][bound][0] %= MOD;
                }
                else{
                    mem[high][bound][0] = high*mem[high][0][1];
                    mem[high][bound][0]%=MOD;
                    mem[high][bound][0] += mem[high+1][0][1];
                    mem[high][bound][0] %= MOD;
                }
                //printf("pos %lld high %lld bound %lld: %lld\n",x,high,bound,mem[high][bound][0]);
            }
        }
        for (int h = 1; h<=x+1; h++){
            mem[h][0][1] = mem[h][0][0];
            mem[h][1][1] = mem[h][1][0];
            mem[h][0][0] = 0;
            mem[h][1][0] = 0;
        }
    }
    printf("%lld",mem[1][1][1]);
}
/*
1 1 1 1
1 1 1 2
1 1 2 1
1 1 2 2
1 1 2 3
1 2 1 1
1 2 1 2
1 2 1 3
1 2 2 1
1 2 2 2
1 2 2 3
1 2 3 1
1 2 3 2
1 2 3 3
1 2 3 4


*/

Compilation message

teams.cpp:12:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){
      ^
teams.cpp: In function 'int main()':
teams.cpp:13:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld",&n);
     ~~~~~^~~~~~~~~~~
teams.cpp:15:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld",&arr[x]);
         ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

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

Subtask #7
10.0 / 10.0

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

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1096 ms 640 KB Time limit exceeded

Subtask #9
10.0 / 10.0

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

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1091 ms 640 KB Time limit exceeded
2 Halted 0 ms 0 KB -