Submission #1072428

#TimeUsernameProblemLanguageResultExecution timeMemory
1072428vjudge1Catfish Farm (IOI22_fish)C++17
0 / 100
60 ms20960 KiB
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector <ll>;
using ii = pair <ll, ll>;
using vii = vector <ii>;
using vi = vector <int>;

ll max_weights (int n, int m, vi vx, vi vy, vi vw) {
    ll c[2]{};
    for (ll i = 0; i < m; i++)
        c[vx[i]] += vw[i];
    return max(c[0], c[1]);
}
#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...