제출 #906592

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
906592		8pete8	Calvinball championship (CEOI15_teams)	C++17	100 / 100	299 ms	728 KiB

teams

#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<unordered_map>
#include <queue>
#include<cstring>
#include<float.h>
#include<limits.h>
#include <cassert>
#include<cmath>
#include<set>
#include<algorithm>
#include <iomanip>
#include<numeric> //gcd(a,b)
#include<bitset>
using namespace std;
#define ll long long
#define f first
#define endl "\n"
#define s second
#define pii pair<int,ll>
#define ppii pair<int,pii>
#define vi vector<int>
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define ub upper_bound
using namespace std;
#define int long long
#define double long double
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize ("03,unroll-loops")
const int mod=1e6+7,mxn=1e4,lg=22;//inf=1e18,minf=-1e9,Mxn=100000;
int under[mxn+10];
int32_t main(){
	fastio
	int n;cin>>n;
	int mx=0,sum=1,cnt=1;
	for(int i=0;i<n;i++){
		int a;cin>>a;
		cnt=max(cnt,a);
		cnt++;
		for(int j=cnt;j>=1;j--)under[j]=(under[j-1]+((under[j])*j)%mod)%mod;
		for(int j=1;j<a;j++)under[mx]=(under[mx]+1)%mod;
		mx=max(mx,a);
	}
	for(int j=1;j<=cnt;j++)sum=(sum+under[j])%mod;
	cout<<sum;
}

• 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: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10