답안 #38232 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
38232	2018-01-03T05:00:49 Z	antimirage	Money (IZhO17_money)	C++14	45 / 100	1500 ms	21548 KB

money

#include <iostream>
#include <vector>
#include <deque>
#include <math.h>
#include <set>
#include <iomanip>
#include <time.h>
#include <list>
#include <stdio.h>
#include <queue>
#include <map>
#include <algorithm>
#include <assert.h>
#include <memory.h>

#define mk make_pair
#define sc second
#define fr first
#define pb emplace_back
#define all(s) s.begin(), s.end()
#define sz(s) ( (int)s.size() )

using namespace std;

const int N = 1e6 + 5;

int n, ar[N], cur, ans, l = 1, Pos = 1e9 + 7, t[N * 4], mx = 1e6 + 1;

void update (int pos, int v = 1, int tl = 1, int tr = mx)
{
    if (tl == tr)
        t[v] = 1;
    else
    {
        int tm = (tl + tr) >> 1;
        if (pos <= tm)
            update( pos, v + v, tl, tm );
        else
            update( pos, v + v + 1, tm + 1, tr);

        t[v] = t[v + v] + t[v + v + 1];
    }
}
int get (int val, int v = 1, int tl = 1, int tr = mx)
{
    if (!t[v] || val > tr)
        return 1e9 + 7;

    if (tl == tr)
        return tl;

    int tm = (tl + tr) >> 1;

    return min( get( val, v + v, tl, tm ), get ( val, v + v + 1, tm + 1, tr ) );
}
main ()
{
    scanf("%d", &n);

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

    cur = ar[1];

    int i = 1;

    while (i <= n)
    {
        if ( ar[i] < ar[i - 1] || Pos < ar[i] )
        {
            ans++;
            cur = ar[i];

            while ( l < i )
                update( ar[l] ), l++;

            Pos = get( cur + 1 );
        }
        i++;
    }
    printf("%d\n", ans + 1);
}
/**
8
1 17 13 18 4 15 19 17
**/

Compilation message

money.cpp:56:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main ()
       ^
money.cpp: In function 'int main()':
money.cpp:58:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
                    ^
money.cpp:61:28: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &ar[i]);
                            ^

Subtask #1
9.0 / 9.0

#	결과	메모리	Grader output
1	Correct	21548 KB	Output is correct
2	Correct	21548 KB	Output is correct
3	Correct	21548 KB	Output is correct
4	Correct	21548 KB	Output is correct
5	Correct	21548 KB	Output is correct
6	Correct	21548 KB	Output is correct
7	Correct	21548 KB	Output is correct
8	Correct	21548 KB	Output is correct
9	Correct	21548 KB	Output is correct
10	Correct	21548 KB	Output is correct
11	Correct	21548 KB	Output is correct
12	Correct	21548 KB	Output is correct
13	Correct	21548 KB	Output is correct
14	Correct	21548 KB	Output is correct
15	Correct	21548 KB	Output is correct
16	Correct	21548 KB	Output is correct

Subtask #2
16.0 / 16.0

#	결과	메모리	Grader output
1	Correct	21548 KB	Output is correct
2	Correct	21548 KB	Output is correct
3	Correct	21548 KB	Output is correct
4	Correct	21548 KB	Output is correct
5	Correct	21548 KB	Output is correct
6	Correct	21548 KB	Output is correct
7	Correct	21548 KB	Output is correct
8	Correct	21548 KB	Output is correct
9	Correct	21548 KB	Output is correct
10	Correct	21548 KB	Output is correct
11	Correct	21548 KB	Output is correct
12	Correct	21548 KB	Output is correct
13	Correct	21548 KB	Output is correct
14	Correct	21548 KB	Output is correct
15	Correct	21548 KB	Output is correct
16	Correct	21548 KB	Output is correct
17	Correct	21548 KB	Output is correct
18	Correct	21548 KB	Output is correct
19	Correct	21548 KB	Output is correct
20	Correct	21548 KB	Output is correct
21	Correct	21548 KB	Output is correct
22	Correct	21548 KB	Output is correct
23	Correct	21548 KB	Output is correct
24	Correct	21548 KB	Output is correct
25	Correct	21548 KB	Output is correct
26	Correct	21548 KB	Output is correct

Subtask #3
20.0 / 20.0

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

Subtask #4
0 / 55.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	21548 KB	Output is correct
2	Correct	0 ms	21548 KB	Output is correct
3	Correct	0 ms	21548 KB	Output is correct
4	Correct	0 ms	21548 KB	Output is correct
5	Correct	0 ms	21548 KB	Output is correct
6	Correct	0 ms	21548 KB	Output is correct
7	Correct	0 ms	21548 KB	Output is correct
8	Correct	0 ms	21548 KB	Output is correct
9	Correct	0 ms	21548 KB	Output is correct
10	Correct	0 ms	21548 KB	Output is correct
11	Correct	0 ms	21548 KB	Output is correct
12	Correct	0 ms	21548 KB	Output is correct
13	Correct	0 ms	21548 KB	Output is correct
14	Correct	0 ms	21548 KB	Output is correct
15	Correct	0 ms	21548 KB	Output is correct
16	Correct	0 ms	21548 KB	Output is correct
17	Correct	0 ms	21548 KB	Output is correct
18	Correct	0 ms	21548 KB	Output is correct
19	Correct	0 ms	21548 KB	Output is correct
20	Correct	0 ms	21548 KB	Output is correct
21	Correct	0 ms	21548 KB	Output is correct
22	Correct	0 ms	21548 KB	Output is correct
23	Correct	0 ms	21548 KB	Output is correct
24	Correct	0 ms	21548 KB	Output is correct
25	Correct	0 ms	21548 KB	Output is correct
26	Correct	0 ms	21548 KB	Output is correct
27	Correct	0 ms	21548 KB	Output is correct
28	Correct	0 ms	21548 KB	Output is correct
29	Correct	0 ms	21548 KB	Output is correct
30	Correct	0 ms	21548 KB	Output is correct
31	Correct	0 ms	21548 KB	Output is correct
32	Correct	0 ms	21548 KB	Output is correct
33	Correct	0 ms	21548 KB	Output is correct
34	Correct	0 ms	21548 KB	Output is correct
35	Correct	0 ms	21548 KB	Output is correct
36	Correct	0 ms	21548 KB	Output is correct
37	Correct	0 ms	21548 KB	Output is correct
38	Correct	0 ms	21548 KB	Output is correct
39	Correct	236 ms	21548 KB	Output is correct
40	Correct	679 ms	21548 KB	Output is correct
41	Correct	203 ms	21548 KB	Output is correct
42	Correct	359 ms	21548 KB	Output is correct
43	Correct	263 ms	21548 KB	Output is correct
44	Correct	686 ms	21548 KB	Output is correct
45	Correct	589 ms	21548 KB	Output is correct
46	Correct	676 ms	21548 KB	Output is correct
47	Correct	303 ms	21548 KB	Output is correct
48	Correct	429 ms	21548 KB	Output is correct
49	Execution timed out	1500 ms	21548 KB	Execution timed out
50	Halted	0 ms	0 KB	-

답안 #38232

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