oj.uz

답안 #1023084

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1023084 2024-07-14T09:30:26 Z vjudge1 메기 농장 (IOI22_fish) C++17
18 / 100
 217 ms 108604 KB 
#include "fish.h"
#include <bits/stdc++.h>

#pragma GCC optimize("Ofast")

using namespace std;

#define ll long long
#define pb push_back
#define F first
#define S second
#define all(v) v.begin(),v.end()
#define sz(s) (int)s.size()
#define lb lower_bound
#define ub upper_bound
#define mem(a,i) memset(a,i,sizeof(a))

const int MAX=2e5+10;

int n;
vector<pair<ll,ll>> y[MAX];
vector<ll> p[MAX];
vector<vector<ll>> dp[MAX];
vector<ll> can[MAX];

ll getSum(int x,ll l,ll r){
    if(l>r)return 0;
    int L=lb(all(y[x]),make_pair(l,0ll))-y[x].begin();
    int R=ub(all(y[x]),make_pair(r+1,0ll))-y[x].begin()-1;
    if(L<=R){
        if(L==0)return p[x][R];
        return p[x][R]-p[x][L-1];
    }
    return 0;
}

vector<vector<ll>> sumF[MAX];
vector<vector<ll>> sumB[MAX];
vector<pair<int,int>> vec[MAX];
vector<vector<ll>> w;
ll push[310][310][2];

struct t300{

    ll dp[310][310][2];

    ll getP(int i,int l,int r){
        if(l>r||i==0)return 0;
        return p[i][r]-p[i][l-1];
    }

    ll solve300(){
        for(int i=1;i<=n;i++){
            p[i].resize(n+10);
            p[i][0]=0;
            for(int j=1;j<=n;j++){
                p[i][j]=p[i][j-1]+w[i][j];
            }
        }
        mem(dp,0);
        mem(push,0);
        for(int i=2;i<=n;i++){
            for(int j=0;j<=n;j++){
                {
                    dp[i][j][0]=push[i-1][j][0]-p[i][j];
                }
                {
                    for(int f=0;f<=j;f++){
                        dp[i][j][1]=max(dp[i][j][1],dp[i-1][f][1]+getP(i-1,f+1,j));
                    }
                    dp[i][j][1]=max(dp[i][j][1],dp[i-1][0][0]);
                }
            }
            for(int j=n;j>=0;j--){
                push[i][j][0]=max(push[i][j+1][0],max(dp[i][j][0],dp[i][j][1])+p[i+1][j]);
            }
        }
        ll ans=0;
        for(int j=0;j<=n;j++)ans=max(ans,max(dp[n][j][0],dp[n][j][1]));
        return ans;
    }
};


