oj.uz

Submission #125468

# Submission time Handle Problem Language Result Execution time Memory
125468 2019-07-05T11:54:13 Z eriksuenderhauf Calvinball championship (CEOI15_teams) C++11
100 / 100
 116 ms 564 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 = 1e4 + 5;
const double eps = 1e-9;
int a[MAXN], dp[2][MAXN], mx[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);
	mx[0] = 1;
	for (int i = 0; i < n; i++) {
		ni(a[i]);
		if (i) mx[i] = max(mx[i-1], a[i]);
	}
	int ans = min(mx[n-2],a[n-1]-1) + 1;
	for (int j = mx[n-2]+1; j < a[n-1]; j++)
		ans++;
	fill(dp[0], dp[0] + MAXN, 1);
	for (int i = n-2; i > 0; i--) {
		int idx = (n-i-1) & 1;
		for (int j = 1; j <= i; j++)
			dp[idx][j] = (1ll * (ll) dp[idx^1][j] * (ll) j + (ll) dp[idx^1][j+1]) % MOD;
		ans = (ans + 1ll * (ll) dp[idx][mx[i-1]] * (ll) min(mx[i-1], a[i]-1)) % MOD;
		for (int j = mx[i-1] + 1; j < a[i]; j++)
			ans = (ans + dp[idx][j]) % MOD;
	}
	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:50:3: note: in expansion of macro 'ni'
   ni(a[i]);
   ^~

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 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 380 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

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

Subtask #7
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 3 ms 376 KB Output is correct

Subtask #8
10.0 / 10.0

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

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 376 KB Output is correct
2 Correct 30 ms 504 KB Output is correct
3 Correct 30 ms 504 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 116 ms 544 KB Output is correct
2 Correct 112 ms 552 KB Output is correct
3 Correct 115 ms 564 KB Output is correct