oj.uz

Submission #62531

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

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

int 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 int 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--)
	{
		if(i >= 2)
		{
			for(int k = n; k >= 1; k--)
			{
				if(i > n) dp[A][k] = 1;

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

					dp[A][k] += dp[B][k + 1];

					if(dp[A][k] >= mod) dp[A][k] -= mod;
				}
			}
		}

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

			if(tot >= mod) tot -= 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 2 ms 376 KB Output is correct
2 Correct 2 ms 452 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 492 KB Output is correct
6 Correct 3 ms 568 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 696 KB Output is correct
2 Correct 3 ms 696 KB Output is correct
3 Incorrect 3 ms 696 KB Output isn't correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 696 KB Output is correct
2 Correct 7 ms 696 KB Output is correct
3 Incorrect 7 ms 696 KB Output isn't correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 20 ms 696 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1050 ms 1132 KB Time limit exceeded

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 393 ms 1132 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

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