oj.uz

Submission #731525

# Submission time Handle Problem Language Result Execution time Memory
731525 2023-04-27T13:49:49 Z mohav48173 Feast (NOI19_feast) C++14
63 / 100
 1000 ms 5096 KB 
#include<bits/stdc++.h>
using namespace std;
int n,k;
const long double sz=1e-6;
long long a[400000];
long long m[400000];
long long mincnt=0;
long double score=0;
long double get(int ind) {
    if(ind<0)return 0;
    else return m[ind];
}
void calc(long double lam) {
    long double bestscore=0;
    long long bestcnt=0;
    long double bestnxt=-lam;
    long long nxtcnt=0;
    for(int i=0;i<n;i++) {
        if(bestscore-lam-get(i-1)>bestnxt ||
           (bestscore-lam-get(i-1)==bestnxt && nxtcnt>bestcnt)) {
            bestnxt=bestscore-get(i-1)-lam;
            nxtcnt=bestcnt;
        }
        if(bestnxt+get(i)>bestscore || (bestnxt+get(i)==bestscore && nxtcnt+1<bestcnt)) {
            bestscore=bestnxt+get(i);
            bestcnt=nxtcnt+1;
        }
    }
    mincnt=bestcnt;
    score=bestscore;
}
int main() {
    ios_base::sync_with_stdio(0);cin.tie(0);
    cin>>n>>k;
    for(int i=0;i<n;i++)cin>>a[i];
    m[0]=a[0];for(int i=1;i<n;i++)m[i]=m[i-1]+a[i];
    long double l=0,r=1e16;
    while(l+sz<r) {
        long double mid=(l+r)/2.0;
        calc(mid);
        if(mincnt<k)r=mid;
        else l=mid;
    }
    calc(r);
    cout<<(long long)(round(score+k*r))<<endl;
    return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 4812 KB Output is correct
2 Correct 82 ms 4920 KB Output is correct
3 Correct 84 ms 5004 KB Output is correct
4 Correct 87 ms 4968 KB Output is correct
5 Correct 100 ms 4944 KB Output is correct
6 Correct 78 ms 4868 KB Output is correct
7 Correct 83 ms 4780 KB Output is correct
8 Correct 95 ms 4964 KB Output is correct
9 Correct 120 ms 4872 KB Output is correct
10 Correct 93 ms 5048 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 4880 KB Output is correct
2 Correct 69 ms 4948 KB Output is correct
3 Correct 68 ms 4900 KB Output is correct
4 Correct 86 ms 4832 KB Output is correct
5 Execution timed out 1079 ms 4752 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 137 ms 4936 KB Output is correct
2 Correct 139 ms 4896 KB Output is correct
3 Correct 143 ms 4948 KB Output is correct
4 Correct 135 ms 4928 KB Output is correct
5 Correct 144 ms 4940 KB Output is correct
6 Correct 144 ms 4940 KB Output is correct
7 Correct 149 ms 5096 KB Output is correct
8 Correct 133 ms 4944 KB Output is correct
9 Correct 144 ms 5004 KB Output is correct
10 Correct 141 ms 4972 KB Output is correct

Subtask #4
10.0 / 10.0

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

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 260 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 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 2 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 2 ms 340 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 3 ms 340 KB Output is correct
30 Correct 2 ms 340 KB Output is correct

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 4812 KB Output is correct
2 Correct 82 ms 4920 KB Output is correct
3 Correct 84 ms 5004 KB Output is correct
4 Correct 87 ms 4968 KB Output is correct
5 Correct 100 ms 4944 KB Output is correct
6 Correct 78 ms 4868 KB Output is correct
7 Correct 83 ms 4780 KB Output is correct
8 Correct 95 ms 4964 KB Output is correct
9 Correct 120 ms 4872 KB Output is correct
10 Correct 93 ms 5048 KB Output is correct
11 Correct 68 ms 4880 KB Output is correct
12 Correct 69 ms 4948 KB Output is correct
13 Correct 68 ms 4900 KB Output is correct
14 Correct 86 ms 4832 KB Output is correct
15 Execution timed out 1079 ms 4752 KB Time limit exceeded
16 Halted 0 ms 0 KB -