답안 #22321 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
22321	2017-04-30T03:52:31 Z	- - - - - - - List of honorable mention follows - - - - - - -(#999, xhae, ainu7, littlesheep)	Unifying Values (KRIII5_UV)	C++11	7 / 7	9 ms	2256 KB

#include <functional>
#include <algorithm>
#include <stdexcept>
#include <iostream>
#include <sstream>
#include <fstream>
#include <numeric>
#include <iomanip>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <cctype>
#include <vector>
#include <string>
#include <bitset>
#include <cmath>
#include <queue>
#include <stdint.h>
#include <stdio.h>
#include <stack>
#include <ctime>
#include <list>
#include <map>
#include <set>
#include <tuple>
#include <unordered_set>
#include <assert.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define TR(i,x) for(__typeof(x.begin()) i=x.begin();i!=x.end();i++)
#define ALL(x) x.begin(),x.end()
#define SORT(x) sort(ALL(x))
#define CLEAR(x) memset(x,0,sizeof(x))
#define FILL(x,c) memset(x,c,sizeof(x))

using namespace std;

#define PB push_back
#define MP make_pair

typedef map<int,int> MII;
typedef map<string,int> MSI;
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<long double> VD;
typedef pair<int,int> PII;
typedef long long int64;
typedef long long LL;
typedef unsigned int UI;
typedef long double LD;
typedef unsigned long long ULL;

const int N = 10007;
const int MOD = 1000000007;

LL a[N], sum[N];
LL dp[N];

int main() {
    int n;
    cin >> n;
    REP(i, n) cin >> a[i];
    sum[0] = 0;
    for (int i = 0; i < n; ++i) {
        sum[i + 1] = sum[i] + a[i];
    }

    set<LL> candidates;
    candidates.insert(sum[n]);
    if (sum[n] != 0) {
        for (int i = 1; i <= n; ++i) {
            if (sum[i] == 0) continue;
            if (sum[n] % sum[i] != 0) continue;

            LL steps = sum[n] / sum[i];
            if (steps <= 0 || steps > n) {
                continue;
            }

            candidates.insert(sum[i]);
        }
    }

    LL answer = 0;
    if (sum[n] != 0) {
        TR(it, candidates) {
            // cout << *it << endl;
            if (*it == sum[n]) continue;
            LL len = *it;
            LL maxStep = sum[n] / len;
            REP(i, maxStep + 1) dp[i] = 0;
            dp[0] = 1;
            for (int i = 1; i <= n; ++i) {
                if (sum[i] % len != 0) {
                    continue;
                }
                LL step = sum[i] / len;
                // cout << "step is " << step << endl;
                if (step <= 0 || step > maxStep) {
                    continue;
                }
                if (step == maxStep && i != n) continue;
                dp[step] += dp[step - 1];
                if (dp[step] >= MOD) {
                    dp[step] -= MOD;
                }
            }
            // REP(i, maxStep + 1) cout << dp[i] << ", "; cout << endl;
            answer = (answer + dp[maxStep]) % MOD;
        }
    } else {
        answer = 1;
        for (int i = 1; i < n; ++i) {
            if (sum[i] == 0) {
                answer = answer * 2 % MOD;
            }
        }

        answer = (answer - 1 + MOD) % MOD;
    }
    cout << answer << endl;
    return 0;
}

Subtask #1
2.0 / 2.0

#	결과	실행 시간	메모리	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	3 ms	2256 KB	Output is correct
5	Correct	3 ms	2256 KB	Output is correct
6	Correct	0 ms	2256 KB	Output is correct
7	Correct	0 ms	2256 KB	Output is correct
8	Correct	3 ms	2256 KB	Output is correct
9	Correct	0 ms	2256 KB	Output is correct
10	Correct	0 ms	2256 KB	Output is correct
11	Correct	3 ms	2256 KB	Output is correct
12	Correct	0 ms	2256 KB	Output is correct
13	Correct	3 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	0 ms	2256 KB	Output is correct
18	Correct	0 ms	2256 KB	Output is correct
19	Correct	0 ms	2256 KB	Output is correct
20	Correct	0 ms	2256 KB	Output is correct
21	Correct	0 ms	2256 KB	Output is correct
22	Correct	0 ms	2256 KB	Output is correct
23	Correct	0 ms	2256 KB	Output is correct
24	Correct	0 ms	2256 KB	Output is correct
25	Correct	0 ms	2256 KB	Output is correct
26	Correct	0 ms	2256 KB	Output is correct
27	Correct	0 ms	2256 KB	Output is correct
28	Correct	3 ms	2256 KB	Output is correct
29	Correct	3 ms	2256 KB	Output is correct
30	Correct	3 ms	2256 KB	Output is correct
31	Correct	3 ms	2256 KB	Output is correct
32	Correct	3 ms	2256 KB	Output is correct
33	Correct	3 ms	2256 KB	Output is correct
34	Correct	3 ms	2256 KB	Output is correct
35	Correct	3 ms	2256 KB	Output is correct
36	Correct	3 ms	2256 KB	Output is correct
37	Correct	6 ms	2256 KB	Output is correct
38	Correct	6 ms	2256 KB	Output is correct
39	Correct	6 ms	2256 KB	Output is correct
40	Correct	3 ms	2256 KB	Output is correct
41	Correct	3 ms	2256 KB	Output is correct
42	Correct	3 ms	2256 KB	Output is correct
43	Correct	6 ms	2256 KB	Output is correct
44	Correct	3 ms	2256 KB	Output is correct
45	Correct	3 ms	2256 KB	Output is correct
46	Correct	3 ms	2256 KB	Output is correct
47	Correct	3 ms	2256 KB	Output is correct
48	Correct	3 ms	2256 KB	Output is correct
49	Correct	0 ms	2256 KB	Output is correct
50	Correct	3 ms	2256 KB	Output is correct

Subtask #2
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 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	0 ms	2256 KB	Output is correct
5	Correct	3 ms	2256 KB	Output is correct
6	Correct	3 ms	2256 KB	Output is correct
7	Correct	3 ms	2256 KB	Output is correct
8	Correct	0 ms	2256 KB	Output is correct
9	Correct	3 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	3 ms	2256 KB	Output is correct
13	Correct	3 ms	2256 KB	Output is correct
14	Correct	6 ms	2256 KB	Output is correct
15	Correct	6 ms	2256 KB	Output is correct
16	Correct	3 ms	2256 KB	Output is correct
17	Correct	9 ms	2256 KB	Output is correct
18	Correct	9 ms	2256 KB	Output is correct
19	Correct	0 ms	2256 KB	Output is correct
20	Correct	6 ms	2256 KB	Output is correct
21	Correct	6 ms	2256 KB	Output is correct
22	Correct	6 ms	2256 KB	Output is correct
23	Correct	3 ms	2256 KB	Output is correct
24	Correct	3 ms	2256 KB	Output is correct
25	Correct	0 ms	2256 KB	Output is correct
26	Correct	0 ms	2256 KB	Output is correct
27	Correct	6 ms	2256 KB	Output is correct
28	Correct	6 ms	2256 KB	Output is correct
29	Correct	3 ms	2256 KB	Output is correct
30	Correct	3 ms	2256 KB	Output is correct
31	Correct	3 ms	2256 KB	Output is correct
32	Correct	3 ms	2256 KB	Output is correct
33	Correct	6 ms	2256 KB	Output is correct
34	Correct	3 ms	2256 KB	Output is correct
35	Correct	3 ms	2256 KB	Output is correct
36	Correct	6 ms	2256 KB	Output is correct
37	Correct	6 ms	2256 KB	Output is correct
38	Correct	6 ms	2256 KB	Output is correct
39	Correct	9 ms	2256 KB	Output is correct
40	Correct	9 ms	2256 KB	Output is correct
41	Correct	9 ms	2256 KB	Output is correct
42	Correct	6 ms	2256 KB	Output is correct
43	Correct	6 ms	2256 KB	Output is correct
44	Correct	9 ms	2256 KB	Output is correct
45	Correct	9 ms	2256 KB	Output is correct
46	Correct	6 ms	2256 KB	Output is correct
47	Correct	9 ms	2256 KB	Output is correct
48	Correct	3 ms	2256 KB	Output is correct
49	Correct	6 ms	2256 KB	Output is correct
50	Correct	6 ms	2256 KB	Output is correct
51	Correct	9 ms	2256 KB	Output is correct
52	Correct	6 ms	2256 KB	Output is correct
53	Correct	6 ms	2256 KB	Output is correct
54	Correct	6 ms	2256 KB	Output is correct
55	Correct	6 ms	2256 KB	Output is correct
56	Correct	6 ms	2256 KB	Output is correct
57	Correct	6 ms	2256 KB	Output is correct
58	Correct	6 ms	2256 KB	Output is correct
59	Correct	6 ms	2256 KB	Output is correct
60	Correct	6 ms	2256 KB	Output is correct
61	Correct	6 ms	2256 KB	Output is correct
62	Correct	6 ms	2256 KB	Output is correct
63	Correct	6 ms	2256 KB	Output is correct
64	Correct	0 ms	2256 KB	Output is correct
65	Correct	6 ms	2256 KB	Output is correct
66	Correct	6 ms	2256 KB	Output is correct
67	Correct	6 ms	2256 KB	Output is correct
68	Correct	6 ms	2256 KB	Output is correct
69	Correct	6 ms	2256 KB	Output is correct
70	Correct	3 ms	2256 KB	Output is correct
71	Correct	6 ms	2256 KB	Output is correct
72	Correct	6 ms	2256 KB	Output is correct
73	Correct	6 ms	2256 KB	Output is correct
74	Correct	6 ms	2256 KB	Output is correct
75	Correct	6 ms	2256 KB	Output is correct
76	Correct	6 ms	2256 KB	Output is correct
77	Correct	6 ms	2256 KB	Output is correct
78	Correct	6 ms	2256 KB	Output is correct
79	Correct	6 ms	2256 KB	Output is correct
80	Correct	6 ms	2256 KB	Output is correct
81	Correct	6 ms	2256 KB	Output is correct
82	Correct	0 ms	2256 KB	Output is correct
83	Correct	3 ms	2256 KB	Output is correct
84	Correct	3 ms	2256 KB	Output is correct
85	Correct	3 ms	2256 KB	Output is correct
86	Correct	3 ms	2256 KB	Output is correct
87	Correct	3 ms	2256 KB	Output is correct
88	Correct	6 ms	2256 KB	Output is correct
89	Correct	6 ms	2256 KB	Output is correct
90	Correct	3 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	3 ms	2256 KB	Output is correct
95	Correct	3 ms	2256 KB	Output is correct
96	Correct	0 ms	2256 KB	Output is correct
97	Correct	0 ms	2256 KB	Output is correct
98	Correct	3 ms	2256 KB	Output is correct
99	Correct	0 ms	2256 KB	Output is correct
100	Correct	0 ms	2256 KB	Output is correct
101	Correct	3 ms	2256 KB	Output is correct
102	Correct	0 ms	2256 KB	Output is correct
103	Correct	3 ms	2256 KB	Output is correct
104	Correct	3 ms	2256 KB	Output is correct
105	Correct	0 ms	2256 KB	Output is correct
106	Correct	3 ms	2256 KB	Output is correct
107	Correct	0 ms	2256 KB	Output is correct
108	Correct	0 ms	2256 KB	Output is correct
109	Correct	0 ms	2256 KB	Output is correct
110	Correct	0 ms	2256 KB	Output is correct
111	Correct	0 ms	2256 KB	Output is correct
112	Correct	0 ms	2256 KB	Output is correct
113	Correct	0 ms	2256 KB	Output is correct
114	Correct	0 ms	2256 KB	Output is correct
115	Correct	0 ms	2256 KB	Output is correct
116	Correct	0 ms	2256 KB	Output is correct
117	Correct	0 ms	2256 KB	Output is correct
118	Correct	3 ms	2256 KB	Output is correct
119	Correct	3 ms	2256 KB	Output is correct
120	Correct	3 ms	2256 KB	Output is correct
121	Correct	3 ms	2256 KB	Output is correct
122	Correct	3 ms	2256 KB	Output is correct
123	Correct	3 ms	2256 KB	Output is correct
124	Correct	3 ms	2256 KB	Output is correct
125	Correct	3 ms	2256 KB	Output is correct
126	Correct	3 ms	2256 KB	Output is correct
127	Correct	6 ms	2256 KB	Output is correct
128	Correct	6 ms	2256 KB	Output is correct
129	Correct	6 ms	2256 KB	Output is correct
130	Correct	3 ms	2256 KB	Output is correct
131	Correct	3 ms	2256 KB	Output is correct
132	Correct	3 ms	2256 KB	Output is correct
133	Correct	6 ms	2256 KB	Output is correct
134	Correct	3 ms	2256 KB	Output is correct
135	Correct	3 ms	2256 KB	Output is correct
136	Correct	3 ms	2256 KB	Output is correct
137	Correct	3 ms	2256 KB	Output is correct
138	Correct	3 ms	2256 KB	Output is correct
139	Correct	0 ms	2256 KB	Output is correct
140	Correct	3 ms	2256 KB	Output is correct

답안 #22321

Compilation message

Subtask #1 2.0 / 2.0

Subtask #2 5.0 / 5.0

Subtask #1
2.0 / 2.0

Subtask #2
5.0 / 5.0