oj.uz

Submission #22630

# Submission time Handle Problem Language Result Execution time Memory
22630 2017-04-30T06:01:19 Z 카시코이(#958, xdoju, ntopia, pps789) Unifying Values (KRIII5_UV) C++14
2 / 7
 500 ms 48856 KB 
#include <cstdio>
#include <cstring>
#include <vector>
#include <unordered_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];

	unordered_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);
		}
	}

	for (int cnt : cand) {
		long long targetsum = allsum / cnt;

		vector<vector<int>> idxs(n + 1);
		vector<vector<int>> sum1(n + 1), prefix(n + 1);
		idxs[0].push_back(0);
		sum1[0].push_back(1);
		prefix[0].push_back(1);
		for (int k = 1; k <= cnt; ++k) {
			long long ss = targetsum * k;
			idxs[k] = posbysum[ss];
			sum1[k].assign(idxs[k].size(), 0);
			prefix[k].assign(idxs[k].size(), 0);

			int p = 0;
			for (int j = 0; j < idxs[k].size(); ++j) {
				while (p < idxs[k - 1].size() && idxs[k - 1][p] < idxs[k][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:74:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int j = 0; j < idxs[k].size(); ++j) {
                      ^
UV.cpp:75:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while (p < idxs[k - 1].size() && idxs[k - 1][p] < idxs[k][j]) {
              ^
UV.cpp:86: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 4700 KB Output is correct
5 Correct 19 ms 4700 KB Output is correct
6 Correct 0 ms 2236 KB Output is correct
7 Correct 3 ms 3392 KB Output is correct
8 Correct 3 ms 3248 KB Output is correct
9 Correct 3 ms 3340 KB Output is correct
10 Correct 0 ms 2944 KB Output is correct
11 Correct 3 ms 2940 KB Output is correct
12 Correct 0 ms 2948 KB Output is correct
13 Correct 6 ms 3388 KB Output is correct
14 Correct 3 ms 3248 KB Output is correct
15 Correct 3 ms 3252 KB Output is correct
16 Correct 3 ms 3152 KB Output is correct
17 Correct 0 ms 3156 KB Output is correct
18 Correct 3 ms 2944 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 3 ms 2952 KB Output is correct
28 Correct 0 ms 2940 KB Output is correct
29 Correct 3 ms 2952 KB Output is correct
30 Correct 0 ms 2948 KB Output is correct
31 Correct 3 ms 2944 KB Output is correct
32 Correct 3 ms 2952 KB Output is correct
33 Correct 3 ms 2944 KB Output is correct
34 Correct 3 ms 2944 KB Output is correct
35 Correct 3 ms 2956 KB Output is correct
36 Correct 6 ms 3092 KB Output is correct
37 Correct 0 ms 3116 KB Output is correct
38 Correct 6 ms 3116 KB Output is correct
39 Correct 0 ms 3116 KB Output is correct
40 Correct 6 ms 3100 KB Output is correct
41 Correct 6 ms 3144 KB Output is correct
42 Correct 3 ms 3108 KB Output is correct
43 Correct 9 ms 3144 KB Output is correct
44 Correct 3 ms 3104 KB Output is correct
45 Correct 3 ms 3104 KB Output is correct
46 Correct 0 ms 3100 KB Output is correct
47 Correct 3 ms 3140 KB Output is correct
48 Correct 6 ms 3140 KB Output is correct
49 Correct 3 ms 3160 KB Output is correct
50 Correct 3 ms 3168 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 3520 KB Output is correct
2 Correct 6 ms 3764 KB Output is correct
3 Correct 6 ms 3520 KB Output is correct
4 Correct 0 ms 2948 KB Output is correct
5 Correct 6 ms 3072 KB Output is correct
6 Correct 3 ms 2948 KB Output is correct
7 Correct 9 ms 3800 KB Output is correct
8 Correct 6 ms 3648 KB Output is correct
9 Correct 0 ms 2992 KB Output is correct
10 Correct 3 ms 3812 KB Output is correct
11 Correct 3 ms 3712 KB Output is correct
12 Correct 6 ms 4276 KB Output is correct
13 Correct 6 ms 4284 KB Output is correct
14 Correct 6 ms 4152 KB Output is correct
15 Correct 6 ms 3776 KB Output is correct
16 Correct 3 ms 3776 KB Output is correct
17 Correct 26 ms 6244 KB Output is correct
18 Correct 19 ms 6244 KB Output is correct
19 Correct 0 ms 2236 KB Output is correct
20 Correct 6 ms 3068 KB Output is correct
21 Correct 3 ms 3068 KB Output is correct
22 Correct 3 ms 2940 KB Output is correct
23 Correct 3 ms 2624 KB Output is correct
24 Correct 0 ms 2228 KB Output is correct
25 Correct 0 ms 2236 KB Output is correct
26 Correct 0 ms 2236 KB Output is correct
27 Correct 6 ms 4104 KB Output is correct
28 Correct 9 ms 4420 KB Output is correct
29 Correct 3 ms 3464 KB Output is correct
30 Correct 39 ms 7448 KB Output is correct
31 Correct 13 ms 5268 KB Output is correct
32 Correct 16 ms 4268 KB Output is correct
33 Correct 3 ms 3332 KB Output is correct
34 Correct 16 ms 5928 KB Output is correct
35 Correct 36 ms 8180 KB Output is correct
36 Correct 13 ms 4680 KB Output is correct
37 Correct 16 ms 4688 KB Output is correct
38 Correct 29 ms 5864 KB Output is correct
39 Correct 19 ms 5324 KB Output is correct
40 Correct 149 ms 13828 KB Output is correct
41 Correct 183 ms 14232 KB Output is correct
42 Correct 36 ms 7496 KB Output is correct
43 Correct 176 ms 16988 KB Output is correct
44 Correct 226 ms 16968 KB Output is correct
45 Correct 73 ms 9108 KB Output is correct
46 Correct 103 ms 12084 KB Output is correct
47 Correct 133 ms 14840 KB Output is correct
48 Correct 206 ms 16824 KB Output is correct
49 Correct 499 ms 28508 KB Output is correct
50 Correct 273 ms 21136 KB Output is correct
51 Correct 263 ms 21260 KB Output is correct
52 Correct 296 ms 22752 KB Output is correct
53 Correct 156 ms 12108 KB Output is correct
54 Correct 223 ms 14088 KB Output is correct
55 Correct 393 ms 21828 KB Output is correct
56 Correct 283 ms 21696 KB Output is correct
57 Correct 159 ms 16200 KB Output is correct
58 Correct 216 ms 21188 KB Output is correct
59 Correct 276 ms 21188 KB Output is correct
60 Correct 343 ms 21296 KB Output is correct
61 Execution timed out 500 ms 48856 KB Execution timed out
62 Halted 0 ms 0 KB -