제출 #1194690

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1194690		SSSM	Calvinball championship (CEOI15_teams)	C++20	100 / 100	234 ms	976 KiB

teams

#include <bits/stdc++.h>

/*
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target ("avx2")
*/

using namespace std;

/*
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
using namespace __gnu_pbds;
template<class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
*/

#define F first
#define S second
#define pb push_back
#define FIO freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout)
#define md(a) ((a%mod+mod)%mod)
#define all(a) a.begin(), a.end()
#define MP make_pair
#define lc (id<<1)
#define rc (lc|1)
#define mid (l+r)/2
#define kill(a) cout << a << "\n", exit(0)
#define SZ(a) (ll)a.size()
typedef pair<int,int> pii;
typedef pair<long long ,long long> pll;
typedef long long ll;
typedef long double ld;
typedef vector<vector<ll>> matrix;
mt19937_64  rng(chrono::steady_clock::now().time_since_epoch().count());

ll const maxn=3e5+10, mod=1e6+7, INF=1e18, LOG=32, sq=65;

ll poww(ll a, ll b, ll mod) {
 if (b == 0) return 1;
 return 1 * poww(1 * a * a % mod, b / 2, mod) * ((b % 2 == 1) ? a : 1) % mod;
}

ll n, ans, A[maxn], mx[maxn], dp[2][maxn];

int main()
{
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

	cin>>n;
	for(ll i=1;i<=n;i++) cin>>A[i], mx[i]=max(mx[i-1], A[i]);

	ll a=0, b=1;
	for(ll i=0;i<=n;i++) dp[a][i]=1;

	for(ll i=n-1;i>=0;i--)
	{
		ans=md(ans+md(dp[a][mx[i]]*(A[i+1]-1)));
		for(ll j=0;j<=n;j++) dp[b][j]=md(dp[a][j+1]+dp[a][j]*j);
		swap(a, b);
	}
	cout<<ans+1<<"\n";
}

• 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