oj.uz

Submission #22911

# Submission time Handle Problem Language Result Execution time Memory
22911 2017-04-30T12:35:27 Z sgc109 Unifying Values (KRIII5_UV) C++11
7 / 7
 409 ms 2604 KB 
#include <iostream>
#include <cstdio>
#include <string>
#include <sstream>
#include <algorithm>
#include <set>
#include <numeric>
#include <cmath>
#include <map>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <queue>
#include <numeric>
#include <iomanip>
#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;
ll dp[10003];
ll go(int pos, ll sum){
    if(pos==N) return dp[pos]=1;
    ll& cache = dp[pos];
    if(cache != -1) return cache;
    cache=0;
    for(int i = pos+1; i <= N; i++){
        if(pSum[i]-pSum[pos]==sum){
            cache+=go(i,sum);
            cache%=MOD;
        }
    }
    return cache;
}
int main() {
    inp1(N);
    FOR(i,N) scanf("%lld",A+i), pSum[i+1] = pSum[i] + A[i];
    
    ll ans = 0;
    vector<long long > valid;
    for(int i=1;i<=N;i++){
        if(pSum[i]!=0 && pSum[N]%pSum[i]==0)valid.push_back(pSum[i]);
    }
    sort(valid.begin(),valid.end());
    valid.erase(unique(valid.begin(),valid.end()),valid.end());
    if(pSum[N]==0)valid.clear(),valid.push_back(0);
    
    for(int i=0;i<valid.size();i++){
        memset(dp,-1,sizeof(dp));
        ans=(ans%MOD+go(0,valid[i])%MOD)%MOD;
    }
    printf("%lld",(ans-1+MOD)%MOD);
    return 0;
}

Compilation message

