oj.uz

답안 #930172

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
930172 2024-02-18T20:38:45 Z ASN49K Feast (NOI19_feast) C++14
100 / 100
 89 ms 5736 KB 
#include <bits/stdc++.h>

using namespace std;
#define pb push_back
#define all(x) x.begin(),x.end()
#define int long long
const int inf=1e12;
using i64=long long;
int n;
vector<int>a;
pair<int64_t, int64_t> dp(int64_t lambda)
{
    int64_t mu = 0, nu = 0, p = 0, cnt = 0, _cnt = 0;
    for (size_t i = 0; i < n; ++i)
    {
        p += a[i];
        if (mu + p - lambda > nu)
            nu = mu + p - lambda, _cnt = cnt + 1;
        if (nu - p > mu)
            cnt = _cnt, mu = nu - p;
    }
    return {nu, _cnt};
}
main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int k;
    cin>>n>>k;
    a.resize(n);
    for(int i=0;i<n;i++)
    {
        cin>>a[i];
    }
    int st=0,dr=inf;
    i64 rez=-1e18;
    while(st<=dr)
    {
        int m=(st+dr)/2;
        auto xd=dp(m);
        if(xd.second <= k)
        {
            dr=m-1;
            rez=xd.first+1LL*k*m;
        }
        else
        {
            st=m+1;
        }
    }
    cout<<rez;
    return 0;
}
/*#include <bits/stdc++.h>
using namespace std;

constexpr size_t N = 300000;

int64_t a[N];

pair<int64_t, int64_t> dp(size_t n, int64_t lambda)
{
    int64_t mu = 0, nu = 0, p = 0, cnt = 0, _cnt = 0;
    for (size_t i = 0; i < n; ++i)
    {
        p += a[i];
        if (mu + p - lambda > nu)
            nu = mu + p - lambda, _cnt = cnt + 1;
        if (nu - p > mu)
            cnt = _cnt, mu = nu - p;
    }
    return {nu, _cnt};
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    size_t n, k;
    cin >> n >> k;
    for (size_t i = 0; i < n; ++i)
        cin >> a[i];

    int64_t u = 0, v = 1LL << 55;
    while (u < v)
    {
        if (dp(n, (u + v) / 2).second <= k)
            v = (u + v) / 2;
        else
            u = (u + v) / 2 + 1;
    }
    //auto const [objective_val, cnt] = dp(n, u);
    cout << dp(n,u).first + k * u << '\n';
}*/

Compilation message

feast.cpp: In function 'std::pair<long int, long int> dp(int64_t)':
feast.cpp:14:26: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   14 |     for (size_t i = 0; i < n; ++i)
      |                        ~~^~~
feast.cpp: At global scope:
feast.cpp:24:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   24 | main()
      | ^~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 2648 KB Output is correct
2 Correct 38 ms 5456 KB Output is correct
3 Correct 39 ms 5456 KB Output is correct
4 Correct 37 ms 5460 KB Output is correct
5 Correct 38 ms 5456 KB Output is correct
6 Correct 38 ms 5284 KB Output is correct
7 Correct 39 ms 5456 KB Output is correct
8 Correct 38 ms 5460 KB Output is correct
9 Correct 38 ms 5468 KB Output is correct
10 Correct 38 ms 5572 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 2648 KB Output is correct
2 Correct 30 ms 2652 KB Output is correct
3 Correct 30 ms 2652 KB Output is correct
4 Correct 29 ms 2652 KB Output is correct
5 Correct 39 ms 5468 KB Output is correct
6 Correct 30 ms 3672 KB Output is correct
7 Correct 30 ms 3932 KB Output is correct
8 Correct 37 ms 5468 KB Output is correct
9 Correct 38 ms 5420 KB Output is correct
10 Correct 30 ms 3932 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 2648 KB Output is correct
2 Correct 54 ms 5712 KB Output is correct
3 Correct 52 ms 5712 KB Output is correct
4 Correct 53 ms 5564 KB Output is correct
5 Correct 55 ms 5724 KB Output is correct
6 Correct 53 ms 5712 KB Output is correct
7 Correct 53 ms 5736 KB Output is correct
8 Correct 52 ms 5712 KB Output is correct
9 Correct 52 ms 5724 KB Output is correct
10 Correct 53 ms 5724 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 456 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 456 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 600 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct

Subtask #6
20.0 / 20.0

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

Subtask #7
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 2648 KB Output is correct
2 Correct 38 ms 5456 KB Output is correct
3 Correct 39 ms 5456 KB Output is correct
4 Correct 37 ms 5460 KB Output is correct
5 Correct 38 ms 5456 KB Output is correct
6 Correct 38 ms 5284 KB Output is correct
7 Correct 39 ms 5456 KB Output is correct
8 Correct 38 ms 5460 KB Output is correct
9 Correct 38 ms 5468 KB Output is correct
10 Correct 38 ms 5572 KB Output is correct
11 Correct 31 ms 2648 KB Output is correct
12 Correct 30 ms 2652 KB Output is correct
13 Correct 30 ms 2652 KB Output is correct
14 Correct 29 ms 2652 KB Output is correct
15 Correct 39 ms 5468 KB Output is correct
16 Correct 30 ms 3672 KB Output is correct
17 Correct 30 ms 3932 KB Output is correct
18 Correct 37 ms 5468 KB Output is correct
19 Correct 38 ms 5420 KB Output is correct
20 Correct 30 ms 3932 KB Output is correct
21 Correct 52 ms 2648 KB Output is correct
22 Correct 54 ms 5712 KB Output is correct
23 Correct 52 ms 5712 KB Output is correct
24 Correct 53 ms 5564 KB Output is correct
25 Correct 55 ms 5724 KB Output is correct
26 Correct 53 ms 5712 KB Output is correct
27 Correct 53 ms 5736 KB Output is correct
28 Correct 52 ms 5712 KB Output is correct
29 Correct 52 ms 5724 KB Output is correct
30 Correct 53 ms 5724 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 456 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 600 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 1 ms 348 KB Output is correct
54 Correct 1 ms 468 KB Output is correct
55 Correct 1 ms 344 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 1 ms 600 KB Output is correct
59 Correct 1 ms 344 KB Output is correct
60 Correct 1 ms 600 KB Output is correct
61 Correct 83 ms 5712 KB Output is correct
62 Correct 80 ms 5732 KB Output is correct
63 Correct 65 ms 5468 KB Output is correct
64 Correct 85 ms 5716 KB Output is correct
65 Correct 88 ms 5724 KB Output is correct
66 Correct 89 ms 5712 KB Output is correct
67 Correct 85 ms 5468 KB Output is correct
68 Correct 54 ms 5712 KB Output is correct
69 Correct 52 ms 5460 KB Output is correct
70 Correct 52 ms 5460 KB Output is correct