Submission #1245185

#TimeUsernameProblemLanguageResultExecution timeMemory
1245185DeathIsAwe메기 농장 (IOI22_fish)C++20
3 / 100
50 ms10852 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 = 0; ll sum2 = 0; 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...