제출 #810950

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
810950		JakobZorz	Calvinball championship (CEOI15_teams)	C++14	30 / 100	1083 ms	1108 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];
int res=0;

void get(int i,int teams,bool equal){
    if(i==n){
        res++;
        return;
    }
    
    //ll res=0;
    
    for(int new_team=0;new_team<=teams;new_team++){
        //res+=get(i+1,teams,bigger||new_team>arr[i]);
        if(new_team<=arr[i]||!equal)
            get(i+1,teams,equal&&new_team==arr[i]);
    }
    //res+=get(i+1,teams+1,teams+1>arr[i]);
    if(teams+1<=arr[i]||!equal)
        get(i+1,teams+1,equal&&teams+1==arr[i]);
    
    //return res;
}

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]--;
    }
    
    //cout<<get(0,0,false)<<"\n";
    get(0,-1,true);
    cout<<res%MOD<<"\n";
    
    return 0;
}

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