답안 #56097 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
56097	2018-07-10T00:38:53 Z	Benq	Mountains (IOI17_mountains)	C++14	100 / 100	60 ms	15332 KB

mountains

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;

int dp[2000][2000], pos[2000];

bool above(pi a, pi b, pi c) {
    b.f -= a.f, b.s -= a.s;
    c.f -= a.f, c.s -= a.s;
    return (ll)c.s*b.f-(ll)c.f*b.s >= 0;
}

int get(int l, int r) {
    if (l > r) return 0;
    return dp[l][r];
}

void ad(int x, int y) {
    pos[x] = y;
    dp[x][x] = 1;
    int sum = 1, bes = x;
    vi cur = {x};
    
    F0Rd(i,x) {
        dp[i][x] = dp[i][x-1];
        if (above({i,pos[i]},{bes,pos[bes]},{x,pos[x]})) {
            bes = i;
            sum += get(i+1,cur.back()-1);
            cur.pb(i);
        }
        
        dp[i][x] = max(dp[i][x],sum+get(i,cur.back()-1));
    }
}

int maximum_deevs(vi v) {
    F0R(i,sz(v)) ad(i,v[i]);
    return dp[0][sz(v)-1];
}

/*int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cout << maximum_deevs({1,2,3,4,5,6});
}*/

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	2 ms	360 KB	Output is correct
3	Correct	2 ms	540 KB	Output is correct
4	Correct	2 ms	564 KB	Output is correct
5	Correct	3 ms	564 KB	Output is correct
6	Correct	3 ms	564 KB	Output is correct
7	Correct	2 ms	564 KB	Output is correct
8	Correct	3 ms	732 KB	Output is correct
9	Correct	2 ms	768 KB	Output is correct
10	Correct	3 ms	768 KB	Output is correct
11	Correct	2 ms	768 KB	Output is correct
12	Correct	2 ms	800 KB	Output is correct
13	Correct	2 ms	800 KB	Output is correct
14	Correct	3 ms	800 KB	Output is correct
15	Correct	3 ms	808 KB	Output is correct
16	Correct	2 ms	808 KB	Output is correct

Subtask #2
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	2 ms	360 KB	Output is correct
3	Correct	2 ms	540 KB	Output is correct
4	Correct	2 ms	564 KB	Output is correct
5	Correct	3 ms	564 KB	Output is correct
6	Correct	3 ms	564 KB	Output is correct
7	Correct	2 ms	564 KB	Output is correct
8	Correct	3 ms	732 KB	Output is correct
9	Correct	2 ms	768 KB	Output is correct
10	Correct	3 ms	768 KB	Output is correct
11	Correct	2 ms	768 KB	Output is correct
12	Correct	2 ms	800 KB	Output is correct
13	Correct	2 ms	800 KB	Output is correct
14	Correct	3 ms	800 KB	Output is correct
15	Correct	3 ms	808 KB	Output is correct
16	Correct	2 ms	808 KB	Output is correct
17	Correct	3 ms	892 KB	Output is correct
18	Correct	3 ms	896 KB	Output is correct
19	Correct	3 ms	900 KB	Output is correct
20	Correct	3 ms	904 KB	Output is correct
21	Correct	3 ms	908 KB	Output is correct
22	Correct	3 ms	1040 KB	Output is correct
23	Correct	3 ms	1040 KB	Output is correct
24	Correct	3 ms	1040 KB	Output is correct
25	Correct	3 ms	1040 KB	Output is correct
26	Correct	2 ms	1040 KB	Output is correct
27	Correct	3 ms	1040 KB	Output is correct
28	Correct	4 ms	1040 KB	Output is correct
29	Correct	3 ms	1040 KB	Output is correct
30	Correct	3 ms	1040 KB	Output is correct
31	Correct	3 ms	1040 KB	Output is correct
32	Correct	3 ms	1040 KB	Output is correct
33	Correct	3 ms	1100 KB	Output is correct
34	Correct	2 ms	1100 KB	Output is correct
35	Correct	2 ms	1100 KB	Output is correct
36	Correct	2 ms	1100 KB	Output is correct
37	Correct	3 ms	1100 KB	Output is correct
38	Correct	4 ms	1100 KB	Output is correct

