Submission #1073294

#TimeUsernameProblemLanguageResultExecution timeMemory
1073294ZicrusCatfish Farm (IOI22_fish)C++17
0 / 100
72 ms17132 KiB
#include <bits/stdc++.h>
#include "fish.h"
using namespace std;
    
typedef long long ll;
    
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 res = 0;
    for (int i = 0; i < m; i++) {
        if (x[i] > 0) res += w[i];
        if (x[i] > 1) return 0;
    }
    ll mx = res;
    vector<ll> a(n), b(n);
    for (int i = 0; i < m; i++) {
        if (x[i] > 0) b[y[i]] = w[i];
        else a[y[i]] = w[i];
    }
    for (int i = 0; i < n; i++) {
        res -= b[i];
        res += a[i];
        mx = max(mx, res);
    }
    return mx;
}
    
#ifdef TEST
#include "grader.cpp"
#endif
#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...