제출 #527127

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
527127		hmm789	Calvinball championship (CEOI15_teams)	C++14	70 / 100	38 ms	65540 KiB

teams

#include <bits/stdc++.h>
using namespace std;

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	#define int long long
	#define MOD 1000007
	int n, ans = 0, mx = 0;
	cin >> n;
	int a[n];
	for(int i = 0; i < n; i++) cin >> a[i];
	int dp[n][n+1], npow = 1;
	for(int i = 0; i < n; i++) {
		dp[i][n] = npow;
		npow *= n;
		npow %= MOD;
	}
	for(int i = 0; i < n; i++) {
		for(int j = n-1; j >= 0; j--) {
			if(i == 0) dp[i][j] = 1;
			else dp[i][j] = j*dp[i-1][j] + dp[i-1][j+1];
			dp[i][j] %= MOD;
		}
	}
	for(int i = 0; i < n; i++) {
		ans += (a[i]-1)*dp[n-i-1][mx];
		mx = max(mx, a[i]);
		ans %= MOD;
	}
	cout << (ans+1)%MOD;
}

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