oj.uz

Submission #825136

# Submission time Handle Problem Language Result Execution time Memory
825136 2023-08-14T14:43:33 Z nasam Feast (NOI19_feast) C++17
100 / 100
 78 ms 5720 KB 
#include <bits/stdc++.h>
#define ll long long
#define FOR(i,a,b) for (int i = (a), _b = (b); i <= _b; i++)
#define FOD(i,b,a) for (int i = (b), _a = (a); i >= _a; i--)
#define FORE(i, v) for (__typeof((v).begin()) i = (v).begin(); i != (v).end(); i++)
#define ALL(v) (v).begin(), (v).end()
#define BIT(x, i) (((x) >> (i)) & 1)
#define MASK(i) (1LL << (i))
#define CNTBIT(x) __builtin_popcount(x)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define left ___left
#define right ___right
#define pii pair<int, int>
#define pll pair<ll, ll>
#define DEBUG(n, a) FOR (i, 1, n) cout << a[i] << ' '; cout << endl;
#define lob lower_bound // >=
#define upb upper_bound // >
#define endl "\n"
#define NAME "main"

using namespace std;

template<class X, class Y> bool maximize(X &x, Y y){ if (x < y){ x = y; return true; } return false; }
template<class X, class Y> bool minimize(X &x, Y y){ if (x > y){ x = y; return true; } return false; }

#define  gogobruhbruh  ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
#define  file(name)  if (fopen (name".inp", "r")) { freopen (name".inp", "r", stdin); freopen (name".out", "w", stdout); }

const int MOD = 1e9 + 7;

void add(int &a, int b){ if ((a += b) >= MOD) a -= MOD; }
int sub(int a, int b){ if ((a -= b) < 0) a += MOD; return a; }
int muti(int a, int b){ return (1LL * a * b) % MOD; }
int Pow(int x, int y){ int res = 1; for (; y; y >>= 1){ if (y & 1) res = muti(res, x); x = muti(x, x); } return res; }

const int MAX = 3e5 + 7;
const ll INF = 1e18 + 5;

int num, lim;
ll pre[MAX], dp[MAX], left, right;

#define state pair<ll, int>

void maxx(state &a, state b, ll val, bool ok){
    b.fi += val; b.se += ok;
    if (a.fi == b.fi && a.se > b.se)
        a = b;
    if (a.fi < b.fi)
        a = b;
}

state calc(ll cost){
    state Max, res;
    Max = res = {0, 0};
    FOR (i, 1, num){
        maxx(res, Max, pre[i] + cost, 1);
        maxx(Max, res, -pre[i], 0);
    }
    return res;
}

void solve(){
//    cout << pre[num] << endl;
//    cout << calc(2).fi - calc(2).se * 2 << endl;
//    DEBUG(num, pre);
    ll left = -3e14, right = 0;
    while (left < right){
        ll mid = (left + right) >> 1;
        if (calc(mid).se >= lim)
            right = mid;
        else
            left = mid + 1;
    }
    state res = calc(left);
    cout << res.fi - left * lim;
}

void read(){
    cin >> num >> lim;
    ll Min = 0;
    FOR (i, 1, num)
        cin >> pre[i],
        pre[i] += pre[i - 1],
        maximize(right, pre[i] - Min),
        minimize(Min, pre[i]);
}

int main(){
    gogobruhbruh;
    file("main");
    int test = 1;
//    cin >> test;
    while (test--)
        read(),
        solve();
}

Compilation message

feast.cpp: In function 'int main()':
feast.cpp:30:61: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 | #define  file(name)  if (fopen (name".inp", "r")) { freopen (name".inp", "r", stdin); freopen (name".out", "w", stdout); }
      |                                                     ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
feast.cpp:93:5: note: in expansion of macro 'file'
   93 |     file("main");
      |     ^~~~
feast.cpp:30:95: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 | #define  file(name)  if (fopen (name".inp", "r")) { freopen (name".inp", "r", stdin); freopen (name".out", "w", stdout); }
      |                                                                                       ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
feast.cpp:93:5: note: in expansion of macro 'file'
   93 |     file("main");
      |     ^~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 2488 KB Output is correct
