oj.uz

답안 #1023103

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1023103 2024-07-14T09:42:26 Z vjudge1 메기 농장 (IOI22_fish) C++17
67 / 100
 1000 ms 1704708 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;

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);
        for(int i=2;i<=n;i++){
            {
                ll mx=0;
                for(int j=n;j>=0;j--){
                    mx=max(mx,max(dp[i-1][j][0],dp[i-1][j][1])+p[i][j]);
                    dp[i][j][0]=mx-p[i][j];
                }

            }
            for(int j=0;j<=n;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]);
                }
            }
        }
        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 34 ms 40644 KB Output is correct
2 Correct 40 ms 41668 KB Output is correct
3 Correct 18 ms 34652 KB Output is correct
4 Correct 14 ms 34576 KB Output is correct
5 Correct 99 ms 51360 KB Output is correct
6 Correct 114 ms 53720 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 34652 KB Output is correct
2 Correct 59 ms 44160 KB Output is correct
3 Correct 79 ms 45616 KB Output is correct
4 Correct 35 ms 40644 KB Output is correct
5 Correct 39 ms 41664 KB Output is correct
6 Correct 15 ms 34652 KB Output is correct
7 Correct 14 ms 34592 KB Output is correct
8 Correct 15 ms 34652 KB Output is correct
9 Correct 15 ms 34596 KB Output is correct
10 Correct 14 ms 34652 KB Output is correct
11 Correct 15 ms 34660 KB Output is correct
12 Correct 38 ms 40796 KB Output is correct
13 Correct 40 ms 41668 KB Output is correct
14 Correct 40 ms 40544 KB Output is correct
15 Correct 37 ms 39748 KB Output is correct
16 Correct 39 ms 40392 KB Output is correct
17 Correct 39 ms 40896 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 34652 KB Output is correct
2 Correct 46 ms 56712 KB Output is correct
3 Correct 78 ms 71288 KB Output is correct
4 Correct 70 ms 68040 KB Output is correct
5 Correct 113 ms 86468 KB Output is correct
6 Correct 125 ms 86468 KB Output is correct
7 Correct 108 ms 86328 KB Output is correct
8 Correct 111 ms 86724 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 34652 KB Output is correct
2 Correct 15 ms 34644 KB Output is correct
3 Correct 15 ms 34648 KB Output is correct
4 Correct 16 ms 34648 KB Output is correct
5 Correct 17 ms 34816 KB Output is correct
6 Correct 15 ms 34820 KB Output is correct
7 Correct 15 ms 34568 KB Output is correct
8 Correct 15 ms 34736 KB Output is correct
9 Correct 17 ms 35172 KB Output is correct
10 Correct 29 ms 36444 KB Output is correct
11 Correct 18 ms 35172 KB Output is correct
12 Correct 29 ms 36188 KB Output is correct
13 Correct 15 ms 34908 KB Output is correct
14 Correct 26 ms 36188 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 34652 KB Output is correct
2 Correct 15 ms 34644 KB Output is correct
3 Correct 15 ms 34648 KB Output is correct
4 Correct 16 ms 34648 KB Output is correct
5 Correct 17 ms 34816 KB Output is correct
6 Correct 15 ms 34820 KB Output is correct
7 Correct 15 ms 34568 KB Output is correct
8 Correct 15 ms 34736 KB Output is correct
9 Correct 17 ms 35172 KB Output is correct
10 Correct 29 ms 36444 KB Output is correct
11 Correct 18 ms 35172 KB Output is correct
12 Correct 29 ms 36188 KB Output is correct
13 Correct 15 ms 34908 KB Output is correct
14 Correct 26 ms 36188 KB Output is correct
15 Correct 26 ms 36184 KB Output is correct
16 Correct 16 ms 35004 KB Output is correct
17 Correct 39 ms 39508 KB Output is correct
18 Correct 39 ms 40016 KB Output is correct
19 Correct 42 ms 39772 KB Output is correct
20 Correct 38 ms 39764 KB Output is correct
21 Correct 39 ms 39768 KB Output is correct
22 Correct 51 ms 43604 KB Output is correct
23 Correct 30 ms 36956 KB Output is correct
24 Correct 36 ms 38492 KB Output is correct
25 Correct 28 ms 36188 KB Output is correct
26 Correct 30 ms 36956 KB Output is correct

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 34652 KB Output is correct
2 Correct 15 ms 34644 KB Output is correct
3 Correct 15 ms 34648 KB Output is correct
4 Correct 16 ms 34648 KB Output is correct
5 Correct 17 ms 34816 KB Output is correct
6 Correct 15 ms 34820 KB Output is correct
7 Correct 15 ms 34568 KB Output is correct
8 Correct 15 ms 34736 KB Output is correct
9 Correct 17 ms 35172 KB Output is correct
10 Correct 29 ms 36444 KB Output is correct
11 Correct 18 ms 35172 KB Output is correct
12 Correct 29 ms 36188 KB Output is correct
13 Correct 15 ms 34908 KB Output is correct
14 Correct 26 ms 36188 KB Output is correct
15 Correct 26 ms 36184 KB Output is correct
16 Correct 16 ms 35004 KB Output is correct
17 Correct 39 ms 39508 KB Output is correct
18 Correct 39 ms 40016 KB Output is correct
19 Correct 42 ms 39772 KB Output is correct
20 Correct 38 ms 39764 KB Output is correct
21 Correct 39 ms 39768 KB Output is correct
22 Correct 51 ms 43604 KB Output is correct
23 Correct 30 ms 36956 KB Output is correct
24 Correct 36 ms 38492 KB Output is correct
25 Correct 28 ms 36188 KB Output is correct
26 Correct 30 ms 36956 KB Output is correct
27 Correct 18 ms 36644 KB Output is correct
28 Execution timed out 1140 ms 1704708 KB Time limit exceeded
29 Halted 0 ms 0 KB -

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 34652 KB Output is correct
2 Correct 46 ms 56712 KB Output is correct
3 Correct 78 ms 71288 KB Output is correct
4 Correct 70 ms 68040 KB Output is correct
5 Correct 113 ms 86468 KB Output is correct
6 Correct 125 ms 86468 KB Output is correct
7 Correct 108 ms 86328 KB Output is correct
8 Correct 111 ms 86724 KB Output is correct
9 Correct 145 ms 102740 KB Output is correct
10 Correct 89 ms 71644 KB Output is correct
11 Correct 196 ms 108596 KB Output is correct
12 Correct 18 ms 34652 KB Output is correct
13 Correct 15 ms 34652 KB Output is correct
14 Correct 14 ms 34812 KB Output is correct
15 Correct 14 ms 34648 KB Output is correct
16 Correct 14 ms 34652 KB Output is correct
17 Correct 13 ms 34684 KB Output is correct
18 Correct 15 ms 34648 KB Output is correct
19 Correct 15 ms 34652 KB Output is correct
20 Correct 46 ms 56660 KB Output is correct
21 Correct 46 ms 56656 KB Output is correct
22 Correct 163 ms 105656 KB Output is correct
23 Correct 268 ms 151092 KB Output is correct
24 Correct 257 ms 161100 KB Output is correct

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 40644 KB Output is correct
2 Correct 40 ms 41668 KB Output is correct
3 Correct 18 ms 34652 KB Output is correct
4 Correct 14 ms 34576 KB Output is correct
5 Correct 99 ms 51360 KB Output is correct
6 Correct 114 ms 53720 KB Output is correct
7 Correct 15 ms 34652 KB Output is correct
8 Correct 59 ms 44160 KB Output is correct
9 Correct 79 ms 45616 KB Output is correct
10 Correct 35 ms 40644 KB Output is correct
11 Correct 39 ms 41664 KB Output is correct
12 Correct 15 ms 34652 KB Output is correct
13 Correct 14 ms 34592 KB Output is correct
14 Correct 15 ms 34652 KB Output is correct
15 Correct 15 ms 34596 KB Output is correct
16 Correct 14 ms 34652 KB Output is correct
17 Correct 15 ms 34660 KB Output is correct
18 Correct 38 ms 40796 KB Output is correct
19 Correct 40 ms 41668 KB Output is correct
20 Correct 40 ms 40544 KB Output is correct
21 Correct 37 ms 39748 KB Output is correct
22 Correct 39 ms 40392 KB Output is correct
23 Correct 39 ms 40896 KB Output is correct
24 Correct 15 ms 34652 KB Output is correct
25 Correct 46 ms 56712 KB Output is correct
26 Correct 78 ms 71288 KB Output is correct
27 Correct 70 ms 68040 KB Output is correct
28 Correct 113 ms 86468 KB Output is correct
29 Correct 125 ms 86468 KB Output is correct
30 Correct 108 ms 86328 KB Output is correct
31 Correct 111 ms 86724 KB Output is correct
32 Correct 15 ms 34652 KB Output is correct
33 Correct 15 ms 34644 KB Output is correct
34 Correct 15 ms 34648 KB Output is correct
35 Correct 16 ms 34648 KB Output is correct
36 Correct 17 ms 34816 KB Output is correct
37 Correct 15 ms 34820 KB Output is correct
38 Correct 15 ms 34568 KB Output is correct
39 Correct 15 ms 34736 KB Output is correct
40 Correct 17 ms 35172 KB Output is correct
41 Correct 29 ms 36444 KB Output is correct
42 Correct 18 ms 35172 KB Output is correct
43 Correct 29 ms 36188 KB Output is correct
44 Correct 15 ms 34908 KB Output is correct
45 Correct 26 ms 36188 KB Output is correct
46 Correct 26 ms 36184 KB Output is correct
47 Correct 16 ms 35004 KB Output is correct
48 Correct 39 ms 39508 KB Output is correct
49 Correct 39 ms 40016 KB Output is correct
50 Correct 42 ms 39772 KB Output is correct
51 Correct 38 ms 39764 KB Output is correct
52 Correct 39 ms 39768 KB Output is correct
53 Correct 51 ms 43604 KB Output is correct
54 Correct 30 ms 36956 KB Output is correct
55 Correct 36 ms 38492 KB Output is correct
56 Correct 28 ms 36188 KB Output is correct
57 Correct 30 ms 36956 KB Output is correct
58 Correct 18 ms 36644 KB Output is correct
59 Execution timed out 1140 ms 1704708 KB Time limit exceeded
60 Halted 0 ms 0 KB -