답안 #22622

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
22622	2017-04-30T05:59:21 Z	카시코이(#958, xdoju, ntopia, pps789)	Unifying Values (KRIII5_UV)	C++14	0 / 7	16 ms	4776 KB

UV

#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 d[2][10004];

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

	vector<int> cand;
	for (int i = 2; i <= n; ++i) {
		if (allsum % i == 0) {
			cand.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;
	}

	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 += prefix[cnt].back();
	}
	printf("%d\n", ans % MOD);

	return 0;
}

Compilation message

UV.cpp: In function 'int main()':
UV.cpp:56:21: warning: format '%d' expects argument of type 'int', but argument 2 has type 'long long int' [-Wformat=]
   printf("%d\n", ans);
                     ^
UV.cpp:76:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int j = 0; j < idxs[k].size(); ++j) {
                      ^
UV.cpp:77: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:88: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:19:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
UV.cpp:21:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld", &arr[i]);
                         ^

Subtask #1

0 / 2.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	2172 KB	Output is correct
2	Correct	0 ms	2172 KB	Output is correct
3	Correct	0 ms	2172 KB	Output is correct
4	Correct	16 ms	4776 KB	Output is correct
5	Correct	9 ms	4776 KB	Output is correct
6	Correct	0 ms	2312 KB	Output is correct
7	Correct	0 ms	3468 KB	Output is correct
8	Incorrect	3 ms	3324 KB	Output isn't correct
9	Halted	0 ms	0 KB	-

Subtask #2

0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	6 ms	3596 KB	Output isn't correct
2	Halted	0 ms	0 KB	-