oj.uz

Submission #125466

# Submission time Handle Problem Language Result Execution time Memory
125466 2019-07-05T11:39:33 Z eriksuenderhauf Calvinball championship (CEOI15_teams) C++11
70 / 100
 21 ms 4348 KB 
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define mem(a,v) memset((a), (v), sizeof (a))
#define enl printf("\n")
#define case(t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%I64d", &(n))
#define nai(a, n) for (int i = 0; i < (n); i++) ni(a[i])
#define nal(a, n) for (int i = 0; i < (n); i++) nl(a[i])
#define pri(n) printf("%d\n", (n))
#define prl(n) printf("%I64d\n", (n))
#define pii pair<int, int>
#define pil pair<int, long long>
#define pll pair<long long, long long>
#define vii vector<pii>
#define vil vector<pil>
#define vll vector<pll>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef cc_hash_table<int,int,hash<int>> ht;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> oset;
const double pi = acos(-1);
const int MOD = 1e6 + 7;
const int MAXN = 1e3 + 5;
const double eps = 1e-9;
int a[MAXN], dp[MAXN][MAXN];

int dfs(int len, int mx) {
	if (len == 0) return 1;
	if (dp[len][mx]) return dp[len][mx];
	int ret = (1ll * (ll) dfs(len-1, mx) * (ll) mx) % MOD;
	ret = (ret + dfs(len-1, mx+1)) % MOD;
	return dp[len][mx] = ret;
}

int main() {
	int n; ni(n);
	for (int i = 0; i < n; i++)
		ni(a[i]);
	dfs(MAXN-2, 1);//exit(0);
	/*for (int i = 1; i <= 20; i++) {
		for (int j = 1; j <= 20; j++) {
			dfs(i, j);
			cerr << "len:" << i+1 << " || maximum: " << j << " || value: " << dp[i][j]-1 << "\n";
		}
		cerr << "\n";
	}*/
	int ans = 1, mx = 1;
	for (int i = 1; i < n; i++) {
		if (n-i-1 != 0 && !dp[n-i-1][mx]) return -1;
		ans = (ans + 1ll * (ll)dfs(n - i - 1, mx) * (ll) min(mx, a[i]-1)) % MOD;
		for (int j = mx+1; j < a[i]; j++) {
			if (n-i-1 != 0 && !dp[n-i-1][j]) return -1;
			ans = (ans + dfs(n - i - 1, j)) % MOD;
		}
		mx = max(mx, a[i]);
	}
	printf("%d\n", ans);
    return 0;
}

Compilation message

teams.cpp: In function 'int main()':
teams.cpp:9:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define ni(n) scanf("%d", &(n))
               ~~~~~^~~~~~~~~~~~
teams.cpp:47:9: note: in expansion of macro 'ni'
  int n; ni(n);
         ^~
teams.cpp:9:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define ni(n) scanf("%d", &(n))
               ~~~~~^~~~~~~~~~~~
teams.cpp:49:3: note: in expansion of macro 'ni'
   ni(a[i]);
   ^~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 4344 KB Output is correct
2 Correct 13 ms 4344 KB Output is correct
3 Correct 14 ms 4344 KB Output is correct
4 Correct 16 ms 4344 KB Output is correct
5 Correct 13 ms 4344 KB Output is correct
6 Correct 15 ms 4344 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 4348 KB Output is correct
2 Correct 13 ms 4344 KB Output is correct
3 Correct 14 ms 4216 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 4344 KB Output is correct
2 Correct 16 ms 4344 KB Output is correct
3 Correct 21 ms 4344 KB Output is correct

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 4344 KB Output is correct
2 Correct 15 ms 4344 KB Output is correct
3 Correct 12 ms 4344 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 4344 KB Output is correct
2 Correct 14 ms 4344 KB Output is correct
3 Correct 19 ms 4344 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2 ms 256 KB Time limit exceeded (wall clock)

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2 ms 256 KB Time limit exceeded (wall clock)
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2 ms 256 KB Time limit exceeded (wall clock)
2 Halted 0 ms 0 KB -