oj.uz

Submission #62529

# Submission time Handle Problem Language Result Execution time Memory
62529 2018-07-29T00:20:28 Z MatheusLealV Calvinball championship (CEOI15_teams) C++17
80 / 100
 1000 ms 1388 KB 
#include <bits/stdc++.h>
#define N 10001
using namespace std;
typedef long long ll;

ll n, k, v[N], tot, used[N], mod = 1000007;

ll dp[2][N], pref[N];

int solve(int i, int k)
{
	if(i > n) return 1;

	if(dp[i][k] != -1) return dp[i][k];

	ll A = (((ll)solve(i + 1, k) * (ll)k) % mod + solve(i + 1, k + 1) % mod)%mod;

	return dp[i][k] = A;
}

inline ll pos()
{
	set<int> add;

	for(int i = 1; i <= n; i++)
	{
		pref[i] = add.size();

		add.insert(v[i]);
	}

	int A = (n + 1)%2, B = n%2;

	for(int i = n + 1; i >= 1; i--)
	{
		for(int k = n; k >= 1; k--)
		{
			if(i > n) dp[A][k] = 1;

			else
			{
				dp[A][k] = ( (ll)k * dp[B][k] + dp[B][k + 1])%mod;
			}
		}

		if(i <= n) tot = (tot + dp[B][ pref[i] ]*(v[i] - 1LL) )%mod;

		swap(A, B);
	}

	return (tot + 1)%mod;
}

int main()
{
	ios::sync_with_stdio(false); cin.tie(0);

	cin>>n;

	for(int i = 1; i <= n; i++) cin>>v[i];

	cout<<pos()<<"\n";
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 2 ms 432 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 3 ms 468 KB Output is correct
6 Correct 3 ms 484 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 596 KB Output is correct
2 Correct 9 ms 724 KB Output is correct
3 Correct 7 ms 748 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 748 KB Output is correct
2 Correct 26 ms 748 KB Output is correct
3 Correct 20 ms 748 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1052 ms 1388 KB Time limit exceeded

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 372 ms 1388 KB Output is correct
2 Correct 401 ms 1388 KB Output is correct
3 Correct 378 ms 1388 KB Output is correct

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1065 ms 1388 KB Time limit exceeded
2 Halted 0 ms 0 KB -