oj.uz

Submission #496695

# Submission time Handle Problem Language Result Execution time Memory
496695 2021-12-21T22:18:46 Z aryan12 Calvinball championship (CEOI15_teams) C++17
100 / 100
 486 ms 656 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());

const int MOD = 1e6 + 7;

void Solve() {
	int n;
	cin >> n;
	int a[n + 1], mx[n + 1];
	mx[0] = 0;
	for(int i = 1; i <= n; i++) {
		cin >> a[i];
		mx[i] = max(mx[i - 1], a[i]);
	}
	int dp[2][n + 5];
	for(int i = 0; i <= n + 4; i++) {
		dp[0][i] = 1;
	}
	int ans = 1;
	for(int i = n - 1; i > 0; i--) {
		int cur = (n - i) % 2, prev = 1 - cur;
		for(int j = 1; j <= n; j++) {
			int x = (dp[prev][j] * j) % MOD;
			x += dp[prev][j + 1];
			x %= MOD;
			dp[cur][j] = x;
		}
		for(int j = a[i] - 1; j > 0; j--) {
			int temp = max(mx[i - 1], j);
			ans += dp[cur][temp];
			ans %= MOD;
		}
	}
	cout << (ans + a[n] - 1) % MOD << "\n";
}

int32_t main() {
	auto begin = std::chrono::high_resolution_clock::now();
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int t = 1;
	//cin >> t;
	while(t--) {
		Solve();
	}
	auto end = std::chrono::high_resolution_clock::now();
    auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
    cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n"; 
	return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 324 KB Output is correct
5 Correct 0 ms 324 KB Output is correct
6 Correct 0 ms 320 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

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

Subtask #7
10.0 / 10.0

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

Subtask #8
10.0 / 10.0

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

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 460 KB Output is correct
2 Correct 72 ms 464 KB Output is correct
3 Correct 128 ms 468 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 311 ms 632 KB Output is correct
2 Correct 285 ms 624 KB Output is correct
3 Correct 486 ms 592 KB Output is correct