oj.uz

답안 #1023079

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1023079 2024-07-14T09:21:48 Z vjudge1 메기 농장 (IOI22_fish) C++17
67 / 100
 1000 ms 1668780 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++){
            for(int j=0;j<=n;j++){
                {
                    for(int f=j;f<=n;f++){
                        dp[i][j][0]=max(dp[i][j][0],max(dp[i-1][f][0],dp[i-1][f][1])+getP(i,j+1,f));
                    }
                }
                {
                    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]);
                }
                // cout<<i<<" "<<j<<" "<<dp[i][j][0]<<" "<<dp[i][j][1]<<'\n';
            }
        }
        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 37 ms 40648 KB Output is correct
2 Correct 46 ms 41828 KB Output is correct
3 Correct 17 ms 34652 KB Output is correct
4 Correct 17 ms 34652 KB Output is correct
5 Correct 104 ms 51512 KB Output is correct
6 Correct 120 ms 53840 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 34648 KB Output is correct
2 Correct 63 ms 44092 KB Output is correct
3 Correct 72 ms 45612 KB Output is correct
4 Correct 49 ms 40648 KB Output is correct
5 Correct 55 ms 41772 KB Output is correct
6 Correct 16 ms 34648 KB Output is correct
7 Correct 17 ms 34648 KB Output is correct
8 Correct 16 ms 34788 KB Output is correct
9 Correct 18 ms 34652 KB Output is correct
10 Correct 17 ms 34652 KB Output is correct
11 Correct 16 ms 34584 KB Output is correct
12 Correct 41 ms 40644 KB Output is correct
13 Correct 47 ms 41664 KB Output is correct
14 Correct 38 ms 40504 KB Output is correct
15 Correct 38 ms 39748 KB Output is correct
16 Correct 35 ms 40504 KB Output is correct
17 Correct 46 ms 41152 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 34652 KB Output is correct
2 Correct 49 ms 56912 KB Output is correct
3 Correct 79 ms 71112 KB Output is correct
4 Correct 69 ms 68080 KB Output is correct
5 Correct 122 ms 86472 KB Output is correct
6 Correct 106 ms 86464 KB Output is correct
7 Correct 102 ms 86468 KB Output is correct
8 Correct 117 ms 86340 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 34652 KB Output is correct
2 Correct 21 ms 34652 KB Output is correct
3 Correct 16 ms 34652 KB Output is correct
4 Correct 17 ms 34652 KB Output is correct
5 Correct 16 ms 34756 KB Output is correct
6 Correct 15 ms 34648 KB Output is correct
7 Correct 17 ms 34648 KB Output is correct
8 Correct 17 ms 34648 KB Output is correct
9 Correct 24 ms 35164 KB Output is correct
10 Correct 43 ms 36696 KB Output is correct
11 Correct 21 ms 35164 KB Output is correct
12 Correct 42 ms 36188 KB Output is correct
13 Correct 18 ms 34908 KB Output is correct
14 Correct 40 ms 36188 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 34652 KB Output is correct
2 Correct 21 ms 34652 KB Output is correct
3 Correct 16 ms 34652 KB Output is correct
4 Correct 17 ms 34652 KB Output is correct
5 Correct 16 ms 34756 KB Output is correct
6 Correct 15 ms 34648 KB Output is correct
7 Correct 17 ms 34648 KB Output is correct
8 Correct 17 ms 34648 KB Output is correct
9 Correct 24 ms 35164 KB Output is correct
10 Correct 43 ms 36696 KB Output is correct
11 Correct 21 ms 35164 KB Output is correct
12 Correct 42 ms 36188 KB Output is correct
13 Correct 18 ms 34908 KB Output is correct
14 Correct 40 ms 36188 KB Output is correct
15 Correct 40 ms 36184 KB Output is correct
16 Correct 18 ms 34904 KB Output is correct
17 Correct 60 ms 40016 KB Output is correct
18 Correct 51 ms 40216 KB Output is correct
19 Correct 52 ms 40028 KB Output is correct
20 Correct 66 ms 40016 KB Output is correct
21 Correct 52 ms 40020 KB Output is correct
22 Correct 68 ms 44112 KB Output is correct
23 Correct 52 ms 36988 KB Output is correct
24 Correct 48 ms 38408 KB Output is correct
25 Correct 42 ms 36184 KB Output is correct
26 Correct 43 ms 36952 KB Output is correct

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 34652 KB Output is correct
2 Correct 21 ms 34652 KB Output is correct
3 Correct 16 ms 34652 KB Output is correct
4 Correct 17 ms 34652 KB Output is correct
5 Correct 16 ms 34756 KB Output is correct
6 Correct 15 ms 34648 KB Output is correct
7 Correct 17 ms 34648 KB Output is correct
8 Correct 17 ms 34648 KB Output is correct
9 Correct 24 ms 35164 KB Output is correct
10 Correct 43 ms 36696 KB Output is correct
11 Correct 21 ms 35164 KB Output is correct
12 Correct 42 ms 36188 KB Output is correct
13 Correct 18 ms 34908 KB Output is correct
14 Correct 40 ms 36188 KB Output is correct
15 Correct 40 ms 36184 KB Output is correct
16 Correct 18 ms 34904 KB Output is correct
17 Correct 60 ms 40016 KB Output is correct
18 Correct 51 ms 40216 KB Output is correct
19 Correct 52 ms 40028 KB Output is correct
20 Correct 66 ms 40016 KB Output is correct
21 Correct 52 ms 40020 KB Output is correct
22 Correct 68 ms 44112 KB Output is correct
23 Correct 52 ms 36988 KB Output is correct
24 Correct 48 ms 38408 KB Output is correct
25 Correct 42 ms 36184 KB Output is correct
26 Correct 43 ms 36952 KB Output is correct
27 Correct 20 ms 36696 KB Output is correct
28 Execution timed out 1099 ms 1668780 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 49 ms 56912 KB Output is correct
3 Correct 79 ms 71112 KB Output is correct
4 Correct 69 ms 68080 KB Output is correct
5 Correct 122 ms 86472 KB Output is correct
6 Correct 106 ms 86464 KB Output is correct
7 Correct 102 ms 86468 KB Output is correct
8 Correct 117 ms 86340 KB Output is correct
9 Correct 156 ms 102740 KB Output is correct
10 Correct 104 ms 73280 KB Output is correct
11 Correct 187 ms 112024 KB Output is correct
12 Correct 16 ms 34652 KB Output is correct
13 Correct 17 ms 34652 KB Output is correct
14 Correct 16 ms 34696 KB Output is correct
15 Correct 16 ms 34648 KB Output is correct
16 Correct 16 ms 34652 KB Output is correct
17 Correct 16 ms 34640 KB Output is correct
18 Correct 16 ms 34648 KB Output is correct
19 Correct 16 ms 34596 KB Output is correct
20 Correct 52 ms 56656 KB Output is correct
21 Correct 49 ms 56664 KB Output is correct
22 Correct 164 ms 107600 KB Output is correct
23 Correct 230 ms 154424 KB Output is correct
24 Correct 254 ms 165204 KB Output is correct

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 40648 KB Output is correct
2 Correct 46 ms 41828 KB Output is correct
3 Correct 17 ms 34652 KB Output is correct
4 Correct 17 ms 34652 KB Output is correct
5 Correct 104 ms 51512 KB Output is correct
6 Correct 120 ms 53840 KB Output is correct
7 Correct 17 ms 34648 KB Output is correct
8 Correct 63 ms 44092 KB Output is correct
9 Correct 72 ms 45612 KB Output is correct
10 Correct 49 ms 40648 KB Output is correct
11 Correct 55 ms 41772 KB Output is correct
12 Correct 16 ms 34648 KB Output is correct
13 Correct 17 ms 34648 KB Output is correct
14 Correct 16 ms 34788 KB Output is correct
15 Correct 18 ms 34652 KB Output is correct
16 Correct 17 ms 34652 KB Output is correct
17 Correct 16 ms 34584 KB Output is correct
18 Correct 41 ms 40644 KB Output is correct
19 Correct 47 ms 41664 KB Output is correct
20 Correct 38 ms 40504 KB Output is correct
21 Correct 38 ms 39748 KB Output is correct
22 Correct 35 ms 40504 KB Output is correct
23 Correct 46 ms 41152 KB Output is correct
24 Correct 15 ms 34652 KB Output is correct
25 Correct 49 ms 56912 KB Output is correct
26 Correct 79 ms 71112 KB Output is correct
27 Correct 69 ms 68080 KB Output is correct
28 Correct 122 ms 86472 KB Output is correct
29 Correct 106 ms 86464 KB Output is correct
30 Correct 102 ms 86468 KB Output is correct
31 Correct 117 ms 86340 KB Output is correct
32 Correct 18 ms 34652 KB Output is correct
33 Correct 21 ms 34652 KB Output is correct
34 Correct 16 ms 34652 KB Output is correct
35 Correct 17 ms 34652 KB Output is correct
36 Correct 16 ms 34756 KB Output is correct
37 Correct 15 ms 34648 KB Output is correct
38 Correct 17 ms 34648 KB Output is correct
39 Correct 17 ms 34648 KB Output is correct
40 Correct 24 ms 35164 KB Output is correct
41 Correct 43 ms 36696 KB Output is correct
42 Correct 21 ms 35164 KB Output is correct
43 Correct 42 ms 36188 KB Output is correct
44 Correct 18 ms 34908 KB Output is correct
45 Correct 40 ms 36188 KB Output is correct
46 Correct 40 ms 36184 KB Output is correct
47 Correct 18 ms 34904 KB Output is correct
48 Correct 60 ms 40016 KB Output is correct
49 Correct 51 ms 40216 KB Output is correct
50 Correct 52 ms 40028 KB Output is correct
51 Correct 66 ms 40016 KB Output is correct
52 Correct 52 ms 40020 KB Output is correct
53 Correct 68 ms 44112 KB Output is correct
54 Correct 52 ms 36988 KB Output is correct
55 Correct 48 ms 38408 KB Output is correct
56 Correct 42 ms 36184 KB Output is correct
57 Correct 43 ms 36952 KB Output is correct
58 Correct 20 ms 36696 KB Output is correct
59 Execution timed out 1099 ms 1668780 KB Time limit exceeded
60 Halted 0 ms 0 KB -