oj.uz

답안 #725689

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
725689 2023-04-17T21:39:36 Z Urvuk3 메기 농장 (IOI22_fish) C++17
9 / 100
 343 ms 33984 KB 
#include "fish.h"

#include <bits/stdc++.h>

using namespace std;

#define ll long long
const int INF=1e9;
const ll LINF=1e18;
#define fi first
#define se second
#define pii pair<int,int>
#define mid ((l+r)/2)
#define sz(a) (int((a).size()))
#define all(a) a.begin(),a.end()
#define endl "\n"
#define pb push_back

void PRINT(int x) {cerr << x;}
void PRINT(ll x) {cerr << x;}
void PRINT(double x) {cerr << x;}
void PRINT(char x) {cerr << '\'' << x << '\'';}
void PRINT(string x) {cerr << '\"' << x << '\"';}
void PRINT(bool x) {cerr << (x ? "true" : "false");}

template<typename T,typename V>
void PRINT(pair<T,V>& x){
    cerr<<"{";
    PRINT(x.fi);
    cerr<<",";
    PRINT(x.se);
    cerr<<"}";
}
template<typename T>
void PRINT(T &x){
    int id=0;
    cerr<<"{";
    for(auto _i:x){
        cerr<<(id++ ? "," : "");
        PRINT(_i);
    }
    cerr<<"}";
}
void _PRINT(){
    cerr<<"]\n";
}
template<typename Head,typename... Tail>
void _PRINT(Head h,Tail... t){
    PRINT(h);
    if(sizeof...(t)) cerr<<", ";
    _PRINT(t...);
}

#define Debug(x...) { cerr<<"["<<#x<<"]=["; _PRINT(x); }

vector<vector<int>> ind;
vector<vector<pair<int,ll>>> fish;
vector<vector<ll>> dp[2];
map<int,ll> pref;

ll Sum(int l,int r){
    ll prefr=prev(pref.upper_bound(r))->se;
    ll prefl=prev(pref.upper_bound(l-1))->se;
    return prefr-prefl;
}

void MaxSelf(ll& x,ll y){
    x=max(x,y);
}