Subtask #3
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	2 ms	360 KB	Output is correct
3	Correct	2 ms	540 KB	Output is correct
4	Correct	2 ms	564 KB	Output is correct
5	Correct	3 ms	564 KB	Output is correct
6	Correct	3 ms	564 KB	Output is correct
7	Correct	2 ms	564 KB	Output is correct
8	Correct	3 ms	732 KB	Output is correct
9	Correct	2 ms	768 KB	Output is correct
10	Correct	3 ms	768 KB	Output is correct
11	Correct	2 ms	768 KB	Output is correct
12	Correct	2 ms	800 KB	Output is correct
13	Correct	2 ms	800 KB	Output is correct
14	Correct	3 ms	800 KB	Output is correct
15	Correct	3 ms	808 KB	Output is correct
16	Correct	2 ms	808 KB	Output is correct
17	Correct	3 ms	892 KB	Output is correct
18	Correct	3 ms	896 KB	Output is correct
19	Correct	3 ms	900 KB	Output is correct
20	Correct	3 ms	904 KB	Output is correct
21	Correct	3 ms	908 KB	Output is correct
22	Correct	3 ms	1040 KB	Output is correct
23	Correct	3 ms	1040 KB	Output is correct
24	Correct	3 ms	1040 KB	Output is correct
25	Correct	3 ms	1040 KB	Output is correct
26	Correct	2 ms	1040 KB	Output is correct
27	Correct	3 ms	1040 KB	Output is correct
28	Correct	4 ms	1040 KB	Output is correct
29	Correct	3 ms	1040 KB	Output is correct
30	Correct	3 ms	1040 KB	Output is correct
31	Correct	3 ms	1040 KB	Output is correct
32	Correct	3 ms	1040 KB	Output is correct
33	Correct	3 ms	1100 KB	Output is correct
34	Correct	2 ms	1100 KB	Output is correct
35	Correct	2 ms	1100 KB	Output is correct
36	Correct	2 ms	1100 KB	Output is correct
37	Correct	3 ms	1100 KB	Output is correct
38	Correct	4 ms	1100 KB	Output is correct
39	Correct	4 ms	1640 KB	Output is correct
40	Correct	4 ms	2156 KB	Output is correct
41	Correct	4 ms	2160 KB	Output is correct
42	Correct	5 ms	2188 KB	Output is correct
43	Correct	3 ms	2188 KB	Output is correct
44	Correct	4 ms	2188 KB	Output is correct
45	Correct	4 ms	2188 KB	Output is correct
46	Correct	4 ms	2188 KB	Output is correct
47	Correct	6 ms	2312 KB	Output is correct
48	Correct	5 ms	2312 KB	Output is correct
49	Correct	6 ms	2312 KB	Output is correct
50	Correct	5 ms	2312 KB	Output is correct
51	Correct	4 ms	2312 KB	Output is correct
52	Correct	4 ms	2332 KB	Output is correct
53	Correct	4 ms	2336 KB	Output is correct
54	Correct	5 ms	2364 KB	Output is correct
55	Correct	5 ms	2364 KB	Output is correct
56	Correct	5 ms	2364 KB	Output is correct
57	Correct	4 ms	2364 KB	Output is correct
58	Correct	4 ms	2384 KB	Output is correct
59	Correct	5 ms	2384 KB	Output is correct
60	Correct	4 ms	2388 KB	Output is correct
61	Correct	5 ms	2388 KB	Output is correct

