Submission #966192

#TimeUsernameProblemLanguageResultExecution timeMemory
966192andrej246Catfish Farm (IOI22_fish)C++17
0 / 100
70 ms7332 KiB
#include "fish.h" #include <bits/stdc++.h> using namespace std; #define NL '\n' #define EL cout << NL #define FOR(i,n) for(int i = 0; i < (n); i++) #define FORS(i,s,n) for(int i = (s); i < (n); i++) #define PRINTV(v) for(auto a:v) {cout << a << " ";} EL; #define PRINTVV(v) for(auto a:v) {PRINTV(a);} #define f first #define s second #define all(v) (v).begin(),(v).end() #define STRP(p) "{" << (p).f << "," << (p).s << "}" #define PRINTVP(v) for(auto a:v) {cout << STRP(a) << " ";} EL; #define PRINTVVP(v) for(auto a:v) {PRINTVP(a);} typedef long long ll; typedef vector<ll> vl; typedef vector<vl> vvl; typedef pair<ll,ll> pl; typedef vector<pl> vpl; typedef vector<vpl> vvpl; long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) { ll lsum = 0; ll rsum = 0; FOR(i,M) { if (X[i] == 0) lsum += W[i]; else rsum += W[i]; } return max(lsum,rsum); }
#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...