oj.uz

Submission #527327

# Submission time Handle Problem Language Result Execution time Memory
527327 2022-02-17T07:57:53 Z squiddy Calvinball championship (CEOI15_teams) C++14
100 / 100
 194 ms 648 KB 
#include <bits/stdc++.h>

using namespace std;
#define FOR(v, s, e) for (int v = s; v < e; v++)
#define FOR_REV(v, s, e) for (int v = e - 1; v >= s; v--)
#define int long long

#define MOD 1000007
int n, ans;
int val[10005], cmax[10005];
int dp[2][10005];

int32_t main() {
	cin >> n;
	cmax[n - 1] = 1;
	FOR_REV(i, 0, n) {
		cin >> val[i];
		if (i != 0)
			cmax[i - 1] = max(cmax[i], val[i]);
	}
	FOR(i, 0, n) {
		dp[0][i] = 1;
	}
	bool flag = false;
	FOR(i, 0, n) {
		ans = (ans + (val[i] - 1) * dp[flag][cmax[i] - 1]) % MOD;
		FOR(j, 0, n - 1) {
			dp[1 - flag][j] = ((j + 1) * dp[flag][j] + dp[flag][j + 1]) % MOD; 
		}
		flag = 1 - flag;
	}
	cout << (ans + 1) % MOD;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 224 KB Output is correct
2 Correct 0 ms 300 KB Output is correct
3 Correct 0 ms 216 KB Output is correct
4 Correct 0 ms 216 KB Output is correct
5 Correct 1 ms 216 KB Output is correct
6 Correct 1 ms 312 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 216 KB Output is correct
2 Correct 1 ms 216 KB Output is correct
3 Correct 1 ms 216 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 208 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 216 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 216 KB Output is correct
2 Correct 1 ms 276 KB Output is correct
3 Correct 1 ms 204 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 332 KB Output is correct
2 Correct 3 ms 332 KB Output is correct
3 Correct 3 ms 300 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 194 ms 648 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 468 KB Output is correct
2 Correct 45 ms 472 KB Output is correct
3 Correct 45 ms 472 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 183 ms 600 KB Output is correct
2 Correct 191 ms 620 KB Output is correct
3 Correct 186 ms 600 KB Output is correct