oj.uz

답안 #595946

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
595946 2022-07-14T08:17:28 Z Tenis0206 Feast (NOI19_feast) C++11
12 / 100
 107 ms 12492 KB 
#include <bits/stdc++.h>
#define int long long

using namespace std;

const int oo = 0x3f3f3f3f;

int n,k;
int v[300005];
int sp[300005];

pair<int,int> dp[300005];

pair<int,int> get_val(int c)
{
    int Max = 0, nrval = 0;
    int Max_pref = 0, nrval_pref = 0;
    for(int i=1;i<=n;i++)
    {
        dp[i].first = Max_pref + sp[i] - c;
        dp[i].second = nrval_pref + 1;
        if(dp[i].first > Max || (dp[i].first==Max && dp[i].second < nrval))
        {
            Max = dp[i].first;
            nrval = dp[i].second;
        }
        if(Max - sp[i] > Max_pref || (Max - sp[i]==Max_pref && nrval < nrval_pref))
        {
            Max_pref = Max - sp[i];
            nrval_pref = nrval;
        }
    }
    return {Max,nrval};
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin>>n>>k;
    for(int i=1;i<=n;i++)
    {
        cin>>v[i];
        sp[i] = sp[i-1] + v[i];
    }
    int st = -oo;
    int dr = oo;
    while(st<=dr)
    {
        int mij = (st + dr) >> 1;
        pair<int,int> val = get_val(mij);
        if(val.second==k)
        {
            cout<<val.first + k * mij<<'\n';
            return 0;
        }
        if(val.second<k)
        {
            dr = mij - 1;
        }
        else
        {
            st = mij + 1;
        }
    }
    pair<int,int> val = get_val(st);
    cout<<val.first + val.second * st<<'\n';
    return 0;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 107 ms 10956 KB Output is correct
2 Correct 68 ms 12436 KB Output is correct
3 Correct 64 ms 12472 KB Output is correct
4 Correct 79 ms 12492 KB Output is correct
5 Correct 50 ms 12408 KB Output is correct
6 Correct 53 ms 12224 KB Output is correct
7 Correct 63 ms 12188 KB Output is correct
8 Correct 55 ms 12460 KB Output is correct
9 Correct 52 ms 12140 KB Output is correct
10 Correct 59 ms 12372 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 9964 KB Output is correct
2 Correct 31 ms 10820 KB Output is correct
3 Correct 25 ms 10492 KB Output is correct
4 Correct 39 ms 10728 KB Output is correct
5 Correct 35 ms 12108 KB Output is correct
6 Correct 24 ms 10512 KB Output is correct
7 Correct 37 ms 10760 KB Output is correct
8 Correct 37 ms 12484 KB Output is correct
9 Correct 32 ms 12124 KB Output is correct
10 Correct 37 ms 10664 KB Output is correct

Subtask #3
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 104 ms 11356 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 300 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 300 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 300 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 107 ms 10956 KB Output is correct
2 Correct 68 ms 12436 KB Output is correct
3 Correct 64 ms 12472 KB Output is correct
4 Correct 79 ms 12492 KB Output is correct
5 Correct 50 ms 12408 KB Output is correct
6 Correct 53 ms 12224 KB Output is correct
7 Correct 63 ms 12188 KB Output is correct
8 Correct 55 ms 12460 KB Output is correct
9 Correct 52 ms 12140 KB Output is correct
10 Correct 59 ms 12372 KB Output is correct
11 Correct 29 ms 9964 KB Output is correct
12 Correct 31 ms 10820 KB Output is correct
13 Correct 25 ms 10492 KB Output is correct
14 Correct 39 ms 10728 KB Output is correct
15 Correct 35 ms 12108 KB Output is correct
16 Correct 24 ms 10512 KB Output is correct
17 Correct 37 ms 10760 KB Output is correct
18 Correct 37 ms 12484 KB Output is correct
19 Correct 32 ms 12124 KB Output is correct
20 Correct 37 ms 10664 KB Output is correct
21 Incorrect 104 ms 11356 KB Output isn't correct
22 Halted 0 ms 0 KB -