제출 #1073249

#제출 시각아이디문제언어결과실행 시간메모리
1073249Zicrus메기 농장 (IOI22_fish)C++17
0 / 100
63 ms19164 KiB
#include <bits/stdc++.h> #include "fish.h" using namespace std; typedef long long ll; int n, m; vector<int> x, y, w; ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) { n = N; m = M; x = X; y = Y; w = W; ll res = 0; for (int i = 0; i < m; i++) { if (x[i] > 0) res += (ll)w[i]; } ll mx = res; vector<ll> a(n), b(n); for (int i = 0; i < m; i++) { if (x[i] > 0) b[y[i]] = (ll)w[i]; else a[y[i]] = (ll)w[i]; } for (int i = 0; i < n; i++) { res -= b[i]; res += a[i]; mx = max(mx, res); } return mx; } #ifdef TEST #include "grader.cpp" #endif
#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...