Submission #1260882

#TimeUsernameProblemLanguageResultExecution timeMemory
1260882rayan_bd메기 농장 (IOI22_fish)C++20
3 / 100
123 ms15176 KiB
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
long long dp[(int) 1e5 + 100][2];
long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
  map<int, long long> mp;
  long long ans = 0;
  for(int i = 0; i < M; ++i){
    mp[X[i] + 1] += W[i];
  }
  for(int i = 1; i <= N; ++i){
    dp[i][0] = dp[i - 1][1] + mp[i];
    dp[i][1] = max(dp[i - 1][1], dp[i - 1][0]);
    ans = max({ans, dp[i][0], dp[i][1]});
  }
  return ans;
}
#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...