oj.uz

Submission #863424

# Submission time Handle Problem Language Result Execution time Memory
863424 2023-10-20T08:28:56 Z neki Catfish Farm (IOI22_fish) C++17
18 / 100
 416 ms 74848 KB 
#include <bits/stdc++.h>
#include "fish.h"

#define ll long long
#define vc vector
 
using namespace std;
 
ll max_weights(int N, int M, vc<int> X, vc<int> Y, vc<int> W) {
    vc<ll> ind(M); for(ll i=0;i<M;++i) ind[i]=i;
    sort(ind.begin(),ind.end(),[&](ll a,ll b){return Y[a]<Y[b];});
    
    vc<vc<pair<ll, ll>>> f(N);
    vc<vc<ll>> rel(N, vc<ll>(1, -1)), dpm(N, vc<ll>(1, 0)), dpv(N, vc<ll>(1, 0)), dpn(N, vc<ll>(1, 0));
    for(auto i: ind){
        f[X[i]].emplace_back(Y[i], W[i]);
        if(X[i]-1>=0) rel[X[i]-1].push_back(Y[i]),dpn[X[i]-1].push_back(0),dpm[X[i]-1].push_back(0),dpv[X[i]-1].push_back(0);
        if(X[i]+1<N) rel[X[i]+1].push_back(Y[i]),dpn[X[i]+1].push_back(0),dpm[X[i]+1].push_back(0),dpv[X[i]+1].push_back(0);
    }
    
    for(ll i=0;i<N;++i){
        if(i-2>=0){
            for(ll j=0, prej=0, c=0, pp=0, mm=0;j<(ll)rel[i].size();++j){
                while(pp<(ll)rel[i-2].size()&&rel[i-2][pp]<=rel[i][j])mm=max(mm, max(dpv[i-2][pp], dpm[i-2][pp])),++pp;
                while(prej<(ll)f[i-1].size()&&f[i-1][prej].first<=rel[i][j])c+=f[i-1][prej++].second;
                dpv[i][j]=max(dpv[i][j],mm+c);
                dpm[i][j]=max(dpm[i][j],mm+c);
            }
            for(ll j=(ll)rel[i].size()-1, pp=(ll)rel[i-2].size(), mm=0;j>=0;--j){
                while(pp-1>=0&&rel[i-2][pp-1]>=rel[i][j])mm=max(mm, dpn[i-2][--pp]);
                dpv[i][j]=max(dpv[i][j],mm);
                dpm[i][j]=max(dpm[i][j],mm);
            }
        }
        if(i-1>=0){
            for(ll j=0, prej=0, pf=0, mm=0;j<(ll)rel[i].size();++j){
                while(1){
                    if(prej<(ll)rel[i-1].size()&&rel[i-1][prej]<=rel[i][j]&&(!(pf<(ll)f[i-1].size()) || rel[i-1][prej]<f[i-1][pf].first))mm=max(mm, dpm[i-1][prej++]);
                    else if(pf<(ll)f[i-1].size()&&f[i-1][pf].first<=rel[i][j])mm+=f[i-1][pf++].second;
                    else break;
                }
                dpm[i][j]=max(dpm[i][j], mm);
            }
            ll c=0; for(auto v: f[i])c+=v.second;
            vc<ll> pr=dpv[i-1];
            for(ll j=0, nas=0, c=0;j<(ll)rel[i-1].size();++j){
                while(nas<(ll)f[i].size()&&f[i][nas].first<=rel[i-1][j])c+=f[i][nas++].second;
                pr[j]+=c;
            }
            for(ll j=(ll)pr.size()-2;j>=0;--j)pr[j]=max(pr[j],pr[j+1]);

            for(ll j=(ll)rel[i].size()-1, prej=(ll)rel[i-1].size(), pf=(ll)f[i].size()-1;j>=0;--j){
                while(pf>=0&&rel[i][j]<f[i][pf].first)c-=f[i][pf--].second;
                while(prej-1>=0&&rel[i-1][prej]>=rel[i][j])--prej;
                if(prej<(ll)rel[i-1].size()) dpv[i][j]=max(dpv[i][j], pr[prej]-c);
            }
        }
        if(i+1<N){
            for(ll j=0, nas=0, c=0;j<(ll)rel[i].size();++j){
                while(nas<(ll)f[i+1].size()&&f[i+1][nas].first<=rel[i][j])c+=f[i+1][nas++].second;
                dpn[i][j]=max(dpn[i][j],max(dpv[i][j], dpm[i][j])+c);
            }
        }
    }
    ll ans=0;
    for(ll i=0;i<N;++i){
        for(ll j=0;j<(ll)rel[i].size();++j)ans=max({ans, dpn[i][j], dpv[i][j], dpm[i][j]});
    }
    return ans;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 29224 KB Output is correct
2 Correct 60 ms 33144 KB Output is correct
3 Correct 26 ms 24664 KB Output is correct
4 Correct 25 ms 24668 KB Output is correct
5 Correct 158 ms 63096 KB Output is correct
6 Correct 416 ms 74848 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 88 ms 40300 KB Output is correct
3 Correct 118 ms 44200 KB Output is correct
4 Correct 53 ms 29220 KB Output is correct
5 Correct 65 ms 33180 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 26 ms 24668 KB Output is correct
11 Correct 25 ms 24672 KB Output is correct
12 Correct 57 ms 31752 KB Output is correct
13 Correct 66 ms 36268 KB Output is correct
14 Correct 55 ms 31696 KB Output is correct
15 Correct 66 ms 34872 KB Output is correct
16 Correct 52 ms 32052 KB Output is correct
17 Correct 60 ms 35244 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 24664 KB Output is correct
2 Correct 32 ms 24664 KB Output is correct
3 Correct 112 ms 30036 KB Output is correct
4 Correct 69 ms 30044 KB Output is correct
5 Correct 217 ms 40508 KB Output is correct
6 Correct 220 ms 40024 KB Output is correct
7 Correct 212 ms 40532 KB Output is correct
8 Correct 245 ms 40584 KB Output is correct

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 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 1 ms 604 KB Output is correct
10 Incorrect 2 ms 860 KB 1st lines differ - on the 1st token, expected: '799839985182', found: '799285338861'
11 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 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 1 ms 604 KB Output is correct
10 Incorrect 2 ms 860 KB 1st lines differ - on the 1st token, expected: '799839985182', found: '799285338861'
11 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 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 1 ms 604 KB Output is correct
10 Incorrect 2 ms 860 KB 1st lines differ - on the 1st token, expected: '799839985182', found: '799285338861'
11 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 24664 KB Output is correct
2 Correct 32 ms 24664 KB Output is correct
3 Correct 112 ms 30036 KB Output is correct
4 Correct 69 ms 30044 KB Output is correct
5 Correct 217 ms 40508 KB Output is correct
6 Correct 220 ms 40024 KB Output is correct
7 Correct 212 ms 40532 KB Output is correct
8 Correct 245 ms 40584 KB Output is correct
9 Correct 105 ms 38416 KB Output is correct
10 Incorrect 155 ms 31312 KB 1st lines differ - on the 1st token, expected: '36454348383152', found: '36441002960722'
11 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 29224 KB Output is correct
2 Correct 60 ms 33144 KB Output is correct
3 Correct 26 ms 24664 KB Output is correct
4 Correct 25 ms 24668 KB Output is correct
5 Correct 158 ms 63096 KB Output is correct
6 Correct 416 ms 74848 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 88 ms 40300 KB Output is correct
9 Correct 118 ms 44200 KB Output is correct
10 Correct 53 ms 29220 KB Output is correct
11 Correct 65 ms 33180 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 26 ms 24668 KB Output is correct
17 Correct 25 ms 24672 KB Output is correct
18 Correct 57 ms 31752 KB Output is correct
19 Correct 66 ms 36268 KB Output is correct
20 Correct 55 ms 31696 KB Output is correct
21 Correct 66 ms 34872 KB Output is correct
22 Correct 52 ms 32052 KB Output is correct
23 Correct 60 ms 35244 KB Output is correct
24 Correct 25 ms 24664 KB Output is correct
25 Correct 32 ms 24664 KB Output is correct
26 Correct 112 ms 30036 KB Output is correct
27 Correct 69 ms 30044 KB Output is correct
28 Correct 217 ms 40508 KB Output is correct
29 Correct 220 ms 40024 KB Output is correct
30 Correct 212 ms 40532 KB Output is correct
31 Correct 245 ms 40584 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 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 1 ms 604 KB Output is correct
41 Incorrect 2 ms 860 KB 1st lines differ - on the 1st token, expected: '799839985182', found: '799285338861'
42 Halted 0 ms 0 KB -