oj.uz

Submission #107103

# Submission time Handle Problem Language Result Execution time Memory
107103 2019-04-22T01:33:25 Z LamoreauxAJ Calvinball championship (CEOI15_teams) C++14
100 / 100
 376 ms 620 KB 
#include <bits/stdc++.h>
using namespace std;

const int MOD = 1000007;

int N, nums[10000], prefMax[10000];
int f[2][10001];

int main() {
	ios_base::sync_with_stdio(false);
	// freopen("1.in", "r", stdin);

	cin >> N;
	for (int i = 0; i < N; i++)
		cin >> nums[i];

	for (int i = 0; i < N; i++) {
		if (i == 0)
			prefMax[i] = nums[i];
		else
			prefMax[i] = max(prefMax[i - 1], nums[i]);
	}

	for (int i = 0; i <= N; i++)
		f[1][i] = 1;
	int ans = 1;
	for (int i = N - 1; i >= 0; i--) {
		int maxSoFar = i == 0 ? 0 : prefMax[i - 1];
		for (int j = 1; j < nums[i]; j++) {
			ans = (ans + f[1][max(maxSoFar, j)]) % MOD;
		}
		for (int j = 0; j <= i; j++) {
			f[0][j] = (int) (((long long) j * f[1][j] + f[1][j + 1]) % MOD);
		}
		for (int j = 0; j <= i + 1; j++)
			f[1][j] = f[0][j];
	}

	cout << ans << "\n";

	return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

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

Subtask #7
10.0 / 10.0

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

Subtask #8
10.0 / 10.0

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

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 512 KB Output is correct
2 Correct 29 ms 384 KB Output is correct
3 Correct 86 ms 496 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 113 ms 564 KB Output is correct
2 Correct 117 ms 592 KB Output is correct
3 Correct 376 ms 584 KB Output is correct