long long max_weights(int N, int M, vector<int> X, vector<int> Y,vector<int> W) {
    // assert(N<=300);
    n=N;
    int MX=0;
    bool sub=1;
    for(int i=0;i<M;i++){
        X[i]++;
        Y[i]++;
        y[X[i]].pb({Y[i],i});
        vec[Y[i]].pb({X[i],W[i]});
        sub&=(X[i]%2==1);
        MX=max(MX,X[i]);
    }
    if(sub){
        ll ans=0;
        for(int i=0;i<M;i++)ans+=W[i];
        return ans;
    }
    if(MX<=2){
        if(N==2){
            ll f=0,f1=0;
            for(int i=0;i<M;i++){
                if(X[i]%2)f+=W[i];
                else f1+=W[i];
            }
            return max(f,f1);
        }
        ll sum=0;
        for(int i=0;i<M;i++){
            if(X[i]%2==0)sum+=W[i];
        }
        ll ans=sum;
        for(int i=1;i<=N;i++){
            for(auto [x,w]:vec[i]){
                if(x%2==1)sum+=w;
                else sum-=w;
            }
            ans=max(ans,sum);
        }
        return ans;
    }
    for(int i=1;i<=N;i++){
        if(y[i].empty())continue;
        sort(all(y[i]));
        p[i].pb(W[y[i][0].S]);
        for(int j=1;j<sz(y[i]);j++){
            p[i].pb(p[i].back()+W[y[i][j].S]);
        }
    }
    if(N<=300){
        w.resize(N+10);
        for(int i=1;i<=n;i++){
            w[i].resize(n+10);
            for(int j=1;j<=n;j++){
                w[i][j]=0;
            }
            for(auto [pos,num]:y[i])w[i][pos]=W[num];
        }
        t300 FFF;
        return FFF.solve300();
    }
    can[0].pb(0);
    can[N+1].pb(0);
    for(int i=1;i<=N;i++){
        can[i].pb(0);
        if(i>0){
            for(auto [x,b]:y[i-1])can[i].pb(x);
        }
        if(i+1<=N){
            for(auto [x,b]:y[i+1])can[i].pb(x);
        }
        sort(all(can[i]));
        can[i].erase(unique(all(can[i])),can[i].end());
    }
    for(int i=1;i<=N+1;i++){
        dp[i].resize(sz(can[i]));
        for(int j=0;j<sz(dp[i]);j++){
            dp[i][j].resize(sz(can[i-1]));
            for(int k=0;k<sz(can[i-1]);k++){
                dp[i][j][k]=0;
            }
        }
    }
    for(int i=0;i<N;i++){
        sumF[i].resize(sz(can[i]));
        for(int j=0;j<sz(can[i]);j++){
            sumF[i][j].resize(sz(can[i+1]));
            for(int k=0;k<sz(can[i+1]);k++){
                sumF[i][j][k]=getSum(i+1,can[i+1][k]+1,can[i][j]);
            }
        }
    }
    for(int i=1;i<=N+1;i++){
        sumB[i].resize(sz(can[i]));
        for(int j=0;j<sz(can[i]);j++){
            sumB[i][j].resize(sz(can[i-1]));
            for(int k=0;k<sz(can[i-1]);k++){
                sumB[i][j][k]=getSum(i-1,can[i-1][k]+1,can[i][j]);
            }
        }
    }
    for(int i=1;i<=N;i++){
        for(int j=0;j<sz(can[i]);j++){
            for(int k=0;k<sz(can[i-1]);k++){
                for(int f=0;f<sz(can[i+1]);f++){
                    ll nxt=dp[i][j][k];
                    {
                        nxt+=max(sumF[i-1][k][j],sumB[i+1][f][j]);
                    }
                    dp[i+1][f][j]=max(dp[i+1][f][j],nxt);
                }
            }
        }
    }
    ll ans=0;
    for(int j=0;j<sz(can[N]);j++)ans=max(ans,dp[N+1][0][j]);
    return ans;
}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 41672 KB Output is correct
2 Correct 41 ms 41676 KB Output is correct
3 Correct 20 ms 34652 KB Output is correct
4 Correct 16 ms 34652 KB Output is correct
5 Correct 132 ms 51364 KB Output is correct
6 Correct 114 ms 53840 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 34652 KB Output is correct
2 Correct 65 ms 45648 KB Output is correct
3 Correct 71 ms 45628 KB Output is correct
4 Correct 42 ms 40788 KB Output is correct
5 Correct 40 ms 41664 KB Output is correct
6 Correct 18 ms 34652 KB Output is correct
7 Correct 17 ms 34652 KB Output is correct
8 Correct 20 ms 34648 KB Output is correct
9 Correct 17 ms 34736 KB Output is correct
10 Correct 17 ms 34648 KB Output is correct
11 Correct 24 ms 34652 KB Output is correct
12 Correct 35 ms 40632 KB Output is correct
13 Correct 43 ms 41668 KB Output is correct
14 Correct 39 ms 40416 KB Output is correct
15 Correct 38 ms 39752 KB Output is correct
16 Correct 36 ms 40488 KB Output is correct
17 Correct 41 ms 41144 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 34608 KB Output is correct
2 Correct 48 ms 56608 KB Output is correct
3 Correct 87 ms 71112 KB Output is correct
4 Correct 71 ms 68044 KB Output is correct
5 Correct 137 ms 86472 KB Output is correct
6 Correct 133 ms 86236 KB Output is correct
7 Correct 123 ms 86468 KB Output is correct
8 Correct 118 ms 86328 KB Output is correct

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 48 ms 73288 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 48 ms 73288 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 48 ms 73288 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 34608 KB Output is correct
2 Correct 48 ms 56608 KB Output is correct
3 Correct 87 ms 71112 KB Output is correct
4 Correct 71 ms 68044 KB Output is correct
5 Correct 137 ms 86472 KB Output is correct
6 Correct 133 ms 86236 KB Output is correct
7 Correct 123 ms 86468 KB Output is correct
8 Correct 118 ms 86328 KB Output is correct
9 Correct 217 ms 102736 KB Output is correct
10 Correct 104 ms 71480 KB Output is correct
11 Correct 207 ms 108604 KB Output is correct
12 Correct 24 ms 34652 KB Output is correct
13 Correct 15 ms 34648 KB Output is correct
14 Correct 16 ms 34828 KB Output is correct
15 Correct 19 ms 34628 KB Output is correct
16 Correct 16 ms 34648 KB Output is correct
17 Runtime error 41 ms 73040 KB Execution killed with signal 11
18 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 41672 KB Output is correct
2 Correct 41 ms 41676 KB Output is correct
3 Correct 20 ms 34652 KB Output is correct
4 Correct 16 ms 34652 KB Output is correct
5 Correct 132 ms 51364 KB Output is correct
6 Correct 114 ms 53840 KB Output is correct
7 Correct 16 ms 34652 KB Output is correct
8 Correct 65 ms 45648 KB Output is correct
9 Correct 71 ms 45628 KB Output is correct
10 Correct 42 ms 40788 KB Output is correct
11 Correct 40 ms 41664 KB Output is correct
12 Correct 18 ms 34652 KB Output is correct
13 Correct 17 ms 34652 KB Output is correct
14 Correct 20 ms 34648 KB Output is correct
15 Correct 17 ms 34736 KB Output is correct
16 Correct 17 ms 34648 KB Output is correct
17 Correct 24 ms 34652 KB Output is correct
18 Correct 35 ms 40632 KB Output is correct
19 Correct 43 ms 41668 KB Output is correct
20 Correct 39 ms 40416 KB Output is correct
21 Correct 38 ms 39752 KB Output is correct
22 Correct 36 ms 40488 KB Output is correct
23 Correct 41 ms 41144 KB Output is correct
24 Correct 16 ms 34608 KB Output is correct
25 Correct 48 ms 56608 KB Output is correct
26 Correct 87 ms 71112 KB Output is correct
27 Correct 71 ms 68044 KB Output is correct
28 Correct 137 ms 86472 KB Output is correct
29 Correct 133 ms 86236 KB Output is correct
30 Correct 123 ms 86468 KB Output is correct
31 Correct 118 ms 86328 KB Output is correct
32 Runtime error 48 ms 73288 KB Execution killed with signal 11
33 Halted 0 ms 0 KB -