oj.uz

Submission #647492

# Submission time Handle Problem Language Result Execution time Memory
647492 2022-10-02T21:06:12 Z ymm Calvinball championship (CEOI15_teams) C++17
100 / 100
 370 ms 724 KB 
#include <bits/stdc++.h>
#define Loop(x,l,r) for (ll x = (l); x < (ll)(r); ++x)
#define LoopR(x,l,r) for (ll x = (r)-1; x >= (ll)(l); --x)
typedef long long ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll , ll > pll;
using namespace std;

const int N = 10'010;
const int mod = 1e6+7;
ll dp[2][N];
ll dp_lte[2][N];
int a[N];
int n;

void update_dp(int i)
{
	int i2 = i&1;
	Loop (mx_st,0,N-1) {
		dp[i2][mx_st] = mx_st*dp[!i2][mx_st] + dp[!i2][mx_st+1];
		if (mx_st < a[i])
			dp_lte[i2][mx_st] = dp[i2][mx_st];
		else if (mx_st == a[i])
			dp_lte[i2][mx_st] = mx_st*dp[!i2][mx_st] + dp_lte[!i2][mx_st+1];
		else /* mx_st > a[i] */
			dp_lte[i2][mx_st] = a[i]*dp[!i2][mx_st] + dp_lte[!i2][mx_st];
		dp[i2][mx_st] %= mod;
		dp_lte[i2][mx_st] %= mod;
	}
}

int main()
{
	cin.tie(0) -> sync_with_stdio(false);
	cin >> n;
	Loop (i,0,n) {
		cin >> a[i];
		--a[i];
	}
	Loop (i,0,N)
		dp[n&1][i] = dp_lte[n&1][i] = 1;
	LoopR (i,0,n)
		update_dp(i);
	cout << dp_lte[0][0] << '\n';
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 636 KB Output is correct
2 Correct 19 ms 596 KB Output is correct
3 Correct 19 ms 644 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 628 KB Output is correct
2 Correct 36 ms 596 KB Output is correct
3 Correct 41 ms 608 KB Output is correct

Subtask #8
10.0 / 10.0

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

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 197 ms 640 KB Output is correct
2 Correct 200 ms 656 KB Output is correct
3 Correct 197 ms 596 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 364 ms 652 KB Output is correct
2 Correct 363 ms 724 KB Output is correct
3 Correct 370 ms 724 KB Output is correct