UV.cpp: In function 'int main()':
UV.cpp:76:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<valid.size();i++){
                  ^
UV.cpp:64:12: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     inp1(N);
            ^
UV.cpp:65:59: 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];
                                                           ^

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2256 KB Output is correct
2 Correct 0 ms 2256 KB Output is correct
3 Correct 0 ms 2256 KB Output is correct
4 Correct 119 ms 2604 KB Output is correct
5 Correct 119 ms 2596 KB Output is correct
6 Correct 409 ms 2600 KB Output is correct
7 Correct 103 ms 2256 KB Output is correct
8 Correct 66 ms 2256 KB Output is correct
9 Correct 59 ms 2256 KB Output is correct
10 Correct 73 ms 2256 KB Output is correct
11 Correct 99 ms 2256 KB Output is correct
12 Correct 93 ms 2256 KB Output is correct
13 Correct 103 ms 2256 KB Output is correct
14 Correct 79 ms 2256 KB Output is correct
15 Correct 73 ms 2256 KB Output is correct
16 Correct 103 ms 2256 KB Output is correct
17 Correct 59 ms 2256 KB Output is correct
18 Correct 89 ms 2256 KB Output is correct
19 Correct 0 ms 2528 KB Output is correct
20 Correct 6 ms 2528 KB Output is correct
21 Correct 19 ms 2528 KB Output is correct
22 Correct 79 ms 2448 KB Output is correct
23 Correct 113 ms 2484 KB Output is correct
24 Correct 99 ms 2496 KB Output is correct
25 Correct 99 ms 2504 KB Output is correct
26 Correct 99 ms 2500 KB Output is correct
27 Correct 103 ms 2256 KB Output is correct
28 Correct 93 ms 2396 KB Output is correct
29 Correct 153 ms 2256 KB Output is correct
30 Correct 173 ms 2256 KB Output is correct
31 Correct 116 ms 2256 KB Output is correct
32 Correct 139 ms 2256 KB Output is correct
33 Correct 126 ms 2396 KB Output is correct
34 Correct 116 ms 2256 KB Output is correct
35 Correct 146 ms 2256 KB Output is correct
36 Correct 166 ms 2256 KB Output is correct
37 Correct 209 ms 2256 KB Output is correct
38 Correct 199 ms 2256 KB Output is correct
39 Correct 166 ms 2256 KB Output is correct
40 Correct 136 ms 2256 KB Output is correct
41 Correct 179 ms 2256 KB Output is correct
42 Correct 96 ms 2256 KB Output is correct
43 Correct 186 ms 2256 KB Output is correct
44 Correct 109 ms 2256 KB Output is correct
45 Correct 156 ms 2256 KB Output is correct
46 Correct 169 ms 2256 KB Output is correct
47 Correct 129 ms 2256 KB Output is correct
48 Correct 126 ms 2256 KB Output is correct
49 Correct 89 ms 2256 KB Output is correct
50 Correct 136 ms 2256 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 2256 KB Output is correct
2 Correct 59 ms 2256 KB Output is correct
3 Correct 59 ms 2256 KB Output is correct
4 Correct 79 ms 2256 KB Output is correct
5 Correct 146 ms 2256 KB Output is correct
6 Correct 139 ms 2256 KB Output is correct
7 Correct 156 ms 2256 KB Output is correct
8 Correct 93 ms 2256 KB Output is correct
9 Correct 13 ms 2256 KB Output is correct
10 Correct 0 ms 2256 KB Output is correct
11 Correct 0 ms 2256 KB Output is correct
12 Correct 0 ms 2256 KB Output is correct
13 Correct 0 ms 2256 KB Output is correct
14 Correct 3 ms 2256 KB Output is correct
15 Correct 0 ms 2256 KB Output is correct
16 Correct 3 ms 2256 KB Output is correct
17 Correct 126 ms 2596 KB Output is correct
18 Correct 123 ms 2600 KB Output is correct
19 Correct 389 ms 2596 KB Output is correct
20 Correct 3 ms 2528 KB Output is correct
21 Correct 3 ms 2528 KB Output is correct
22 Correct 6 ms 2528 KB Output is correct
23 Correct 169 ms 2524 KB Output is correct
24 Correct 313 ms 2552 KB Output is correct
25 Correct 373 ms 2600 KB Output is correct
26 Correct 379 ms 2600 KB Output is correct
27 Correct 36 ms 2256 KB Output is correct
28 Correct 36 ms 2256 KB Output is correct
29 Correct 26 ms 2256 KB Output is correct
30 Correct 29 ms 2256 KB Output is correct
31 Correct 29 ms 2264 KB Output is correct
32 Correct 33 ms 2256 KB Output is correct
33 Correct 29 ms 2256 KB Output is correct
34 Correct 26 ms 2256 KB Output is correct
35 Correct 26 ms 2256 KB Output is correct
36 Correct 33 ms 2256 KB Output is correct
37 Correct 29 ms 2256 KB Output is correct
38 Correct 36 ms 2256 KB Output is correct
39 Correct 29 ms 2256 KB Output is correct
40 Correct 73 ms 2256 KB Output is correct
41 Correct 73 ms 2256 KB Output is correct
42 Correct 43 ms 2256 KB Output is correct
43 Correct 43 ms 2256 KB Output is correct
44 Correct 73 ms 2256 KB Output is correct
45 Correct 76 ms 2256 KB Output is correct
46 Correct 6 ms 2256 KB Output is correct
47 Correct 13 ms 2256 KB Output is correct
48 Correct 6 ms 2256 KB Output is correct
49 Correct 23 ms 2256 KB Output is correct
50 Correct 19 ms 2256 KB Output is correct
51 Correct 16 ms 2256 KB Output is correct
52 Correct 3 ms 2256 KB Output is correct
53 Correct 6 ms 2256 KB Output is correct
54 Correct 3 ms 2256 KB Output is correct
55 Correct 3 ms 2256 KB Output is correct
56 Correct 3 ms 2256 KB Output is correct
57 Correct 3 ms 2256 KB Output is correct
58 Correct 6 ms 2256 KB Output is correct
59 Correct 3 ms 2256 KB Output is correct
60 Correct 6 ms 2256 KB Output is correct
61 Correct 3 ms 2256 KB Output is correct
62 Correct 3 ms 2256 KB Output is correct
63 Correct 6 ms 2256 KB Output is correct
64 Correct 49 ms 2528 KB Output is correct
65 Correct 79 ms 2396 KB Output is correct
66 Correct 73 ms 2396 KB Output is correct
67 Correct 99 ms 2396 KB Output is correct
68 Correct 79 ms 2396 KB Output is correct
69 Correct 119 ms 2396 KB Output is correct
70 Correct 113 ms 2396 KB Output is correct
71 Correct 119 ms 2396 KB Output is correct
72 Correct 156 ms 2396 KB Output is correct
73 Correct 176 ms 2396 KB Output is correct
74 Correct 156 ms 2396 KB Output is correct
75 Correct 156 ms 2256 KB Output is correct
76 Correct 109 ms 2256 KB Output is correct
77 Correct 149 ms 2256 KB Output is correct
78 Correct 169 ms 2256 KB Output is correct
79 Correct 203 ms 2256 KB Output is correct
80 Correct 156 ms 2256 KB Output is correct
81 Correct 119 ms 2256 KB Output is correct
82 Correct 153 ms 2396 KB Output is correct
83 Correct 149 ms 2256 KB Output is correct
84 Correct 153 ms 2256 KB Output is correct
85 Correct 116 ms 2256 KB Output is correct
86 Correct 173 ms 2256 KB Output is correct
87 Correct 183 ms 2256 KB Output is correct
88 Correct 146 ms 2256 KB Output is correct
89 Correct 179 ms 2256 KB Output is correct
90 Correct 109 ms 2256 KB Output is correct
91 Correct 0 ms 2256 KB Output is correct
92 Correct 0 ms 2256 KB Output is correct
93 Correct 0 ms 2256 KB Output is correct
94 Correct 119 ms 2604 KB Output is correct
95 Correct 119 ms 2596 KB Output is correct
96 Correct 409 ms 2600 KB Output is correct
97 Correct 103 ms 2256 KB Output is correct
98 Correct 66 ms 2256 KB Output is correct
99 Correct 59 ms 2256 KB Output is correct
100 Correct 73 ms 2256 KB Output is correct
101 Correct 99 ms 2256 KB Output is correct
102 Correct 93 ms 2256 KB Output is correct
103 Correct 103 ms 2256 KB Output is correct
104 Correct 79 ms 2256 KB Output is correct
105 Correct 73 ms 2256 KB Output is correct
106 Correct 103 ms 2256 KB Output is correct
107 Correct 59 ms 2256 KB Output is correct
108 Correct 89 ms 2256 KB Output is correct
109 Correct 0 ms 2528 KB Output is correct
110 Correct 6 ms 2528 KB Output is correct
111 Correct 19 ms 2528 KB Output is correct
112 Correct 79 ms 2448 KB Output is correct
113 Correct 113 ms 2484 KB Output is correct
114 Correct 99 ms 2496 KB Output is correct
115 Correct 99 ms 2504 KB Output is correct
116 Correct 99 ms 2500 KB Output is correct
117 Correct 103 ms 2256 KB Output is correct
118 Correct 93 ms 2396 KB Output is correct
119 Correct 153 ms 2256 KB Output is correct
120 Correct 173 ms 2256 KB Output is correct
121 Correct 116 ms 2256 KB Output is correct
122 Correct 139 ms 2256 KB Output is correct
123 Correct 126 ms 2396 KB Output is correct
124 Correct 116 ms 2256 KB Output is correct
125 Correct 146 ms 2256 KB Output is correct
126 Correct 166 ms 2256 KB Output is correct
127 Correct 209 ms 2256 KB Output is correct
128 Correct 199 ms 2256 KB Output is correct
129 Correct 166 ms 2256 KB Output is correct
130 Correct 136 ms 2256 KB Output is correct
131 Correct 179 ms 2256 KB Output is correct
132 Correct 96 ms 2256 KB Output is correct
133 Correct 186 ms 2256 KB Output is correct
134 Correct 109 ms 2256 KB Output is correct
135 Correct 156 ms 2256 KB Output is correct
136 Correct 169 ms 2256 KB Output is correct
137 Correct 129 ms 2256 KB Output is correct
138 Correct 126 ms 2256 KB Output is correct
139 Correct 89 ms 2256 KB Output is correct
140 Correct 136 ms 2256 KB Output is correct