Submission #1216134

#TimeUsernameProblemLanguageResultExecution timeMemory
1216134Mousa_AboubakerCatfish Farm (IOI22_fish)C++20
0 / 100
52 ms10852 KiB
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;

using ll = long long;

long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W)
{
  auto n = N, m = M;
  auto x = X, y = Y, w = W;
  // for(auto &i: x)
  //   i = n - i - 1;
  ll f = 0, s = 0;
  for (int i = 0; i < m; i++)
  {
    if (x[i] == 0)
      f += w[i];
    else
      s += w[i];
  }
  if (n > 1)
    return max(f, s);
  return 0;
}
#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...