답안 #94414 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
94414	2019-01-18T09:32:30 Z	Kastanda	Money (IZhO17_money)	C++11	45 / 100	1500 ms	58164 KB

money

#include<bits/stdc++.h>
using namespace std;
const int N = 1000006;
int n, cnt, A[N];
multiset < int > S;
inline void Del(int a)
{
    auto it = S.lower_bound(a);
    if ((*it) == a)
        S.erase(it);
}
int main()
{
    scanf("%d", &n);
    for (int i = 1; i <= n; i++)
        scanf("%d", &A[i]), S.insert(A[i]);
    S.insert(N); // just in case...
    for (int i = n; i;)
    {
        int used = 0;
        int l = i - 1;
        while (l)
        {
            Del(A[l + 1]);
            if (A[l] > A[l + 1])
                break;
            if (A[l] == A[l + 1])
            {
                l --;
                continue;
            }
            auto it = S.upper_bound(A[l]);
            if ((*it) < A[l + 1])
                break;
            if ((*it) == A[l + 1] && used)
                break;
            used = 1;
            l --;
        }
        i = l;
        cnt ++;
    }
    return !printf("%d", cnt);
}

Compilation message

money.cpp: In function 'int main()':
money.cpp:14:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
money.cpp:16:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &A[i]), S.insert(A[i]);
         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	256 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	256 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	256 KB	Output is correct
15	Correct	2 ms	256 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct

Subtask #2
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	256 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	256 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	256 KB	Output is correct
15	Correct	2 ms	256 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	380 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	424 KB	Output is correct
20	Correct	2 ms	256 KB	Output is correct
21	Correct	2 ms	256 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	2 ms	256 KB	Output is correct
24	Correct	2 ms	380 KB	Output is correct
25	Correct	2 ms	376 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	256 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	256 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	256 KB	Output is correct
15	Correct	2 ms	256 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	380 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	424 KB	Output is correct
20	Correct	2 ms	256 KB	Output is correct
21	Correct	2 ms	256 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	2 ms	256 KB	Output is correct
24	Correct	2 ms	380 KB	Output is correct
25	Correct	2 ms	376 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct
27	Correct	2 ms	376 KB	Output is correct
28	Correct	2 ms	256 KB	Output is correct
29	Correct	2 ms	376 KB	Output is correct
30	Correct	2 ms	376 KB	Output is correct
31	Correct	2 ms	376 KB	Output is correct
32	Correct	2 ms	376 KB	Output is correct
33	Correct	2 ms	376 KB	Output is correct
34	Correct	2 ms	376 KB	Output is correct
35	Correct	2 ms	376 KB	Output is correct
36	Correct	2 ms	376 KB	Output is correct
37	Correct	2 ms	380 KB	Output is correct
38	Correct	2 ms	376 KB	Output is correct

Subtask #4
0 / 55.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	256 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	256 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	256 KB	Output is correct
15	Correct	2 ms	256 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	380 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	424 KB	Output is correct
20	Correct	2 ms	256 KB	Output is correct
21	Correct	2 ms	256 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	2 ms	256 KB	Output is correct
24	Correct	2 ms	380 KB	Output is correct
25	Correct	2 ms	376 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct
27	Correct	2 ms	376 KB	Output is correct
28	Correct	2 ms	256 KB	Output is correct
29	Correct	2 ms	376 KB	Output is correct
30	Correct	2 ms	376 KB	Output is correct
31	Correct	2 ms	376 KB	Output is correct
32	Correct	2 ms	376 KB	Output is correct
33	Correct	2 ms	376 KB	Output is correct
34	Correct	2 ms	376 KB	Output is correct
35	Correct	2 ms	376 KB	Output is correct
36	Correct	2 ms	376 KB	Output is correct
37	Correct	2 ms	380 KB	Output is correct
38	Correct	2 ms	376 KB	Output is correct
39	Correct	258 ms	27888 KB	Output is correct
40	Correct	552 ms	45712 KB	Output is correct
41	Correct	196 ms	22776 KB	Output is correct
42	Correct	214 ms	20088 KB	Output is correct
43	Correct	152 ms	14364 KB	Output is correct
44	Correct	629 ms	57884 KB	Output is correct
45	Correct	586 ms	57908 KB	Output is correct
46	Correct	632 ms	58104 KB	Output is correct
47	Correct	504 ms	57976 KB	Output is correct
48	Correct	501 ms	58164 KB	Output is correct
49	Correct	1421 ms	58072 KB	Output is correct
50	Correct	1435 ms	57928 KB	Output is correct
51	Correct	1460 ms	58068 KB	Output is correct
52	Correct	1393 ms	58064 KB	Output is correct
53	Correct	1183 ms	58016 KB	Output is correct
54	Correct	1312 ms	57976 KB	Output is correct
55	Execution timed out	1570 ms	57988 KB	Time limit exceeded
56	Halted	0 ms	0 KB	-

답안 #94414

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 16.0 / 16.0

Subtask #3 20.0 / 20.0

Subtask #4 0 / 55.0

Subtask #1
9.0 / 9.0

Subtask #2
16.0 / 16.0

Subtask #3
20.0 / 20.0

Subtask #4
0 / 55.0