Submission #1056661

#TimeUsernameProblemLanguageResultExecution timeMemory
1056661MercubytheFirst메기 농장 (IOI22_fish)C++17
0 / 100
22 ms3608 KiB
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll inf = 1e9 + 37;


long long max_weights(signed N, signed M, vector<signed> X, vector<signed> Y, vector<signed> W) {
  W.push_back(0);
  vector<ll> dp(M), ydx(N + 1, M);
  for(int i = 0; i < M; ++i) {
    ydx[Y[i]] = i;
  }
  for(ll i = 0; i < N; ++i) {
    dp[i] = W[ydx[i + 1]] + (i > 0 ? W[ydx[i - 1]] : 0);
    if(i > 0) {
      dp[i] = max(dp[i], dp[i - 1] + W[ydx[i + 1]]);
    }
    if(i > 1) {
      dp[i] = max(dp[i], dp[i - 2] + W[ydx[i + 1]]);
    }
  }
  return *max_element(dp.begin(), dp.end());
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...