oj.uz

답안 #22673

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
22673 2017-04-30T06:24:28 Z 카시코이(#958, xdoju, ntopia, pps789) Unifying Values (KRIII5_UV) C++14
7 / 7
 156 ms 4596 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];

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

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

		vector<vector<int>> idxs(n + 1);
		for (int i = 0; i <= n; ++i) {
			if (llabs(sum[i]) % llabs(targetsum) == 0) {
				long long mcnt = sum[i] / targetsum;
				if (0 <= mcnt && mcnt <= cnt) {
					idxs[mcnt].push_back(i);
				}
			}
		}
		idxs[0] = vector<int>{ 0 };
		sum1[0] = vector<int>{ 1 };
		prefix[0] = vector<int>{ 1 };
		for (int k = 1; k <= cnt; ++k) {
			sum1[k].resize(idxs[k].size(), 0);
			prefix[k].resize(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:41: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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2092 KB Output is correct
2 Correct 0 ms 2092 KB Output is correct
3 Correct 0 ms 2092 KB Output is correct
4 Correct 6 ms 3800 KB Output is correct
5 Correct 6 ms 3800 KB Output is correct
6 Correct 0 ms 2092 KB Output is correct
7 Correct 3 ms 3140 KB Output is correct
8 Correct 3 ms 3140 KB Output is correct
9 Correct 3 ms 3064 KB Output is correct
10 Correct 0 ms 3008 KB Output is correct
11 Correct 3 ms 2880 KB Output is correct
12 Correct 0 ms 2880 KB Output is correct
13 Correct 0 ms 3140 KB Output is correct
14 Correct 3 ms 3140 KB Output is correct
15 Correct 3 ms 3140 KB Output is correct
16 Correct 3 ms 3008 KB Output is correct
17 Correct 3 ms 3008 KB Output is correct
18 Correct 3 ms 2880 KB Output is correct
19 Correct 0 ms 2092 KB Output is correct
20 Correct 0 ms 2092 KB Output is correct
21 Correct 0 ms 2092 KB Output is correct
22 Correct 0 ms 2092 KB Output is correct
23 Correct 0 ms 2092 KB Output is correct
24 Correct 0 ms 2092 KB Output is correct
25 Correct 0 ms 2092 KB Output is correct
26 Correct 0 ms 2092 KB Output is correct
27 Correct 0 ms 2880 KB Output is correct
28 Correct 0 ms 2880 KB Output is correct
29 Correct 3 ms 2876 KB Output is correct
30 Correct 3 ms 2880 KB Output is correct
31 Correct 3 ms 3008 KB Output is correct
32 Correct 3 ms 3008 KB Output is correct
33 Correct 3 ms 2876 KB Output is correct
34 Correct 3 ms 3008 KB Output is correct
35 Correct 6 ms 3008 KB Output is correct
36 Correct 6 ms 3008 KB Output is correct
37 Correct 6 ms 3008 KB Output is correct
38 Correct 6 ms 3008 KB Output is correct
39 Correct 6 ms 3008 KB Output is correct
40 Correct 3 ms 3008 KB Output is correct
41 Correct 6 ms 3008 KB Output is correct
42 Correct 3 ms 3008 KB Output is correct
43 Correct 9 ms 3008 KB Output is correct
44 Correct 3 ms 3008 KB Output is correct
45 Correct 6 ms 3008 KB Output is correct
46 Correct 6 ms 3008 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 3008 KB Output is correct
50 Correct 6 ms 3008 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 3140 KB Output is correct
2 Correct 3 ms 3272 KB Output is correct
3 Correct 3 ms 3140 KB Output is correct
4 Correct 3 ms 2880 KB Output is correct
5 Correct 6 ms 3140 KB Output is correct
6 Correct 3 ms 2876 KB Output is correct
7 Correct 13 ms 3272 KB Output is correct
8 Correct 3 ms 3272 KB Output is correct
9 Correct 0 ms 2876 KB Output is correct
10 Correct 0 ms 3064 KB Output is correct
11 Correct 0 ms 2876 KB Output is correct
12 Correct 3 ms 2876 KB Output is correct
13 Correct 3 ms 2876 KB Output is correct
14 Correct 3 ms 2800 KB Output is correct
15 Correct 3 ms 2876 KB Output is correct
16 Correct 0 ms 2800 KB Output is correct
17 Correct 9 ms 3800 KB Output is correct
18 Correct 23 ms 3800 KB Output is correct
19 Correct 0 ms 2092 KB Output is correct
20 Correct 3 ms 2092 KB Output is correct
21 Correct 3 ms 2092 KB Output is correct
22 Correct 0 ms 2092 KB Output is correct
23 Correct 0 ms 2092 KB Output is correct
24 Correct 0 ms 2092 KB Output is correct
25 Correct 0 ms 2092 KB Output is correct
26 Correct 0 ms 2092 KB Output is correct
27 Correct 3 ms 2876 KB Output is correct
28 Correct 6 ms 3008 KB Output is correct
29 Correct 3 ms 2932 KB Output is correct
30 Correct 23 ms 3272 KB Output is correct
31 Correct 6 ms 3140 KB Output is correct
32 Correct 6 ms 3008 KB Output is correct
33 Correct 0 ms 2932 KB Output is correct
34 Correct 13 ms 3140 KB Output is correct
35 Correct 13 ms 3140 KB Output is correct
36 Correct 6 ms 3008 KB Output is correct
37 Correct 6 ms 3008 KB Output is correct
38 Correct 16 ms 3140 KB Output is correct
39 Correct 9 ms 3008 KB Output is correct
40 Correct 53 ms 3140 KB Output is correct
41 Correct 69 ms 3140 KB Output is correct
42 Correct 16 ms 3140 KB Output is correct
43 Correct 53 ms 3140 KB Output is correct
44 Correct 66 ms 3140 KB Output is correct
45 Correct 29 ms 3140 KB Output is correct
46 Correct 33 ms 2876 KB Output is correct
47 Correct 53 ms 3008 KB Output is correct
48 Correct 73 ms 3008 KB Output is correct
49 Correct 93 ms 3012 KB Output is correct
50 Correct 59 ms 3008 KB Output is correct
51 Correct 46 ms 3008 KB Output is correct
52 Correct 93 ms 2880 KB Output is correct
53 Correct 46 ms 2876 KB Output is correct
54 Correct 63 ms 2880 KB Output is correct
55 Correct 73 ms 2880 KB Output is correct
56 Correct 66 ms 2880 KB Output is correct
57 Correct 46 ms 2876 KB Output is correct
58 Correct 56 ms 2880 KB Output is correct
59 Correct 59 ms 2880 KB Output is correct
60 Correct 76 ms 2880 KB Output is correct
61 Correct 156 ms 2884 KB Output is correct
62 Correct 99 ms 2880 KB Output is correct
63 Correct 59 ms 2880 KB Output is correct
64 Correct 0 ms 2940 KB Output is correct
65 Correct 3 ms 2940 KB Output is correct
66 Correct 29 ms 4232 KB Output is correct
67 Correct 6 ms 3188 KB Output is correct
68 Correct 19 ms 4112 KB Output is correct
69 Correct 3 ms 3048 KB Output is correct
70 Correct 0 ms 3032 KB Output is correct
71 Correct 9 ms 3292 KB Output is correct
72 Correct 13 ms 3812 KB Output is correct
73 Correct 13 ms 3416 KB Output is correct
74 Correct 13 ms 3144 KB Output is correct
75 Correct 16 ms 3276 KB Output is correct
76 Correct 6 ms 3012 KB Output is correct
77 Correct 69 ms 4200 KB Output is correct
78 Correct 96 ms 3936 KB Output is correct
79 Correct 6 ms 3008 KB Output is correct
80 Correct 33 ms 3140 KB Output is correct
81 Correct 19 ms 3272 KB Output is correct
82 Correct 6 ms 3292 KB Output is correct
83 Correct 16 ms 3280 KB Output is correct
84 Correct 119 ms 4596 KB Output is correct
85 Correct 59 ms 4068 KB Output is correct
86 Correct 6 ms 3008 KB Output is correct
87 Correct 6 ms 3008 KB Output is correct
88 Correct 16 ms 3008 KB Output is correct
89 Correct 13 ms 3140 KB Output is correct
90 Correct 9 ms 3140 KB Output is correct
91 Correct 0 ms 2092 KB Output is correct
92 Correct 0 ms 2092 KB Output is correct
93 Correct 0 ms 2092 KB Output is correct
94 Correct 6 ms 3800 KB Output is correct
95 Correct 6 ms 3800 KB Output is correct
96 Correct 0 ms 2092 KB Output is correct
97 Correct 3 ms 3140 KB Output is correct
98 Correct 3 ms 3140 KB Output is correct
99 Correct 3 ms 3064 KB Output is correct
100 Correct 0 ms 3008 KB Output is correct
101 Correct 3 ms 2880 KB Output is correct
102 Correct 0 ms 2880 KB Output is correct
103 Correct 0 ms 3140 KB Output is correct
104 Correct 3 ms 3140 KB Output is correct
105 Correct 3 ms 3140 KB Output is correct
106 Correct 3 ms 3008 KB Output is correct
107 Correct 3 ms 3008 KB Output is correct
108 Correct 3 ms 2880 KB Output is correct
109 Correct 0 ms 2092 KB Output is correct
110 Correct 0 ms 2092 KB Output is correct
111 Correct 0 ms 2092 KB Output is correct
112 Correct 0 ms 2092 KB Output is correct
113 Correct 0 ms 2092 KB Output is correct
114 Correct 0 ms 2092 KB Output is correct
115 Correct 0 ms 2092 KB Output is correct
116 Correct 0 ms 2092 KB Output is correct
117 Correct 0 ms 2880 KB Output is correct
118 Correct 0 ms 2880 KB Output is correct
119 Correct 3 ms 2876 KB Output is correct
120 Correct 3 ms 2880 KB Output is correct
121 Correct 3 ms 3008 KB Output is correct
122 Correct 3 ms 3008 KB Output is correct
123 Correct 3 ms 2876 KB Output is correct
124 Correct 3 ms 3008 KB Output is correct
125 Correct 6 ms 3008 KB Output is correct
126 Correct 6 ms 3008 KB Output is correct
127 Correct 6 ms 3008 KB Output is correct
128 Correct 6 ms 3008 KB Output is correct
129 Correct 6 ms 3008 KB Output is correct
130 Correct 3 ms 3008 KB Output is correct
131 Correct 6 ms 3008 KB Output is correct
132 Correct 3 ms 3008 KB Output is correct
133 Correct 9 ms 3008 KB Output is correct
134 Correct 3 ms 3008 KB Output is correct
135 Correct 6 ms 3008 KB Output is correct
136 Correct 6 ms 3008 KB Output is correct
137 Correct 3 ms 3008 KB Output is correct
138 Correct 3 ms 3008 KB Output is correct
139 Correct 3 ms 3008 KB Output is correct
140 Correct 6 ms 3008 KB Output is correct