제출 #1330453

#제출 시각아이디문제언어결과실행 시간메모리
1330453SpyrosAliv메기 농장 (IOI22_fish)C++20
0 / 100
52 ms10844 KiB
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long

int n, m;
vector<int> x, y, w;

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