답안 #22621 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
22621	2017-04-30T05:59:08 Z	Jongwon Party(#988, gs13105)	Unifying Values (KRIII5_UV)	C++14	7 / 7	323 ms	1312 KB

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>

using namespace std;

long long arr[10010];
long long sum[10010];
int cnt[10010];
const int mod = 1000000007;

int e(int a, int x)
{
    if(x == 0)
        return 1;
    if(x%2)
        return 1LL * a * e(a, x-1) % mod;
    int t = e(a, x/2);
    return 1LL * t * t % mod;
}

int main()
{
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);

    int n, i, j;
    scanf("%d", &n);
    for(i = 1; i<=n; i++)
        scanf("%lld", &arr[i]);

    for(i = 1; i<=n; i++)
        sum[i] = sum[i-1] + arr[i];

    if(sum[n] == 0)
    {
        int c = 0;
        for(i = 1; i<=n; i++)
            if(sum[i] == 0)
                c++;

        if(c < 2)
        {
            printf("0");
            return 0;
        }

        printf("%d", (0LL + e(2, c-1) - 1 + mod) % mod);
        return 0;
    }

    int r = 0, mx;
    long long b, t;
    for(i = 1; i<n; i++)
    {
        if(sum[i] == 0 || sum[n]%sum[i] != 0)
            continue;

        b = sum[n]/sum[i];
        if(b < 2 || b > n-i+1)
            continue;

        cnt[1] = 1;
        mx = 1;
        for(j = i+1; j<=n; j++)
        {
            if(sum[j]%sum[i] != 0)
                continue;

            t = sum[j]/sum[i];
            if(t < 2 || t > b)
                continue;

            if(t == b && j != n)
                continue;

            cnt[t] = (0LL + cnt[t] + cnt[t - 1]) % mod;
            mx = std::max(0LL + mx, t);
        }

        r = (0LL + r + cnt[b]) % mod;
        for(j = 1; j<=mx; j++)
            cnt[j] = 0;
    }

    printf("%d", r);
    return 0;
}

Compilation message

UV.cpp: In function 'int main()':
UV.cpp:49:55: warning: format '%d' expects argument of type 'int', but argument 2 has type 'long long int' [-Wformat=]
         printf("%d", (0LL + e(2, c-1) - 1 + mod) % mod);
                                                       ^
UV.cpp:29:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
                    ^
UV.cpp:31:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld", &arr[i]);
                               ^

Subtask #1
2.0 / 2.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	1312 KB	Output is correct
2	Correct	0 ms	1312 KB	Output is correct
3	Correct	0 ms	1312 KB	Output is correct
4	Correct	3 ms	1312 KB	Output is correct
5	Correct	3 ms	1312 KB	Output is correct
6	Correct	0 ms	1312 KB	Output is correct
7	Correct	3 ms	1312 KB	Output is correct
8	Correct	0 ms	1312 KB	Output is correct
9	Correct	0 ms	1312 KB	Output is correct
10	Correct	26 ms	1312 KB	Output is correct
11	Correct	13 ms	1312 KB	Output is correct
12	Correct	33 ms	1312 KB	Output is correct
13	Correct	6 ms	1312 KB	Output is correct
14	Correct	3 ms	1312 KB	Output is correct
15	Correct	0 ms	1312 KB	Output is correct
16	Correct	6 ms	1312 KB	Output is correct
17	Correct	3 ms	1312 KB	Output is correct
18	Correct	29 ms	1312 KB	Output is correct
19	Correct	0 ms	1312 KB	Output is correct
20	Correct	0 ms	1312 KB	Output is correct
21	Correct	0 ms	1312 KB	Output is correct
22	Correct	0 ms	1312 KB	Output is correct
23	Correct	0 ms	1312 KB	Output is correct
24	Correct	0 ms	1312 KB	Output is correct
25	Correct	0 ms	1312 KB	Output is correct
26	Correct	0 ms	1312 KB	Output is correct
27	Correct	33 ms	1312 KB	Output is correct
28	Correct	173 ms	1312 KB	Output is correct
29	Correct	89 ms	1312 KB	Output is correct
30	Correct	19 ms	1312 KB	Output is correct
31	Correct	13 ms	1312 KB	Output is correct
32	Correct	16 ms	1312 KB	Output is correct
33	Correct	143 ms	1312 KB	Output is correct
34	Correct	43 ms	1312 KB	Output is correct
35	Correct	43 ms	1312 KB	Output is correct
36	Correct	49 ms	1312 KB	Output is correct
37	Correct	63 ms	1312 KB	Output is correct
38	Correct	63 ms	1312 KB	Output is correct
39	Correct	89 ms	1312 KB	Output is correct
40	Correct	23 ms	1312 KB	Output is correct
41	Correct	23 ms	1312 KB	Output is correct
42	Correct	6 ms	1312 KB	Output is correct
43	Correct	33 ms	1312 KB	Output is correct
44	Correct	23 ms	1312 KB	Output is correct
45	Correct	53 ms	1312 KB	Output is correct
46	Correct	46 ms	1312 KB	Output is correct
47	Correct	16 ms	1312 KB	Output is correct
48	Correct	13 ms	1312 KB	Output is correct
49	Correct	6 ms	1312 KB	Output is correct
50	Correct	9 ms	1312 KB	Output is correct

Subtask #2
5.0 / 5.0

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

답안 #22621

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