제출 #1336082

#제출 시각아이디문제언어결과실행 시간메모리
1336082justin271828메기 농장 (IOI22_fish)C++20
0 / 100
49 ms7260 KiB
#include "fish.h"

#include <bits/stdc++.h>
using namespace std;
#include <vector>

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