답안 #51328 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
51328	2018-06-17T13:36:58 Z	Nicksechko	Money (IZhO17_money)	C++14	45 / 100	1500 ms	154876 KB

money

#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <cstdio>
#include <string>
#include <vector>
#include <algorithm>
#include <random>
#include <chrono>
#include <queue>
#include <unordered_map>
//#include <unordered_set>
#include <iomanip>
#include <stack>
#include <ctime>
#include <cassert>
#include <cmath>

#define y1 ups
#define left lll
#define right rrr
#define next nnn
//#define find fff

typedef unsigned long long ull;

using namespace std;

//mt19937_64 twister(chrono::steady_clock().now().time_since_epoch().count());
//mt19937_64 twister(8888);
//
//long long rnd(long long l, long long r)
//{
//    uniform_int_distribution<long long> dis(l, r);
//    return dis(twister);
//}

const int mod = (int)1e9 + 9;
//const int mod[2] = {(int)1e9 + 7, (int)1e9 + 9};
//const int st[2] = {887, 8887};'
const int maxn = 2e6 + 88;
const int inf = 1e9 + 88;
const int logn = 22;
const int maxa = 500*500 + 88;
const int block = 775;
const long long infll = 1e18 + 88;
const char sgl[5] = {'a', 'e', 'i', 'o', 'u'};
const int dx[] = {-1, 1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const int knightx[] = {-2, -2, -1, -1, 1, 1, 2, 2};
const int knighty[] = {-1, 1, -2, 2, -2, 2, -1, 1};
const int kingx[] = {-1, -1, -1, 0, 0, 1, 1, 1};
const int kingy[] = {-1, 0, 1, -1, 1, -1, 0, 1};
const char sep = 'a' - 1;
const double eps = 1e-9;
const int maxn1 = 1e3 + 88;

//#define int long long

set<int> s;
int a[maxn];

void solve()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
//    ifstream cin("input.txt");
//    ofstream cout("output.txt");
//    ifstream cin("bootfall.in");
//    ofstream cout("bootfall.out");
    int n, ans = 0, i = 0;
    cin >> n;
    for (i = 0; i < n; i++)
        cin >> a[i];
    i = 0;
    while (i < n)
    {
        int rg = inf, lg = 0;
        auto it = s.upper_bound(a[i]);
        if (it != s.end())
            rg = *it;
        if (it != s.begin())
            lg = *(--it);
        ans++;
        while (i < n && lg <= a[i] && a[i] <= rg)
        {
            lg = max(lg, a[i]);
            s.insert(a[i]);
            i++;
        }
    }
    cout << ans;
}

//#undef int

int main()
{
//    srand(time(0));
//    srand(8);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
//    ifstream cin("input.txt");
//    ofstream cout("output.txt");
//    ifstream cin("output.txt");
//    ifstream fin("12.out");
//    int a, b, i = 0;
//    while (cin >> a)
//    {
//        fin >> b;
//        if (a != b)
//        {
//            cout << i << " " << a << " " << b;
//            return 0;
//        }
//        i++;
//    }
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);
//    freopen("f.in", "r", stdin);
//    freopen("f.out", "w", stdout);
//    int t = 10000;
//    while (t--)
//    {
//        if (t == 9947)
//            t = 9947;
//        gen();
//        cout << t << endl;
//        brut();
//        if (!solve())
//        {
//            cout << "kek";
//            return 0;
//        }
//    }
    solve();
    return 0;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
0 / 55.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	456 KB	Output is correct
3	Correct	2 ms	456 KB	Output is correct
4	Correct	2 ms	456 KB	Output is correct
5	Correct	2 ms	480 KB	Output is correct
6	Correct	2 ms	480 KB	Output is correct
7	Correct	2 ms	592 KB	Output is correct
8	Correct	2 ms	768 KB	Output is correct
9	Correct	2 ms	768 KB	Output is correct
10	Correct	3 ms	768 KB	Output is correct
11	Correct	3 ms	768 KB	Output is correct
12	Correct	2 ms	768 KB	Output is correct
13	Correct	2 ms	768 KB	Output is correct
14	Correct	3 ms	768 KB	Output is correct
15	Correct	4 ms	768 KB	Output is correct
16	Correct	2 ms	768 KB	Output is correct
17	Correct	3 ms	768 KB	Output is correct
18	Correct	2 ms	768 KB	Output is correct
19	Correct	2 ms	768 KB	Output is correct
20	Correct	2 ms	768 KB	Output is correct
21	Correct	2 ms	768 KB	Output is correct
22	Correct	2 ms	768 KB	Output is correct
23	Correct	3 ms	768 KB	Output is correct
24	Correct	2 ms	768 KB	Output is correct
25	Correct	2 ms	768 KB	Output is correct
26	Correct	2 ms	768 KB	Output is correct
27	Correct	2 ms	768 KB	Output is correct
28	Correct	3 ms	768 KB	Output is correct
29	Correct	2 ms	768 KB	Output is correct
30	Correct	2 ms	768 KB	Output is correct
31	Correct	2 ms	768 KB	Output is correct
32	Correct	2 ms	768 KB	Output is correct
33	Correct	2 ms	768 KB	Output is correct
34	Correct	3 ms	768 KB	Output is correct
35	Correct	2 ms	768 KB	Output is correct
36	Correct	2 ms	768 KB	Output is correct
37	Correct	3 ms	768 KB	Output is correct
38	Correct	3 ms	768 KB	Output is correct
39	Correct	75 ms	5604 KB	Output is correct
40	Correct	147 ms	12332 KB	Output is correct
41	Correct	59 ms	13272 KB	Output is correct
42	Correct	58 ms	15380 KB	Output is correct
43	Correct	39 ms	16844 KB	Output is correct
44	Correct	144 ms	26560 KB	Output is correct
45	Correct	138 ms	33060 KB	Output is correct
46	Correct	148 ms	40008 KB	Output is correct
47	Correct	127 ms	47072 KB	Output is correct
48	Correct	136 ms	53728 KB	Output is correct
49	Correct	737 ms	79072 KB	Output is correct
50	Correct	698 ms	85928 KB	Output is correct
51	Correct	726 ms	92624 KB	Output is correct
52	Correct	749 ms	99616 KB	Output is correct
53	Correct	647 ms	106228 KB	Output is correct
54	Correct	616 ms	112944 KB	Output is correct
55	Correct	1435 ms	148104 KB	Output is correct
56	Execution timed out	1542 ms	154876 KB	Time limit exceeded
57	Halted	0 ms	0 KB	-

답안 #51328

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