oj.uz

Submission #22668

# Submission time Handle Problem Language Result Execution time Memory
22668 2017-04-30T06:19:11 Z 카시코이(#958, xdoju, ntopia, pps789) Unifying Values (KRIII5_UV) C++14
2 / 7
 500 ms 37020 KB 
#include <cstdio>
#include <cstring>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;

const int MOD = 1000000007;

int n;
long long arr[10004];
long long sum[10004];
long long allsum;

int main() {
	//freopen("input.txt", "r", stdin);
	scanf("%d", &n);
	for (int i = 1; i <= n; ++i) {
		scanf("%lld", &arr[i]);
		sum[i] = sum[i - 1] + arr[i];
	}
	allsum = sum[n];

	map<long long, vector<int>> posbysum;
	for (int i = 0; i <= n; ++i) {
		posbysum[sum[i]];
		posbysum[sum[i]].push_back(i);
	}

	long long ans = 0;

	if (allsum == 0) {
		int ppcnt = 0;
		long long ss = 0;
		for (int i = 1; i <= n; ++i) {
			ss += arr[i];
			if (ss == 0) {
				++ppcnt;
			}
		}

		ans = 1;
		for (int k = 1; k < ppcnt; ++k) {
			ans = (ans * 2ll) % MOD;
		}
		ans = (ans - 1 + MOD) % MOD;
		printf("%d\n", ans);

		return 0;
	}

	vector<int> cand;
	for (int i = 2; i <= n; ++i) {
		if (allsum % i == 0) {
			cand.push_back(i);
		}
	}

	posbysum[0] = vector<int>{ 0 };

	vector<vector<int>> sum1(n + 1), prefix(n + 1);
	for (int cnt : cand) {
		long long targetsum = allsum / cnt;

		sum1[0] = vector<int>{ 1 };
		prefix[0] = vector<int>{ 1 };
		for (int k = 1; k <= cnt; ++k) {
			long long ss = targetsum * k;
			vector<int>& curidx = posbysum[ss];
			vector<int>& prvidx = posbysum[targetsum * (k - 1)];
			sum1[k].resize(curidx.size(), 0);
			prefix[k].resize(curidx.size(), 0);

			int p = 0;
			for (int j = 0; j < curidx.size(); ++j) {
				while (p < prvidx.size() && prvidx[p] < curidx[j]) {
					++p;
				}
				sum1[k][j] = (p == 0) ? 0 : prefix[k - 1][p - 1];
				prefix[k][j] = (j == 0 ? 0 : prefix[k][j - 1]) + sum1[k][j];
				prefix[k][j] %= MOD;
			}
		}

		ans += sum1[cnt].back();
	}
	printf("%d\n", ans % MOD);

	return 0;
}

Compilation message

UV.cpp: In function 'int main()':
UV.cpp:47:21: warning: format '%d' expects argument of type 'int', but argument 2 has type 'long long int' [-Wformat=]
   printf("%d\n", ans);
                     ^
UV.cpp:75:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int j = 0; j < curidx.size(); ++j) {
                      ^
UV.cpp:76:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while (p < prvidx.size() && prvidx[p] < curidx[j]) {
              ^
UV.cpp:87:26: warning: format '%d' expects argument of type 'int', but argument 2 has type 'long long int' [-Wformat=]
  printf("%d\n", ans % MOD);
                          ^
UV.cpp:17:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
UV.cpp:19:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld", &arr[i]);
                         ^

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2096 KB Output is correct
2 Correct 0 ms 2096 KB Output is correct
3 Correct 0 ms 2096 KB Output is correct
4 Correct 6 ms 4284 KB Output is correct
5 Correct 9 ms 4284 KB Output is correct
6 Correct 0 ms 2236 KB Output is correct
7 Correct 3 ms 3096 KB Output is correct
8 Correct 3 ms 3096 KB Output is correct
9 Correct 3 ms 3096 KB Output is correct
10 Correct 0 ms 2700 KB Output is correct
11 Correct 0 ms 2700 KB Output is correct
12 Correct 0 ms 2700 KB Output is correct
13 Correct 3 ms 3096 KB Output is correct
14 Correct 3 ms 3096 KB Output is correct
15 Correct 3 ms 3096 KB Output is correct
16 Correct 3 ms 2964 KB Output is correct
17 Correct 3 ms 2832 KB Output is correct
18 Correct 0 ms 2700 KB Output is correct
19 Correct 0 ms 2228 KB Output is correct
20 Correct 0 ms 2228 KB Output is correct
21 Correct 0 ms 2232 KB Output is correct
22 Correct 0 ms 2236 KB Output is correct
23 Correct 0 ms 2252 KB Output is correct
24 Correct 0 ms 2248 KB Output is correct
25 Correct 0 ms 2252 KB Output is correct
26 Correct 0 ms 2232 KB Output is correct
27 Correct 0 ms 2700 KB Output is correct
28 Correct 0 ms 2700 KB Output is correct
29 Correct 0 ms 2700 KB Output is correct
30 Correct 0 ms 2700 KB Output is correct
31 Correct 0 ms 2832 KB Output is correct
32 Correct 0 ms 2832 KB Output is correct
33 Correct 0 ms 2700 KB Output is correct
34 Correct 0 ms 2700 KB Output is correct
35 Correct 0 ms 2832 KB Output is correct
36 Correct 0 ms 2832 KB Output is correct
37 Correct 3 ms 2832 KB Output is correct
38 Correct 3 ms 2832 KB Output is correct
39 Correct 3 ms 2832 KB Output is correct
40 Correct 0 ms 2832 KB Output is correct
41 Correct 3 ms 2832 KB Output is correct
42 Correct 3 ms 2832 KB Output is correct
43 Correct 3 ms 2964 KB Output is correct
44 Correct 3 ms 2832 KB Output is correct
45 Correct 3 ms 2832 KB Output is correct
46 Correct 3 ms 2832 KB Output is correct
47 Correct 3 ms 2832 KB Output is correct
48 Correct 3 ms 2832 KB Output is correct
49 Correct 3 ms 2964 KB Output is correct
50 Correct 3 ms 2964 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 3360 KB Output is correct
2 Correct 3 ms 3624 KB Output is correct
3 Correct 3 ms 3360 KB Output is correct
4 Correct 0 ms 2700 KB Output is correct
5 Correct 3 ms 2964 KB Output is correct
6 Correct 0 ms 2700 KB Output is correct
7 Correct 3 ms 4020 KB Output is correct
8 Correct 6 ms 3624 KB Output is correct
9 Correct 0 ms 2700 KB Output is correct
10 Correct 3 ms 3492 KB Output is correct
11 Correct 3 ms 3624 KB Output is correct
12 Correct 6 ms 4284 KB Output is correct
13 Correct 6 ms 4416 KB Output is correct
14 Correct 6 ms 4152 KB Output is correct
15 Correct 6 ms 3756 KB Output is correct
16 Correct 6 ms 3624 KB Output is correct
17 Correct 19 ms 6396 KB Output is correct
18 Correct 26 ms 6396 KB Output is correct
19 Correct 0 ms 2236 KB Output is correct
20 Correct 6 ms 3152 KB Output is correct
21 Correct 3 ms 3152 KB Output is correct
22 Correct 6 ms 3152 KB Output is correct
23 Correct 3 ms 2624 KB Output is correct
24 Correct 0 ms 2368 KB Output is correct
25 Correct 0 ms 2236 KB Output is correct
26 Correct 0 ms 2236 KB Output is correct
27 Correct 9 ms 4284 KB Output is correct
28 Correct 9 ms 4812 KB Output is correct
29 Correct 6 ms 3360 KB Output is correct
30 Correct 43 ms 8112 KB Output is correct
31 Correct 16 ms 5604 KB Output is correct
32 Correct 6 ms 4548 KB Output is correct
33 Correct 3 ms 3228 KB Output is correct
34 Correct 26 ms 7056 KB Output is correct
35 Correct 63 ms 9960 KB Output is correct
36 Correct 16 ms 5208 KB Output is correct
37 Correct 16 ms 5340 KB Output is correct
38 Correct 36 ms 6792 KB Output is correct
39 Correct 23 ms 5736 KB Output is correct
40 Correct 319 ms 17616 KB Output is correct
41 Correct 386 ms 18276 KB Output is correct
42 Correct 56 ms 8244 KB Output is correct
43 Correct 383 ms 22896 KB Output is correct
44 Correct 446 ms 22896 KB Output is correct
45 Correct 126 ms 11280 KB Output is correct
46 Correct 209 ms 14712 KB Output is correct
47 Correct 353 ms 19200 KB Output is correct
48 Correct 496 ms 22500 KB Output is correct
49 Execution timed out 500 ms 37020 KB Execution timed out
50 Halted 0 ms 0 KB -