oj.uz

답안 #863429

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
863429 2023-10-20T08:54:57 Z neki 메기 농장 (IOI22_fish) C++17
18 / 100
 423 ms 75320 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){
                for(ll j=0, pf=0, cc=0;j<(ll)rel[i].size();++j){
                    while(pf<(ll)f[i-1].size()&&f[i-1][pf].first<=rel[i][j])cc+=f[i-1][pf++].second;
                    dpv[i][j]=max(dpv[i][j], max(dpv[i-1][0], dpm[i-1][0])+cc);
                    dpm[i][j]=max(dpm[i][j], max(dpv[i-1][0], dpm[i-1][0])+cc);
                }
            }
        }
        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

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 29220 KB Output is correct
2 Correct 62 ms 33172 KB Output is correct
3 Correct 25 ms 24668 KB Output is correct
4 Correct 26 ms 24572 KB Output is correct
5 Correct 157 ms 63100 KB Output is correct
6 Correct 423 ms 75320 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 86 ms 40300 KB Output is correct
3 Correct 104 ms 44200 KB Output is correct
4 Correct 58 ms 29476 KB Output is correct
5 Correct 60 ms 33120 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 0 ms 348 KB Output is correct
10 Correct 24 ms 24716 KB Output is correct
11 Correct 24 ms 24664 KB Output is correct
12 Correct 56 ms 31700 KB Output is correct
13 Correct 67 ms 36496 KB Output is correct
14 Correct 54 ms 31700 KB Output is correct
15 Correct 60 ms 34724 KB Output is correct
16 Correct 53 ms 32060 KB Output is correct
17 Correct 58 ms 35372 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 24668 KB Output is correct
2 Correct 27 ms 24668 KB Output is correct
3 Correct 100 ms 29840 KB Output is correct
4 Correct 68 ms 29524 KB Output is correct
5 Correct 212 ms 39340 KB Output is correct
6 Correct 221 ms 39248 KB Output is correct
7 Correct 219 ms 39204 KB Output is correct
8 Correct 230 ms 38996 KB Output is correct

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 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 1 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: '799682693947'
11 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 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 1 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: '799682693947'
11 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 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 1 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: '799682693947'
11 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 24668 KB Output is correct
2 Correct 27 ms 24668 KB Output is correct
3 Correct 100 ms 29840 KB Output is correct
4 Correct 68 ms 29524 KB Output is correct
5 Correct 212 ms 39340 KB Output is correct
6 Correct 221 ms 39248 KB Output is correct
7 Correct 219 ms 39204 KB Output is correct
8 Correct 230 ms 38996 KB Output is correct
9 Correct 104 ms 37204 KB Output is correct
10 Incorrect 149 ms 29524 KB 1st lines differ - on the 1st token, expected: '36454348383152', found: '36441002960722'
11 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 29220 KB Output is correct
2 Correct 62 ms 33172 KB Output is correct
3 Correct 25 ms 24668 KB Output is correct
4 Correct 26 ms 24572 KB Output is correct
5 Correct 157 ms 63100 KB Output is correct
6 Correct 423 ms 75320 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 86 ms 40300 KB Output is correct
9 Correct 104 ms 44200 KB Output is correct
10 Correct 58 ms 29476 KB Output is correct
11 Correct 60 ms 33120 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 24 ms 24716 KB Output is correct
17 Correct 24 ms 24664 KB Output is correct
18 Correct 56 ms 31700 KB Output is correct
19 Correct 67 ms 36496 KB Output is correct
20 Correct 54 ms 31700 KB Output is correct
21 Correct 60 ms 34724 KB Output is correct
22 Correct 53 ms 32060 KB Output is correct
23 Correct 58 ms 35372 KB Output is correct
24 Correct 24 ms 24668 KB Output is correct
25 Correct 27 ms 24668 KB Output is correct
26 Correct 100 ms 29840 KB Output is correct
27 Correct 68 ms 29524 KB Output is correct
28 Correct 212 ms 39340 KB Output is correct
29 Correct 221 ms 39248 KB Output is correct
30 Correct 219 ms 39204 KB Output is correct
31 Correct 230 ms 38996 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 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 1 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: '799682693947'
42 Halted 0 ms 0 KB -