oj.uz

Submission #93733

# Submission time Handle Problem Language Result Execution time Memory
93733 2019-01-10T23:31:18 Z abood101 Calvinball championship (CEOI15_teams) C++14
80 / 100
 1000 ms 504 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef pair<int,int > pp;
typedef long long ll;
 
int const N=1e4+2,oo=1e9,M=1e6;
ll const OO=1e18;
double const eps=1e-6,PI=acos(-1);
int mod=M+7;
 
int n,aa[N],dp[2][N][2];
int main(){
    scanf("%d",&n);
    for(int i=0;i<n;i++)scanf("%d",&aa[i]);
    int f=0,an=0;
    for(int i=1;i<=n;i++)dp[f][i][0]=dp[f][i][1]=1;
    for(int i=n-2;i>-1;i--){
        f=1-f;
        for(int j=1;j<=n;j++){
            dp[f][j][1]=(dp[!f][j][1]*1LL*j+dp[!f][j+1][1])%mod;
            if(aa[i+1]>j)dp[f][j][0]=(dp[!f][j][1]*1LL*j+(aa[i+1]==j+1)*dp[!f][aa[i+1]][0])%mod;
            else dp[f][j][0]=(dp[!f][j][1]*1LL*(aa[i+1]-1)+dp[!f][j][0])%mod;
        }
    }
    printf("%d\n",dp[f][1][0]);
    return 0;
}

Compilation message

teams.cpp: In function 'int main()':
teams.cpp:16:13: warning: unused variable 'an' [-Wunused-variable]
     int f=0,an=0;
             ^~
teams.cpp:14:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
     ~~~~~^~~~~~~~~
teams.cpp:15:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i=0;i<n;i++)scanf("%d",&aa[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 376 KB Output is correct
3 Correct 2 ms 380 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 256 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

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

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 376 KB Output is correct
2 Correct 22 ms 376 KB Output is correct
3 Correct 23 ms 420 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1058 ms 504 KB Time limit exceeded

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 539 ms 468 KB Output is correct
2 Correct 507 ms 504 KB Output is correct
3 Correct 523 ms 376 KB Output is correct

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1073 ms 504 KB Time limit exceeded
2 Halted 0 ms 0 KB -