oj.uz

Submission #38179

# Submission time Handle Problem Language Result Execution time Memory
38179 2018-01-02T18:05:23 Z farmersrice Calvinball championship (CEOI15_teams) C++14
60 / 100
 776 ms 65536 KB 
#include <bits/stdc++.h>
//#pragma GCC optimize ("O3")
//#pragma GCC target ("sse4")
#pragma GCC target ("avx,tune=native")
//Use above if bruteforcing with lots of small operations. Or just use it anytime, there's no downside. AVX is better slightly
/*
TASK: hidden
LANG: C++11
*/
using namespace std;
typedef long long ll;
typedef pair<int, int> pair2;
typedef pair<int, pair<int, int> > pair3;
typedef pair<int, pair<int, pair<int, int> > > pair4;
#define MAXN 1013
#define INF 1000000000000000000LL
#define mp make_pair
#define add push_back
#define remove pop
#define MOD 1000007

int n;
int values[MAXN];
//int dp[MAXN][MAXN]; //dp[i][j]: num ways from point i IF the highest number that appears before us is j (implying value of i is at most j + 1)
//dp[i][j] = dp[i + 1][j] * j + dp[i + 1][j + 1]

map<int, map<int, int> > dp;
int solve(int index, int first) {
	if (first < 0 || first > n) return 0;
	if (first == 0) return dp[index][first] = solve(index + 1, first + 1);
	if (index == n) return 1;

	if (dp[index].find(first) != dp[index].end()) {
		return dp[index][first];
	}

	ll answer = solve(index + 1, first) * first * 1LL + solve(index + 1, first + 1);
	answer %= MOD * 1LL;

	return dp[index][first] = (int) answer;
}

int main() {
	ios_base::sync_with_stdio(false); 
	cin.tie(NULL);

	cin >> n;

	for (int i = 0; i < n; i++) {
		cin >> values[i];
	}	

	ll answer = 0;
	int highestNum = 0;
	for (int i = 0; i < n; i++) {
		//highestNum = max(highestNum, values[i]);

		//if (highestNum == 1) continue;
		answer += (1LL * (values[i] - 1) * solve(i + 1, highestNum)) % MOD;
		//cout << "solve " << i << " " << min(values[i] - 2, highestNum - 1) << " is " << solve(i, min(values[i] - 2, highestNum - 1)) << endl;
		answer %= MOD * 1LL;

		highestNum = max(highestNum, values[i]);
	}

	cout << answer + 1 << endl;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2184 KB Output is correct
2 Correct 0 ms 2184 KB Output is correct
3 Correct 0 ms 2184 KB Output is correct
4 Correct 0 ms 2184 KB Output is correct
5 Correct 0 ms 2184 KB Output is correct
6 Memory limit exceeded 169 ms 65536 KB Memory limit exceeded

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

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

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 716 ms 25548 KB Output is correct
2 Correct 669 ms 25548 KB Output is correct
3 Correct 689 ms 25548 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 776 ms 26340 KB Output isn't correct

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

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