제출 #810959

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
810959		JakobZorz	Calvinball championship (CEOI15_teams)	C++14	60 / 100	1068 ms	7920 KiB

teams

#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[1000][1000][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[n][teams+1][0]=1;
        dp[n][teams+1][1]=1;
    }
    
    for(int i=n-1;i>=0;i--){
        for(int teams=-1;teams<=n;teams++){
            {
                ll res=0;
                
                for(int new_team=0;new_team<=teams;new_team++){
                    res+=dp[i+1][teams+1][0];
                    res%=MOD;
                }
                
                res+=dp[i+1][teams+2][0];
                res%=MOD;
                
                dp[i][teams+1][0]=res;
            }
            
            {
                ll res=0;
                
                for(int new_team=0;new_team<=teams;new_team++){
                    if(new_team<=arr[i]){
                        res+=dp[i+1][teams+1][new_team==arr[i]];
                        res%=MOD;
                    }
                }
                if(teams+1<=arr[i]){
                    res+=dp[i+1][teams+2][teams+1==arr[i]];
                    res%=MOD;
                }
                
                dp[i][teams+1][1]=res;
            }
        }
    }
    
    cout<<dp[0][0][true]<<"\n";
    
    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10