oj.uz

답안 #22662

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
22662 2017-04-30T06:15:47 Z 카시코이(#958, xdoju, ntopia, pps789) Unifying Values (KRIII5_UV) C++14
2 / 7
 500 ms 48988 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);
		}
	}

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

	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;
			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:77:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int j = 0; j < curidx.size(); ++j) {
                      ^
UV.cpp:78:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while (p < prvidx.size() && prvidx[p] < curidx[j]) {
              ^
UV.cpp:89: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

# 결과 실행 시간 메모리 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 9 ms 4304 KB Output is correct
5 Correct 9 ms 4304 KB Output is correct
6 Correct 0 ms 2236 KB Output is correct
7 Correct 3 ms 3260 KB Output is correct
8 Correct 3 ms 3248 KB Output is correct
9 Correct 0 ms 3208 KB Output is correct
10 Correct 3 ms 2944 KB Output is correct
11 Correct 0 ms 2940 KB Output is correct
12 Correct 0 ms 2948 KB Output is correct
13 Correct 3 ms 3256 KB Output is correct
14 Correct 0 ms 3248 KB Output is correct
15 Correct 0 ms 3252 KB Output is correct
16 Correct 3 ms 3020 KB Output is correct
17 Correct 3 ms 3024 KB Output is correct
18 Correct 0 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 0 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 0 ms 2944 KB Output is correct
34 Correct 3 ms 2944 KB Output is correct
35 Correct 6 ms 2956 KB Output is correct
36 Correct 0 ms 2960 KB Output is correct
37 Correct 0 ms 2984 KB Output is correct
38 Correct 3 ms 2984 KB Output is correct
39 Correct 6 ms 2984 KB Output is correct
40 Correct 0 ms 2968 KB Output is correct
41 Correct 6 ms 3012 KB Output is correct
42 Correct 3 ms 2976 KB Output is correct
43 Correct 6 ms 3012 KB Output is correct
44 Correct 3 ms 2972 KB Output is correct
45 Correct 6 ms 2972 KB Output is correct
46 Correct 3 ms 2968 KB Output is correct
47 Correct 3 ms 3008 KB Output is correct
48 Correct 3 ms 3008 KB Output is correct
49 Correct 3 ms 3028 KB Output is correct
50 Correct 3 ms 3168 KB Output is correct

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 3388 KB Output is correct
2 Correct 3 ms 3680 KB Output is correct
3 Correct 3 ms 3388 KB Output is correct
4 Correct 3 ms 2948 KB Output is correct
5 Correct 3 ms 2940 KB Output is correct
6 Correct 3 ms 2948 KB Output is correct
7 Correct 9 ms 3704 KB Output is correct
8 Correct 6 ms 3516 KB Output is correct
9 Correct 3 ms 2992 KB Output is correct
10 Correct 3 ms 3736 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 6 ms 3776 KB Output is correct
17 Correct 26 ms 6112 KB Output is correct
18 Correct 23 ms 6112 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 9 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 7452 KB Output is correct
31 Correct 16 ms 5268 KB Output is correct
32 Correct 6 ms 4236 KB Output is correct
33 Correct 3 ms 3332 KB Output is correct
34 Correct 26 ms 5928 KB Output is correct
35 Correct 43 ms 8144 KB Output is correct
36 Correct 16 ms 4680 KB Output is correct
37 Correct 19 ms 4820 KB Output is correct
38 Correct 23 ms 5864 KB Output is correct
39 Correct 23 ms 5324 KB Output is correct
40 Correct 136 ms 13960 KB Output is correct
41 Correct 179 ms 14364 KB Output is correct
42 Correct 43 ms 7628 KB Output is correct
43 Correct 199 ms 17252 KB Output is correct
44 Correct 229 ms 17104 KB Output is correct
45 Correct 63 ms 9240 KB Output is correct
46 Correct 83 ms 12216 KB Output is correct
47 Correct 166 ms 14972 KB Output is correct
48 Correct 199 ms 16824 KB Output is correct
49 Correct 486 ms 28640 KB Output is correct
50 Correct 269 ms 21268 KB Output is correct
51 Correct 199 ms 21392 KB Output is correct
52 Correct 363 ms 22752 KB Output is correct
53 Correct 129 ms 12108 KB Output is correct
54 Correct 163 ms 14088 KB Output is correct
55 Correct 319 ms 21828 KB Output is correct
56 Correct 319 ms 21828 KB Output is correct
57 Correct 213 ms 16200 KB Output is correct
58 Correct 276 ms 21188 KB Output is correct
59 Correct 309 ms 21188 KB Output is correct
60 Correct 259 ms 21296 KB Output is correct
61 Execution timed out 500 ms 48988 KB Execution timed out
62 Halted 0 ms 0 KB -