Submission #1223541

#TimeUsernameProblemLanguageResultExecution timeMemory
1223541trimkusCatfish Farm (IOI22_fish)C++20
6 / 100
49 ms9796 KiB
#include "fish.h"

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

void chmax(ll& x, ll y) {
  x = max(x, y);
}

long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,
                      std::vector<int> W) {
    vector<vector<ll>> cnt(2, vector<ll>(N + 1));
    for (int i = 0; i < M; ++i) {
      cnt[X[i]][Y[i] + 1] += W[i];
    }
    for (int j = 0; j < 2; ++j) {
      for (int i = 0; i < N; ++i) {
        cnt[j][i + 1] += cnt[j][i];
      }
    }
    if (N == 2) {
      return max(cnt[0][N], cnt[1][N]);
    }
    if (N == 1) return 0;
    ll res = 0;
    for (int i = 0; i <= N; ++i) {
      res = max(res, cnt[0][i] + cnt[1][N] - cnt[1][i]);
    }
    return res;
}
#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...