Submission #1234726

#TimeUsernameProblemLanguageResultExecution timeMemory
1234726marizaCatfish Farm (IOI22_fish)C++20
0 / 100
48 ms7240 KiB
#include "fish.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; const ll N=1e5; #define MID ((l+r)/2) long long max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w){ ll c0=0, c1=0; for(ll i=0; i<m; i++){ if(x[i]==0) c0+=w[i]; else c1+=w[i]; } return max(c0,c1); }
#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...