답안 #251013

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
251013	2020-07-19T23:17:35 Z	WhaleVomit	Money (IZhO17_money)	C++14	45 / 100	1500 ms	51832 KB

money

#include <bits/stdc++.h>
using namespace std;

#define f first
#define s second
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define sz(v) (int)v.size()

#define MOO(i, a, b) for(int i=a; i<b; i++)
#define M00(i, a) for(int i=0; i<a; i++)
#define MOOd(i,a,b) for(int i = (b)-1; i >= a; i--)
#define M00d(i,a) for(int i = (a)-1; i>=0; i--)

#define FAST ios::sync_with_stdio(0); cin.tie(0);
#define finish(x) return cout << x << '\n', 0;
#define dbg(x) cerr << ">>> " << #x << " = " << x << "\n";
#define _ << " _ " <<

template<class T> bool ckmin(T& a, const T& b) {return b < a ? a = b, 1 : 0;}
template<class T> bool ckmax(T& a, const T& b) {return a < b ? a = b, 1 : 0;}

typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int,int> pi;
typedef pair<ld,ld> pd;
typedef complex<ld> cd;

const int MAX_N = 1000010;
int n;
int arr[MAX_N];

int main() { FAST
    cin >> n;
    M00(i, n) cin >> arr[i];
    set<int> cur;
    int cnt = 1;
    int curmx = 0;
    int ub = 1e9;
    M00(i, n) {
        if(arr[i] >= curmx && arr[i] <= ub) {
            curmx = arr[i];
        } else {
            cnt++;
            curmx = arr[i];
            auto it = cur.upper_bound(arr[i]);
            if(it == cur.end()) ub = 1e9;
            else ub = *it;
        }
        cur.insert(arr[i]);
    }
    finish(cnt);
}

Subtask #1
9.0 / 9.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
0 / 55.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	0 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	0 ms	384 KB	Output is correct
14	Correct	0 ms	384 KB	Output is correct
15	Correct	0 ms	384 KB	Output is correct
16	Correct	0 ms	384 KB	Output is correct
17	Correct	0 ms	384 KB	Output is correct
18	Correct	0 ms	384 KB	Output is correct
19	Correct	0 ms	384 KB	Output is correct
20	Correct	0 ms	384 KB	Output is correct
21	Correct	1 ms	384 KB	Output is correct
22	Correct	0 ms	384 KB	Output is correct
23	Correct	0 ms	384 KB	Output is correct
24	Correct	0 ms	384 KB	Output is correct
25	Correct	0 ms	384 KB	Output is correct
26	Correct	1 ms	384 KB	Output is correct
27	Correct	0 ms	384 KB	Output is correct
28	Correct	0 ms	384 KB	Output is correct
29	Correct	0 ms	384 KB	Output is correct
30	Correct	0 ms	384 KB	Output is correct
31	Correct	1 ms	384 KB	Output is correct
32	Correct	0 ms	384 KB	Output is correct
33	Correct	1 ms	384 KB	Output is correct
34	Correct	0 ms	384 KB	Output is correct
35	Correct	0 ms	384 KB	Output is correct
36	Correct	0 ms	384 KB	Output is correct
37	Correct	1 ms	384 KB	Output is correct
38	Correct	1 ms	384 KB	Output is correct
39	Correct	71 ms	2808 KB	Output is correct
40	Correct	114 ms	3956 KB	Output is correct
41	Correct	57 ms	2332 KB	Output is correct
42	Correct	53 ms	2168 KB	Output is correct
43	Correct	37 ms	1784 KB	Output is correct
44	Correct	142 ms	4728 KB	Output is correct
45	Correct	141 ms	4856 KB	Output is correct
46	Correct	147 ms	4728 KB	Output is correct
47	Correct	130 ms	4728 KB	Output is correct
48	Correct	134 ms	4752 KB	Output is correct
49	Correct	520 ms	23292 KB	Output is correct
50	Correct	531 ms	23288 KB	Output is correct
51	Correct	592 ms	23288 KB	Output is correct
52	Correct	531 ms	23416 KB	Output is correct
53	Correct	543 ms	23288 KB	Output is correct
54	Correct	524 ms	23288 KB	Output is correct
55	Correct	1146 ms	51576 KB	Output is correct
56	Correct	1162 ms	51572 KB	Output is correct
57	Correct	1162 ms	51832 KB	Output is correct
58	Correct	1454 ms	51640 KB	Output is correct
59	Correct	1176 ms	51832 KB	Output is correct
60	Correct	1220 ms	51636 KB	Output is correct
61	Execution timed out	1510 ms	51576 KB	Time limit exceeded
62	Halted	0 ms	0 KB	-

답안 #251013

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