oj.uz

Submission #281192

# Submission time Handle Problem Language Result Execution time Memory
281192 2020-08-23T03:50:22 Z AQT Calvinball championship (CEOI15_teams) C++14
80 / 100
 1000 ms 42368 KB 
#include <bits/stdc++.h>

using namespace std;

int N;
int arr[10005];
int dp[4005][10005];
const long long MOD = 1000007;

long long solve(int n, int m, bool border){
	if(n == N+1){
		return 1;
	}
	if(!border && n%3 == 0 && dp[n/3][m]){
		return dp[n/3][m];
	}
	int lim = m+1;
	if(border){
		lim = arr[n];
	}
	long long ans = 0;
	ans += 1LL * (lim-1) * solve(n+1, m, 0);
	ans += solve(n+1, max(lim, m), border);
	ans %= MOD;
	if(!border && n%3 == 0){
		dp[n/3][m] = ans;
	}
	return ans;
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> N;
	for(int i = 1; i<=N; i++){
		cin >> arr[i];
	}
	cout << solve(1, 0, 1);
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

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

Subtask #7
10.0 / 10.0

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

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1076 ms 42296 KB Time limit exceeded

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 511 ms 23672 KB Output is correct
2 Correct 474 ms 23560 KB Output is correct
3 Correct 579 ms 23628 KB Output is correct

Subtask #10
0 / 10.0

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