Submission #22895

#TimeUsernameProblemLanguageResultExecution timeMemory
22895sgc109Unifying Values (KRIII5_UV)C++11
0 / 7
0 ms2832 KiB
#include <bits/stdc++.h> #define REP(i,a,b) for(int i=a;i<=b;++i) #define FOR(i,n) for(int i=0;i<n;++i) #define pb push_back #define all(v) (v).begin(),(v).end() #define sz(v) ((int)(v).size()) #define inp1(a) scanf("%d",&a) #define inp2(a,b) scanf("%d%d",&a,&b) #define inp3(a,b,c) scanf("%d%d%d",&a,&b,&c) #define inp4(a,b,c,d) scanf("%d%d%d%d",&a,&b,&c,&d) #define inp5(a,b,c,d,e) scanf("%d%d%d%d%d",&a,&b,&c,&d,&e) #define fastio() ios_base::sync_with_stdio(false),cin.tie(NULL) using namespace std; typedef long long ll; typedef pair<ll,ll> pll; typedef vector<int> vi; typedef vector<ll> vl; typedef pair<int,int> pii; typedef vector<pii> vii; typedef vector<pll> vll; typedef vector<vector<int> > vvi; typedef pair<int,pair<int,int> > piii; typedef vector<piii> viii; const double EPSILON = 1e-9; const double PI = acos(-1); const int MOD = 1e9+7; const int INF = 0x3c3c3c3c; const long long INFL = 0x3c3c3c3c3c3c3c3c; const int MAX_N = 102; ll pSum[10003]; ll A[10003]; int N; map<pii,int> mp; ll go(int pos, int cnt){ if(cnt==1) return 1; auto it = mp.find(make_pair(pos,cnt)); if(it != mp.end()) return (*it).second; auto& cache = (*it).second; ll ans = 0; for(int i = pos; i < N; i++){ if(pos==1) { if(pSum[N]%pSum[i]) continue; ans += go(i+1, pSum[N]/pSum[i]-1); } else { if(pSum[N]-pSum[pos-1] != (pSum[i]-pSum[pos-1])*cnt) continue; ans += go(i+1, cnt-1); } } return cache = ans; } int main() { inp1(N); FOR(i,N) scanf("%lld",A+i), pSum[i+1] = pSum[i] + A[i]; printf("%lld", go(1,0)); return 0; }

Compilation message (stderr)

UV.cpp: In function 'int main()':
UV.cpp:57:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  inp1(N);
         ^
UV.cpp:58:56: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  FOR(i,N) scanf("%lld",A+i), pSum[i+1] = pSum[i] + A[i];
                                                        ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...