제출 #1212706

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

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