long long max_weights(int N,int M,vector<int> X,vector<int> Y,vector<int> W){
    ind.resize(N); fish.resize(N);
    dp[0].resize(N); dp[1].resize(N);
    for(int i=0;i<M;i++){
        if(X[i]) ind[X[i]-1].pb(Y[i]+1);
        if(X[i]+1<N) ind[X[i]+1].pb(Y[i]+1);
        fish[X[i]].pb({Y[i],W[i]});
    }
    for(int x=0;x<N;x++){
        ind[x].pb(0); ind[x].pb(N);
        sort(all(ind[x]));
        ind[x].resize(unique(all(ind[x]))-ind[x].begin());
        dp[0][x].resize(sz(ind[x]));
        dp[1][x].resize(sz(ind[x]));
    }
    for(int x=1;x<N;x++){
        pref.clear(); pref[-1]=0;
        for(int i=0;i<sz(fish[x-1]);i++){
            int y=fish[x-1][i].fi;
            int w=fish[x-1][i].se;
            pref[y]=pref.upper_bound(y-1)->se+w;
        }
        if(x>1){
            int i1=sz(ind[x-2])-1;
            ll suf_max=-LINF;
            for(int i=sz(ind[x])-1;i>=0;i--){
                while(i1>=0 && ind[x-2][i1]>ind[x][i]){
                    ll m=max(dp[0][x-2][i1],dp[1][x-2][i1]);
                    MaxSelf(suf_max,m+Sum(0,ind[x-2][i1]-1));
                    i1--;
                }
                MaxSelf(dp[1][x][i],suf_max);
            }

            i1=0;
            ll pref_max=-LINF;
            for(int i=0;i<sz(ind[x]);i++){
                while(i1<sz(ind[x-2]) && ind[x-2][i1]<=ind[x][i]){
                    ll m=max(dp[0][x-2][i1],dp[1][x-2][i1]);
                    MaxSelf(pref_max,m);
                    i1++;
                }
                MaxSelf(dp[1][x][i],pref_max+Sum(0,ind[x][i]-1));
            }

            i1=1;
            pref_max=-LINF;
            for(int i=0;i<sz(ind[x]);i++){
                if(i>0) pref_max+=Sum(ind[x][i-1],ind[x][i]-1);
                while(i1<sz(ind[x-1]) && ind[x-1][i1]<=ind[x][i]){
                    ll m=max(dp[0][x-1][i1],dp[1][x-1][i1]);
                    MaxSelf(pref_max,m+Sum(ind[x-1][i1],ind[x][i]-1));
                    i1++;
                }
                MaxSelf(dp[1][x][i],pref_max);
            }

            pref.clear(); pref[-1]=0;
            for(int i=0;i<sz(fish[x]);i++){
                int y=fish[x][i].fi;
                int w=fish[x][i].se;
                pref[y]=pref.upper_bound(y-1)->se+w;
            }

            i1=sz(ind[x-1])-1;
            suf_max=-LINF;
            for(int i=sz(ind[x])-1;i>=0;i--){
                if(i<sz(ind[x])-1) suf_max+=Sum(ind[x][i],ind[x][i+1]-1);
                while(i1>=0 && ind[x-1][i1]>ind[x][i]){
                    ll m=max(dp[0][x-1][i1],dp[1][x-1][i1]);
                    MaxSelf(suf_max,m+Sum(ind[x][i],ind[x-1][i1]-1));
                    i1--;
                }
                MaxSelf(dp[0][x][i],suf_max);
            }
        }
        else if(x==1){
            int i1=0;
            ll pref_max=-LINF;
            for(int i=0;i<sz(ind[x]);i++){
                if(i>0) pref_max+=Sum(ind[x][i-1],ind[x][i]-1);
                while(i1<sz(ind[x-1]) && ind[x-1][i1]<=ind[x][i]){
                    ll m=max(dp[0][x-1][i1],dp[1][x-1][i1]);
                    MaxSelf(pref_max,m+Sum(ind[x-1][i1],ind[x][i]-1));
                    i1++;
                }
                MaxSelf(dp[1][x][i],pref_max);
            }

            pref.clear(); pref[-1]=0;
            for(int i=0;i<sz(fish[x]);i++){
                int y=fish[x][i].fi;
                int w=fish[x][i].se;
                pref[y]=pref.upper_bound(y-1)->se+w;
            }

            i1=sz(ind[x-1])-1;
            ll suf_max=-LINF;
            for(int i=sz(ind[x])-1;i>=0;i--){
                if(i<sz(ind[x])-1) suf_max+=Sum(ind[x][i],ind[x][i+1]-1);
                while(i1>=0 && ind[x-1][i1]>ind[x][i]){
                    ll m=max(dp[0][x-1][i1],dp[1][x-1][i1]);
                    MaxSelf(suf_max,m+Sum(ind[x][i],ind[x-1][i1]-1));
                    i1--;
                }
                MaxSelf(dp[0][x][i],suf_max);
            }
        }
        /*
        Debug(x);
        Debug(fish[x]);
        Debug(ind[x]);
        Debug(dp[0][x]);
        Debug(dp[1][x]);
        cerr<<endl;
        */
    }
    ll res=0;
    for(int i=0;i<sz(ind[N-1]);i++){
        ll m=max(dp[0][N-1][i],dp[1][N-1][i]);
        MaxSelf(res,m);
    }
    return res;
}

Subtask #1
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 120 ms 27380 KB 1st lines differ - on the 1st token, expected: '40313272768926', found: '13695610151'
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 304 KB Output is correct
2 Incorrect 343 ms 33984 KB 1st lines differ - on the 1st token, expected: '40604614618209', found: '26306777200'
3 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 19076 KB Output is correct
2 Correct 45 ms 19076 KB Output is correct
3 Correct 78 ms 20516 KB Output is correct
4 Correct 78 ms 21652 KB Output is correct
5 Correct 126 ms 26120 KB Output is correct
6 Correct 125 ms 25472 KB Output is correct
7 Correct 141 ms 26036 KB Output is correct
8 Correct 136 ms 26136 KB Output is correct

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Incorrect 1 ms 340 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '133248680032'
10 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Incorrect 1 ms 340 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '133248680032'
10 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Incorrect 1 ms 340 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '133248680032'
10 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 19076 KB Output is correct
2 Correct 45 ms 19076 KB Output is correct
3 Correct 78 ms 20516 KB Output is correct
4 Correct 78 ms 21652 KB Output is correct
5 Correct 126 ms 26120 KB Output is correct
6 Correct 125 ms 25472 KB Output is correct
7 Correct 141 ms 26036 KB Output is correct
8 Correct 136 ms 26136 KB Output is correct
9 Correct 153 ms 29040 KB Output is correct
10 Incorrect 118 ms 19172 KB 1st lines differ - on the 1st token, expected: '36454348383152', found: '29830903190065'
11 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 120 ms 27380 KB 1st lines differ - on the 1st token, expected: '40313272768926', found: '13695610151'
2 Halted 0 ms 0 KB -