제출 #785084

#제출 시각아이디문제언어결과실행 시간메모리
785084khshg메기 농장 (IOI22_fish)C++17
0 / 100
67 ms7268 KiB
#include<bits/stdc++.h> using namespace std; long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) { array<long long, 2> ans; ans[0] = ans[1] = 0LL; for(int i = 0; i < M; ++i) ans[(X[i] == 0 ? 0 : 1)] += (long long)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...