Subtask #4
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	2 ms	360 KB	Output is correct
3	Correct	2 ms	540 KB	Output is correct
4	Correct	2 ms	564 KB	Output is correct
5	Correct	3 ms	564 KB	Output is correct
6	Correct	3 ms	564 KB	Output is correct
7	Correct	2 ms	564 KB	Output is correct
8	Correct	3 ms	732 KB	Output is correct
9	Correct	2 ms	768 KB	Output is correct
10	Correct	3 ms	768 KB	Output is correct
11	Correct	2 ms	768 KB	Output is correct
12	Correct	2 ms	800 KB	Output is correct
13	Correct	2 ms	800 KB	Output is correct
14	Correct	3 ms	800 KB	Output is correct
15	Correct	3 ms	808 KB	Output is correct
16	Correct	2 ms	808 KB	Output is correct
17	Correct	3 ms	892 KB	Output is correct
18	Correct	3 ms	896 KB	Output is correct
19	Correct	3 ms	900 KB	Output is correct
20	Correct	3 ms	904 KB	Output is correct
21	Correct	3 ms	908 KB	Output is correct
22	Correct	3 ms	1040 KB	Output is correct
23	Correct	3 ms	1040 KB	Output is correct
24	Correct	3 ms	1040 KB	Output is correct
25	Correct	3 ms	1040 KB	Output is correct
26	Correct	2 ms	1040 KB	Output is correct
27	Correct	3 ms	1040 KB	Output is correct
28	Correct	4 ms	1040 KB	Output is correct
29	Correct	3 ms	1040 KB	Output is correct
30	Correct	3 ms	1040 KB	Output is correct
31	Correct	3 ms	1040 KB	Output is correct
32	Correct	3 ms	1040 KB	Output is correct
33	Correct	3 ms	1100 KB	Output is correct
34	Correct	2 ms	1100 KB	Output is correct
35	Correct	2 ms	1100 KB	Output is correct
36	Correct	2 ms	1100 KB	Output is correct
37	Correct	3 ms	1100 KB	Output is correct
38	Correct	4 ms	1100 KB	Output is correct
39	Correct	4 ms	1640 KB	Output is correct
40	Correct	4 ms	2156 KB	Output is correct
41	Correct	4 ms	2160 KB	Output is correct
42	Correct	5 ms	2188 KB	Output is correct
43	Correct	3 ms	2188 KB	Output is correct
44	Correct	4 ms	2188 KB	Output is correct
45	Correct	4 ms	2188 KB	Output is correct
46	Correct	4 ms	2188 KB	Output is correct
47	Correct	6 ms	2312 KB	Output is correct
48	Correct	5 ms	2312 KB	Output is correct
49	Correct	6 ms	2312 KB	Output is correct
50	Correct	5 ms	2312 KB	Output is correct
51	Correct	4 ms	2312 KB	Output is correct
52	Correct	4 ms	2332 KB	Output is correct
53	Correct	4 ms	2336 KB	Output is correct
54	Correct	5 ms	2364 KB	Output is correct
55	Correct	5 ms	2364 KB	Output is correct
56	Correct	5 ms	2364 KB	Output is correct
57	Correct	4 ms	2364 KB	Output is correct
58	Correct	4 ms	2384 KB	Output is correct
59	Correct	5 ms	2384 KB	Output is correct
60	Correct	4 ms	2388 KB	Output is correct
61	Correct	5 ms	2388 KB	Output is correct
62	Correct	14 ms	6976 KB	Output is correct
63	Correct	55 ms	14964 KB	Output is correct
64	Correct	42 ms	14964 KB	Output is correct
65	Correct	47 ms	15040 KB	Output is correct
66	Correct	36 ms	15040 KB	Output is correct
67	Correct	38 ms	15040 KB	Output is correct
68	Correct	43 ms	15072 KB	Output is correct
69	Correct	52 ms	15092 KB	Output is correct
70	Correct	55 ms	15112 KB	Output is correct
71	Correct	55 ms	15112 KB	Output is correct
72	Correct	39 ms	15244 KB	Output is correct
73	Correct	49 ms	15244 KB	Output is correct
74	Correct	42 ms	15244 KB	Output is correct
75	Correct	39 ms	15244 KB	Output is correct
76	Correct	39 ms	15244 KB	Output is correct
77	Correct	60 ms	15244 KB	Output is correct
78	Correct	39 ms	15244 KB	Output is correct
79	Correct	35 ms	15244 KB	Output is correct
80	Correct	39 ms	15244 KB	Output is correct
81	Correct	39 ms	15256 KB	Output is correct
82	Correct	34 ms	15276 KB	Output is correct
83	Correct	45 ms	15296 KB	Output is correct
84	Correct	40 ms	15296 KB	Output is correct
85	Correct	37 ms	15312 KB	Output is correct
86	Correct	38 ms	15332 KB	Output is correct

답안 #56097

Compilation message

Subtask #1 20.0 / 20.0

Subtask #2 20.0 / 20.0

Subtask #3 30.0 / 30.0

Subtask #4 30.0 / 30.0

Subtask #1
20.0 / 20.0

Subtask #2
20.0 / 20.0

Subtask #3
30.0 / 30.0

Subtask #4
30.0 / 30.0