제출 #1232055

#제출 시각아이디문제언어결과실행 시간메모리
1232055RakhimovAmir메기 농장 (IOI22_fish)C++17
0 / 100
48 ms7496 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) {
	ll res[2] = {0, 0};
	for (int i = 0; i < M; i++) {
		res[X[i]] += W[i];
	}
	return max(res[0], res[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...