Submission #22376

#	Time	Username	Problem	Language	Result	Execution time	Memory
22376		dried chocochip on Daegu asphalt (#40)	Unifying Values (KRIII5_UV)	C++14	0 / 7	500 ms	204112 KiB

UV

#include <stdio.h>
#include <unordered_map>

using namespace std;

#define MOD 1000000007

typedef long long lli;

unordered_map<lli,int> d[10000];
lli a[10000];
int n;

int main() {
	scanf("%d",&n);
	lli s=0;
	for(int i=0;i<n;i++) {
		scanf("%lld",&a[i]);
		s+=a[i];
		d[i][s]=1;
	}
	for(int i=1;i<n;i++) {
		lli sum=0;
		for(int j=i;j<n;j++) {
			sum+=a[j];
			if(d[i-1].count(sum)) d[j][sum]+=d[i-1][sum];
			if(d[j][sum]>=MOD) d[j][sum]-=MOD;
		}
	}
	int res=0;
	for(unordered_map<lli,int>::iterator it=d[n-1].begin();it!=d[n-1].end();it++) {
		res+=it->second;
		if(res>=MOD) res-=MOD;
	}
	printf("%d\n",--res);
	return 0;
}

Compilation message (stderr)

UV.cpp: In function 'int main()':
UV.cpp:15:16: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
UV.cpp:18: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
• Subtask 2: 0 / 5