2 Correct 66 ms 4036 KB Output is correct
3 Correct 72 ms 5544 KB Output is correct
4 Correct 70 ms 5452 KB Output is correct
5 Correct 70 ms 5480 KB Output is correct
6 Correct 66 ms 5396 KB Output is correct
7 Correct 65 ms 5268 KB Output is correct
8 Correct 66 ms 5500 KB Output is correct
9 Correct 65 ms 5400 KB Output is correct
10 Correct 66 ms 5452 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 2516 KB Output is correct
2 Correct 58 ms 2656 KB Output is correct
3 Correct 57 ms 2600 KB Output is correct
4 Correct 62 ms 2616 KB Output is correct
5 Correct 66 ms 3928 KB Output is correct
6 Correct 57 ms 3704 KB Output is correct
7 Correct 59 ms 3792 KB Output is correct
8 Correct 71 ms 4040 KB Output is correct
9 Correct 72 ms 3916 KB Output is correct
10 Correct 58 ms 3668 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 2644 KB Output is correct
2 Correct 66 ms 2608 KB Output is correct
3 Correct 71 ms 2628 KB Output is correct
4 Correct 67 ms 2604 KB Output is correct
5 Correct 66 ms 2624 KB Output is correct
6 Correct 72 ms 2644 KB Output is correct
7 Correct 73 ms 2636 KB Output is correct
8 Correct 73 ms 2624 KB Output is correct
9 Correct 70 ms 2656 KB Output is correct
10 Correct 67 ms 2648 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 324 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 324 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 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 336 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 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct

Subtask #7
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 2488 KB Output is correct
2 Correct 66 ms 4036 KB Output is correct
3 Correct 72 ms 5544 KB Output is correct
4 Correct 70 ms 5452 KB Output is correct
5 Correct 70 ms 5480 KB Output is correct
6 Correct 66 ms 5396 KB Output is correct
7 Correct 65 ms 5268 KB Output is correct
8 Correct 66 ms 5500 KB Output is correct
9 Correct 65 ms 5400 KB Output is correct
10 Correct 66 ms 5452 KB Output is correct
11 Correct 57 ms 2516 KB Output is correct
12 Correct 58 ms 2656 KB Output is correct
13 Correct 57 ms 2600 KB Output is correct
14 Correct 62 ms 2616 KB Output is correct
15 Correct 66 ms 3928 KB Output is correct
16 Correct 57 ms 3704 KB Output is correct
17 Correct 59 ms 3792 KB Output is correct
18 Correct 71 ms 4040 KB Output is correct
19 Correct 72 ms 3916 KB Output is correct
20 Correct 58 ms 3668 KB Output is correct
21 Correct 68 ms 2644 KB Output is correct
22 Correct 66 ms 2608 KB Output is correct
23 Correct 71 ms 2628 KB Output is correct
24 Correct 67 ms 2604 KB Output is correct
25 Correct 66 ms 2624 KB Output is correct
26 Correct 72 ms 2644 KB Output is correct
27 Correct 73 ms 2636 KB Output is correct
28 Correct 73 ms 2624 KB Output is correct
29 Correct 70 ms 2656 KB Output is correct
30 Correct 67 ms 2648 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 1 ms 320 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 0 ms 340 KB Output is correct
43 Correct 0 ms 340 KB Output is correct
44 Correct 1 ms 324 KB Output is correct
45 Correct 0 ms 340 KB Output is correct
46 Correct 0 ms 340 KB Output is correct
47 Correct 0 ms 340 KB Output is correct
48 Correct 0 ms 340 KB Output is correct
49 Correct 0 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 336 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 67 ms 5588 KB Output is correct
62 Correct 77 ms 5720 KB Output is correct
63 Correct 69 ms 5572 KB Output is correct
64 Correct 70 ms 5608 KB Output is correct
65 Correct 68 ms 5560 KB Output is correct
66 Correct 68 ms 5664 KB Output is correct
67 Correct 67 ms 5576 KB Output is correct
68 Correct 73 ms 5680 KB Output is correct
69 Correct 78 ms 5536 KB Output is correct
70 Correct 68 ms 5648 KB Output is correct