oj.uz

Submission #628449

# Submission time Handle Problem Language Result Execution time Memory
628449 2022-08-13T12:05:06 Z guangxuan Catfish Farm (IOI22_fish) C++17
12 / 100
 152 ms 26340 KB 
#include "fish.h"
#define F first
#define S second
#include <bits/stdc++.h>
typedef long long ll;

const ll INF= 1LL<<60;
using namespace std;
typedef pair<int, ll> pil;

long long max_weights(int N, int M, std::vector<int> X, vector<int> Y,
                      vector<int> W) {
    for(int i=0;i<M;i++){
        Y[i]+=1;
    }
    vector<pil> rs[N];
    for(int i=0;i<M;i++){
        rs[X[i]].emplace_back(Y[i],W[i]);
    }
    for(int i=0;i<N;i++){
        rs[i].emplace_back(0,0);
        sort(rs[i].begin(),rs[i].end());
        rs[i].emplace_back(N+2,0);
        for(int j=1;j<(int)rs[i].size();j++){
            rs[i][j].S+=rs[i][j-1].S;
        }
    }
    ll dp[2][3][N+2]; // (0, h[i-1]), (h[i-1] <= h[i], h[i]), (h[i-1]>h[i], h[i])
    memset(dp,0,sizeof dp);
    for(int i=0,k=0;i<(int)rs[0].size();i++){
        while(k+1<(int)rs[1].size() && rs[0][i].F>rs[1][k+1].F){
            k++;
        }
        dp[1][0][i]=rs[1][k].S;
    }
    for(int i=0,k=0;i<(int)rs[1].size();i++){
        while(k+1<(int)rs[0].size() && rs[1][i].F>rs[0][k+1].F ){
            k++;
        }
        dp[1][1][i]=rs[0][k].S;
        dp[1][2][i]=rs[1].back().S-rs[1][max(i-1,0)].S;
    }
    for(int i=2;i<N;i++){
        for(int j=0;j<3;j++){
            for(int k=0;k<(int)max(rs[i-1].size(),rs[i].size());k++){
                dp[i&1][j][k]=0;
            }   
        }
        int rss = rs[i].size();
        int ps = rs[i-1].size();
        int pps = rs[i-2].size();
        for(int j=0, k = 0;j<ps;j++){
            while(k+1<rss && rs[i-1][j].F > rs[i][k+1].F){
                k++;
            }
            dp[i&1][0][j]=max(dp[(i&1)^1][1][j],dp[(i&1)^1][2][j])+rs[i][k].S;
        }
        //0,k -> 1,j
        ll cmax = -INF;
        for(int j=0, k =0, l=0, l2=0;j<rss;j++){
            while(k<pps && rs[i][j].F>rs[i-2][k].F){
                while(l+1<ps && rs[i-2][k].F > rs[i-1][l+1].F){
                    l++;
                }
                cmax = max(cmax,dp[(i&1)^1][0][k]+rs[i-1][l].S);
                k++;
            }
            while(l2+1<ps && rs[i][j].F > rs[i-1][l2+1].F){
                l2++;
            }
            dp[i&1][1][j]=max(dp[i&1][1][j],cmax-rs[i-1][max(l2-1,0)].S);
        }
        cmax = -INF;
        for(int j=rss-1,k=pps-1 ;j>=0;j--){
            while(k>=0 && rs[i][j].F<=rs[i-2][k].F){
                cmax = max(cmax,dp[(i&1)^1][0][k]);
                k--;
            }
            dp[i&1][1][j]=max(dp[i&1][1][j],cmax);
        }
        //1,k -> 1,j
        cmax = -INF;
        for(int j=0, k=0, k2=0;j<rss;j++){
            while(k<ps && rs[i][j].F>=rs[i-1][k].F){
                cmax = max(cmax, dp[(i&1)^1][1][k]-rs[i-1][max(k-1,0)].S);
                k++;
            }
            while(k2+1<ps && rs[i][j].F > rs[i-1][k2].F)k2++;
            dp[i&1][1][j]=max(dp[i&1][1][j],cmax+rs[i-1][max(k2-1,0)].S);
        }
        //1,k 2,k -> 2,j
        cmax = -INF;
        for(int j=rss-1, k = ps-1, l = rss-1;j>=0;j--){
            while(k>=0 && rs[i][j].F<rs[i-1][k].F){
                while(l-1>=0 && rs[i-1][k].F<=rs[i][l].F)l--;
                cmax = max(cmax, max(dp[(i&1)^1][1][k],dp[(i&1)^1][2][k])+rs[i][l].S);
                k--;
            }
            dp[i&1][2][j]=max(dp[i&1][2][j],cmax-rs[i][max(j-1,0)].S);
        }
    }
    ll ans = 0;
    /*for(int i=0;i<=N;i++){
        for(int j=0;j<3;j++){
            for(int k=0;k<=N;k++){
                cout << dp[i&1][j][k] << ' ';
            }
            cout << endl;
        }
        cout << endl;
    }*/
    for(int k=0;k<(int)rs[N-2].size();k++)ans = max(ans, dp[(N-1)&1][0][k]);
    for(int j=1;j<3;j++)
        for(int k=0;k<(int)rs[N-1].size();k++)ans = max(ans, dp[(N-1)&1][j][k]);
    return ans;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 13912 KB Output is correct
2 Correct 60 ms 15928 KB Output is correct
3 Correct 19 ms 11944 KB Output is correct
4 Correct 19 ms 11992 KB Output is correct
5 Correct 133 ms 23752 KB Output is correct
6 Correct 152 ms 26340 KB Output is correct

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 85 ms 17208 KB Output is correct
3 Correct 95 ms 19760 KB Output is correct
4 Correct 46 ms 14012 KB Output is correct
5 Correct 61 ms 15968 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 20 ms 12032 KB Output is correct
11 Correct 22 ms 11948 KB Output is correct
12 Correct 46 ms 14044 KB Output is correct
13 Correct 55 ms 15932 KB Output is correct
14 Incorrect 48 ms 13944 KB 1st lines differ - on the 1st token, expected: '20226650012153', found: '20226987086125'
15 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 12028 KB Output is correct
2 Correct 18 ms 11952 KB Output is correct
3 Correct 46 ms 14256 KB Output is correct
4 Correct 35 ms 14304 KB Output is correct
5 Correct 61 ms 18252 KB Output is correct
6 Correct 60 ms 18196 KB Output is correct
7 Correct 61 ms 18172 KB Output is correct
8 Correct 62 ms 18112 KB Output is correct

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Incorrect 1 ms 340 KB 1st lines differ - on the 1st token, expected: '278622587073', found: '279962501972'
12 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Incorrect 1 ms 340 KB 1st lines differ - on the 1st token, expected: '278622587073', found: '279962501972'
12 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Incorrect 1 ms 340 KB 1st lines differ - on the 1st token, expected: '278622587073', found: '279962501972'
12 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 12028 KB Output is correct
2 Correct 18 ms 11952 KB Output is correct
3 Correct 46 ms 14256 KB Output is correct
4 Correct 35 ms 14304 KB Output is correct
5 Correct 61 ms 18252 KB Output is correct
6 Correct 60 ms 18196 KB Output is correct
7 Correct 61 ms 18172 KB Output is correct
8 Correct 62 ms 18112 KB Output is correct
9 Correct 59 ms 18248 KB Output is correct
10 Correct 54 ms 10716 KB Output is correct
11 Correct 138 ms 21088 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 20 ms 12040 KB Output is correct
19 Correct 20 ms 12004 KB Output is correct
20 Correct 21 ms 12004 KB Output is correct
21 Correct 20 ms 12028 KB Output is correct
22 Incorrect 64 ms 16824 KB 1st lines differ - on the 1st token, expected: '45561826463480', found: '51055873960576'
23 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 13912 KB Output is correct
2 Correct 60 ms 15928 KB Output is correct
3 Correct 19 ms 11944 KB Output is correct
4 Correct 19 ms 11992 KB Output is correct
5 Correct 133 ms 23752 KB Output is correct
6 Correct 152 ms 26340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 85 ms 17208 KB Output is correct
9 Correct 95 ms 19760 KB Output is correct
10 Correct 46 ms 14012 KB Output is correct
11 Correct 61 ms 15968 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 20 ms 12032 KB Output is correct
17 Correct 22 ms 11948 KB Output is correct
18 Correct 46 ms 14044 KB Output is correct
19 Correct 55 ms 15932 KB Output is correct
20 Incorrect 48 ms 13944 KB 1st lines differ - on the 1st token, expected: '20226650012153', found: '20226987086125'
21 Halted 0 ms 0 KB -