제출 #1234135

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1234135		dosts	Catfish Farm (IOI22_fish)	C++20	61 / 100	1096 ms	46228 KiB

fish

#include "fish.h"
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#define int long long
#define pii pair<int,int>
#define vi vector<int>
#define ff first
#define ss second
#define sp << " " <<
#define all(x) x.begin(),x.end()
#define big(x) ((int)(x.size()))
using namespace std;
const int MOD = 1e9+7, LIM = 1e6+1, inf = __LONG_LONG_MAX__/2;
const int NN = 100001;

int max_weights(signed N, signed M, vector<signed> X,vector<signed> Y, vector<signed> W) {
    //dp[top/bot][0]->dp[top/bot][1] 0 cost
    //dp[i][j][rising] --> max(dp[i-1][j'][rising]+w[i-1][h[j]]-w[i-1][h[j']])
    //dp[i][j][fall] = max(dp[i-1][j'][fall]-w[i][h[j]]+w[i][h[j]-1]); //O(4*(M+N)*prefsm)
    for (int i = 0;i<M;i++) X[i]++,Y[i]++;
    vector<vector<pii>> dp(N+2);
    vector<pii> fishes[N+2];
    vi pts[N+2];
    for (int i=0;i<M;i++) fishes[X[i]].push_back({Y[i],W[i]});
    pts[0].push_back(0);
    for (int i=1;i<=N+1;i++) {
      pts[i].push_back(0);
      if (i<N+1) for (auto it :fishes[i-1]) pts[i].push_back(it.ff);
      if(i<N+1)for (auto it :fishes[i+1]) pts[i].push_back(it.ff);
      if (i < N+1)pts[i].push_back(N);
    }
    for (int i=1;i<=N+1;i++) {
      sort(all(pts[i]));
      sort(all(fishes[i]));
      pts[i].erase(unique(all(pts[i])),pts[i].end());
    }
    for (int i=0;i<=N+1;i++) dp[i].assign(big(pts[i]),pii{-inf,-inf});
    dp[0][0] = {0,0};
    vi done(N+2,0);
    auto getweights = [&](int col,int h) -> int {
      if (fishes[col].empty()) return 0;
      if (!done[col]) {
        int cur = 0;
        for (auto& [hei,wei] : fishes[col]) {
          wei+=cur;
          cur = wei;
        }        
        done[col] = 1;
      }
      auto it = upper_bound(all(fishes[col]),pii{h,inf});
      if (it == fishes[col].begin()) return 0;
      --it;
      return it->ss;
    };
    for (int i=1;i<=N+1;i++) {
      for (int j=0;j<big(pts[i]);j++) {
        int plus = getweights(i-1,pts[i][j]);
        for (int jp = 0;jp<big(pts[i-1]) && pts[i-1][jp] <= pts[i][j];jp++) {
          dp[i][j].ff = max(dp[i][j].ff,
                        dp[i-1][jp].ff+plus-getweights(i-1,pts[i-1][jp]));
        }
        plus = getweights(i,pts[i][j]);
        for (int jp = big(pts[i-1])-1;jp>=0 && pts[i-1][jp] >= pts[i][j];jp--) {
          int mx = dp[i-1][jp].ss;
          if (jp == big(pts[i-1])-1) mx = max(mx,dp[i-1][jp].ff);
          dp[i][j].ss = max(dp[i][j].ss,
                        mx-plus+getweights(i,pts[i-1][jp]));
        }
      }
      if (i>2)dp[i].back().ff = max(dp[i].back().ff,dp[i-2].back().ff+getweights(i-1,N));
      if (i>=2) dp[i][0].ss = max(dp[i][0].ss,dp[i-2][0].ss);
      dp[i][0].ff = max(dp[i][0].ff,max(dp[i-1][0].ff,dp[i-1][0].ss));
      dp[i][0].ss = max(dp[i][0].ss,max(dp[i-1][0].ff,dp[i-1][0].ss));
      dp[i].back().ss = max(dp[i].back().ss,max(dp[i-1].back().ff,dp[i-1].back().ss));
      dp[i].back().ff = max(dp[i].back().ff,max(dp[i-1].back().ff,dp[i-1].back().ss));
    }
    int ans = 0;
    for (pii itt : dp[N+1]) {
      ans = max(ans,itt.ff);
      ans = max(ans,itt.ss);
    }
    return ans;
}

• Subtask 1: 3 / 3
• Subtask 2: 0 / 6
• Subtask 3: 9 / 9
• Subtask 4: 14 / 14
• Subtask 5: 21 / 21
• Subtask 6: 0 / 17
• Subtask 7: 14 / 14
• Subtask 8: 0 / 16