제출 #1247406

#제출 시각아이디문제언어결과실행 시간메모리
1247406fskarica메기 농장 (IOI22_fish)C++20
0 / 100
50 ms10824 KiB
#include "fish.h" #include <bits/stdc++.h> using namespace std; #define ll long long #define fi first #define se second #define pii pair<int, int> int n, m; vector <int> vx, vy, w; ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) { n = N, m = M, vx = X, vy = Y, w = W; ll ret = 0, ret2 = 0; for (int i = 0; i < m; i++) { if (vx[i] == 0) ret += w[i]; else ret2 += w[i]; } return max(ret, ret2); }
#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...