제출 #1245184

#제출 시각아이디문제언어결과실행 시간메모리
1245184DeathIsAwe메기 농장 (IOI22_fish)C++20
0 / 100
13 ms3136 KiB
#include "fish.h" #include <bits/stdc++.h> #define ll long long #define pb push_back #define mp make_pair #define ff first #define ss second using namespace std; 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 sum1; ll sum2; for (int i=0;i<m;i++) { if (x[i] == 1) sum1 += w[i]; else sum2 += w[i]; } return max(sum1, sum2); }
#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...