oj.uz

답안 #22835

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
22835 2017-04-30T07:47:53 Z 버거킹 송죽SK점 우수고객(#1039, Namnamseo, khsoo01) Unifying Values (KRIII5_UV) C++
0 / 7
 79 ms 2252 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;

ll n, a[10005], s[10005], ans, dt[10005];

bool valid (ll A, ll B) {
	return (A % B == 0 && A / B >= 1);
}

ll solve (ll idx) {
	if(idx == n) return 1;
	if(!valid(s[n], s[idx])) return 0;
	ll t = s[n]/s[idx];
	if(t == 1 || n-idx+1 <= t) return 0;
	for(ll i=0;i<t;i++) dt[i] = 0;
	dt[1] = 1;
	for(ll i=idx+1;i<n;i++) {
		if(!valid(s[i], s[idx])) continue;
		ll tt = s[i]/s[idx];
		if(tt >= t) continue;
		dt[tt] = (dt[tt] + dt[tt-1]) % mod;
	}
	return dt[t-1];
}

ll solve_zero () {
	if(s[n] != 0) return 0;
	ll ret = 1;
	for(ll i=1;i<n;i++) {
		if(s[i] == 0) ret = (ret * 2) % mod;
	}
	return ret;
}

int main()
{
	scanf("%lld",&n);
	for(ll i=1;i<=n;i++) {
		scanf("%lld",&a[i]);
		s[i] = s[i-1] + a[i];
	}
	for(ll i=1;i<=n;i++) {
		ans = (ans + (s[i] ? solve(i) : 0)) % mod;
	}
	ans = (ans + solve_zero()) % mod;
	printf("%lld\n",(ans+mod-1)%mod);
}

Compilation message

UV.cpp: In function 'int main()':
UV.cpp:39:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld",&n);
                  ^
UV.cpp:41:22: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld",&a[i]);
                      ^

Subtask #1
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2252 KB Output is correct
2 Correct 0 ms 2252 KB Output is correct
3 Correct 0 ms 2252 KB Output is correct
4 Incorrect 3 ms 2252 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2252 KB Output is correct
2 Correct 3 ms 2252 KB Output is correct
3 Correct 0 ms 2252 KB Output is correct
4 Correct 36 ms 2252 KB Output is correct
5 Correct 79 ms 2252 KB Output is correct
6 Correct 36 ms 2252 KB Output is correct
7 Correct 16 ms 2252 KB Output is correct
8 Correct 3 ms 2252 KB Output is correct
9 Correct 13 ms 2252 KB Output is correct
10 Correct 0 ms 2252 KB Output is correct
11 Correct 0 ms 2252 KB Output is correct
12 Correct 0 ms 2252 KB Output is correct
13 Correct 0 ms 2252 KB Output is correct
14 Correct 0 ms 2252 KB Output is correct
15 Correct 0 ms 2252 KB Output is correct
16 Correct 3 ms 2252 KB Output is correct
17 Incorrect 3 ms 2252 KB Output isn't correct
18 Halted 0 ms 0 KB -