Submission #1313063

#TimeUsernameProblemLanguageResultExecution timeMemory
1313063kawhietCatfish Farm (IOI22_fish)C++20
0 / 100
22 ms12352 KiB
#include <bits/stdc++.h>
#include "fish.h"
using namespace std;

long long max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w) {
  vector<int> a(n);
  for (int i = 0; i < m; i++) {
    a[x[i]] = w[i];
  }
  vector<vector<long long>> p(n + 1, vector<long long>(2)), s(n + 2, vector<long long>(2));
  for (int i = 0; i < n; i++) {
    int j = i % 2;
    p[i + 1][j] = p[i][j] + a[i];
    p[i + 1][1 - j] = p[i][1 - j];
  }
  for (int i = n - 1; i >= 0; i--) {
    int j = i % 2;
    s[i][j] = s[i + 1][j] + a[i];
    s[i][1 - j] = s[i + 1][1 - j];
  }
  long long ans = max(p[n][1], p[n][0]);
  for (int i = 0; i <= n; i++) {
    for (int s1 = 0; s1 < 2; s1++) {
      for (int s2 = 0; s2 < 2; s2++) {
        ans = max(ans, p[i][s1] + s[i + 1][s2]);
      }
    }
  }
  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...