oj.uz

답안 #646536

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
646536 2022-09-30T01:47:57 Z ghostwriter Bigger segments (IZhO19_segments) C++14
100 / 100
 269 ms 20836 KB 
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.h>
#else
#define debug(...)
#endif
#define ft front
#define bk back
#define st first
#define nd second
#define ins insert
#define ers erase
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define bg begin
#define ed end
#define all(x) (x).bg(), (x).ed()
#define sz(x) (int)(x).size()
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
template<typename T> T gcd(T a, T b) { return (b == 0? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
#define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i))
#define FRN(i, n) for (int (i) = 0; (i) < (n); ++(i))
#define FSN(i, n) for (int (i) = (n) - 1; (i) >= 0; --(i))
#define EACH(i, x) for (auto &(i) : (x))
#define WHILE while
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
----------------------------------------------------------------
    END OF TEMPLATE
----------------------------------------------------------------
    Tran The Bao - ghostwriter
    Training for VOI23 gold medal
----------------------------------------------------------------
    DIT ME CHUYEN BAO LOC
----------------------------------------------------------------
*/
const ll oo = 1e18 + 5;
const int N = 5e5 + 5;
int n, a[N], d[N];
ll d1[N], f[N], f1[N];
void upd(int ps, ll v) { for (int i = ps; i >= 1; i -= (i & -i)) f1[i] = min(f1[i], v); }
ll get(int ps) { ll rs = oo; for (int i = ps; i <= n; i += (i & -i)) rs = min(rs, f1[i]); return rs; }
signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);
    cin >> n;
    FOR(i, 1, n) {
    	cin >> a[i];
    	f[i] = f[i - 1] + a[i];
    }
    d[1] = 1;
    d1[1] = a[1];
    FOR(i, 1, n) f1[i] = oo;
    upd(1, f[1] + d1[1]);
    FOR(i, 2, n) {
    	int l = 1, r = i - 1, ans = -1;
    	WHILE(l <= r) {
    		int mid = l + (r - l) / 2;
    		if (f[i] >= get(mid)) {
    			ans = mid;
    			l = mid + 1;
    		}
    		else r = mid - 1;
    	}
    	if (ans != -1) {
    		d[i] = d[ans] + 1;
    		d1[i] = f[i] - f[ans];
    	}
    	else {
    		d[i] = d[i - 1];
    		d1[i] = d1[i - 1] + a[i];
    	}
    	upd(i, f[i] + d1[i]);
    }
    cout << d[n];
    return 0;
}
/*
3
909799869 504591156 482661277
----------------------------------------------------------------
From Benq:
    stuff you should look for
        * int overflow, array bounds
        * special cases (n=1?)
        * do smth instead of nothing and stay organized
        * WRITE STUFF DOWN
        * DON'T GET STUCK ON ONE APPROACH
----------------------------------------------------------------
*/

Compilation message

