oj.uz

Submission #810972

# Submission time Handle Problem Language Result Execution time Memory
810972 2023-08-06T18:46:00 Z JakobZorz Calvinball championship (CEOI15_teams) C++14
90 / 100
 370 ms 660 KB 
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <set>
#include <stack>
#include <limits.h>
#include <math.h>
#include <iomanip>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <cstring>
#include <sstream>
 
#pragma GCC target("popcnt")
 
typedef long long ll;
typedef long double ld;
using namespace std;
const int MOD=1e6+7;
typedef pair<ll,ll>point;
//#define x first
//#define y second
 
int n;
int arr[10000];
ll dp[2][10001][2];

int main(){
    ios::sync_with_stdio(false);
    cout.tie(NULL);
    cin.tie(NULL);
    
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>arr[i];
        arr[i]--;
    }
    
    
    for(int teams=-1;teams<=n;teams++){
        dp[1][teams+1][0]=1;
        dp[1][teams+1][1]=1;
    }
    
    for(int i=n-1;i>=0;i--){
        for(int teams=-1;teams<=n;teams++){
            {
                ll res=0;
                
                res+=(teams+1)*dp[1][teams+1][0];
                
                res+=dp[1][teams+2][0];
                res%=MOD;
                
                dp[0][teams+1][0]=res;
            }
            
            {
                ll res=0;
                
                res+=min(teams+1,arr[i])*dp[1][teams+1][0];
                if(teams>=arr[i])
                    res+=dp[1][teams+1][1];
                
                if(teams+1<=arr[i])
                    res+=dp[1][teams+2][teams+1==arr[i]];
                res%=MOD;
                
                dp[0][teams+1][1]=res;
            }
        }
        
        memcpy(dp[1],dp[0],10001*2*sizeof(ll));
    }
    
    cout<<dp[0][0][1]<<"\n";
    
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 0 ms 468 KB Output is correct
5 Correct 0 ms 468 KB Output is correct
6 Correct 0 ms 468 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

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

Subtask #7
10.0 / 10.0

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

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 370 ms 652 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 468 KB Output is correct
2 Correct 94 ms 564 KB Output is correct
3 Correct 100 ms 564 KB Output is correct

Subtask #10
0 / 10.0

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