segments.cpp: In function 'int main()':
segments.cpp:32:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
segments.cpp:62:5: note: in expansion of macro 'FOR'
   62 |     FOR(i, 1, n) {
      |     ^~~
segments.cpp:32:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
segments.cpp:68:5: note: in expansion of macro 'FOR'
   68 |     FOR(i, 1, n) f1[i] = oo;
      |     ^~~
segments.cpp:32:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
segments.cpp:70:5: note: in expansion of macro 'FOR'
   70 |     FOR(i, 2, n) {
      |     ^~~

Subtask #1
13.0 / 13.0

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

Subtask #2
14.0 / 14.0

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

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 476 KB Output is correct
32 Correct 1 ms 400 KB Output is correct
33 Correct 2 ms 476 KB Output is correct
34 Correct 1 ms 476 KB Output is correct
35 Correct 2 ms 472 KB Output is correct
36 Correct 2 ms 468 KB Output is correct
37 Correct 1 ms 468 KB Output is correct
38 Correct 2 ms 340 KB Output is correct
39 Correct 2 ms 468 KB Output is correct
40 Correct 1 ms 476 KB Output is correct
41 Correct 2 ms 468 KB Output is correct
42 Correct 1 ms 468 KB Output is correct
43 Correct 1 ms 464 KB Output is correct
44 Correct 1 ms 468 KB Output is correct
45 Correct 1 ms 468 KB Output is correct

Subtask #4
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 476 KB Output is correct
32 Correct 1 ms 400 KB Output is correct
33 Correct 2 ms 476 KB Output is correct
34 Correct 1 ms 476 KB Output is correct
35 Correct 2 ms 472 KB Output is correct
36 Correct 2 ms 468 KB Output is correct
37 Correct 1 ms 468 KB Output is correct
38 Correct 2 ms 340 KB Output is correct
39 Correct 2 ms 468 KB Output is correct
40 Correct 1 ms 476 KB Output is correct
41 Correct 2 ms 468 KB Output is correct
42 Correct 1 ms 468 KB Output is correct
43 Correct 1 ms 464 KB Output is correct
44 Correct 1 ms 468 KB Output is correct
45 Correct 1 ms 468 KB Output is correct
46 Correct 38 ms 3792 KB Output is correct
47 Correct 43 ms 3948 KB Output is correct
48 Correct 52 ms 4180 KB Output is correct
49 Correct 48 ms 4316 KB Output is correct
50 Correct 41 ms 4412 KB Output is correct
51 Correct 45 ms 4400 KB Output is correct
52 Correct 21 ms 2392 KB Output is correct
53 Correct 13 ms 1548 KB Output is correct
54 Correct 41 ms 3692 KB Output is correct
55 Correct 53 ms 4360 KB Output is correct
56 Correct 44 ms 3948 KB Output is correct
57 Correct 41 ms 3832 KB Output is correct
58 Correct 39 ms 3884 KB Output is correct
59 Correct 40 ms 4032 KB Output is correct
60 Correct 45 ms 4000 KB Output is correct

Subtask #5
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 476 KB Output is correct
32 Correct 1 ms 400 KB Output is correct
33 Correct 2 ms 476 KB Output is correct
34 Correct 1 ms 476 KB Output is correct
35 Correct 2 ms 472 KB Output is correct
36 Correct 2 ms 468 KB Output is correct
37 Correct 1 ms 468 KB Output is correct
38 Correct 2 ms 340 KB Output is correct
39 Correct 2 ms 468 KB Output is correct
40 Correct 1 ms 476 KB Output is correct
41 Correct 2 ms 468 KB Output is correct
42 Correct 1 ms 468 KB Output is correct
43 Correct 1 ms 464 KB Output is correct
44 Correct 1 ms 468 KB Output is correct
45 Correct 1 ms 468 KB Output is correct
46 Correct 38 ms 3792 KB Output is correct
47 Correct 43 ms 3948 KB Output is correct
48 Correct 52 ms 4180 KB Output is correct
49 Correct 48 ms 4316 KB Output is correct
50 Correct 41 ms 4412 KB Output is correct
51 Correct 45 ms 4400 KB Output is correct
52 Correct 21 ms 2392 KB Output is correct
53 Correct 13 ms 1548 KB Output is correct
54 Correct 41 ms 3692 KB Output is correct
55 Correct 53 ms 4360 KB Output is correct
56 Correct 44 ms 3948 KB Output is correct
57 Correct 41 ms 3832 KB Output is correct
58 Correct 39 ms 3884 KB Output is correct
59 Correct 40 ms 4032 KB Output is correct
60 Correct 45 ms 4000 KB Output is correct
61 Correct 237 ms 17824 KB Output is correct
62 Correct 240 ms 17900 KB Output is correct
63 Correct 263 ms 18228 KB Output is correct
64 Correct 243 ms 20488 KB Output is correct
65 Correct 263 ms 20772 KB Output is correct
66 Correct 260 ms 20788 KB Output is correct
67 Correct 212 ms 16944 KB Output is correct
68 Correct 101 ms 8488 KB Output is correct
69 Correct 236 ms 17008 KB Output is correct
70 Correct 269 ms 20836 KB Output is correct
71 Correct 240 ms 17896 KB Output is correct
72 Correct 236 ms 18268 KB Output is correct
73 Correct 254 ms 18824 KB Output is correct
74 Correct 231 ms 19284 KB Output is correct
75 Correct 234 ms 19276 KB Output is correct