#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define all(a) a.begin(), a.end()
using namespace std;
using namespace __gnu_pbds;
long long max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w) {
long long sum[2]{};
int a[2][n]{};
for (int i = 0; i < m; i++) {
sum[ x[i] ] += w[i];
a[ x[i] ][ y[i] ] = w[i];
}
if (n == 2)
return max(sum[0], sum[1]);
long long cur = sum[0], ans = cur;
for (int i = 0; i < n; i++) {
cur -= a[0][i];
cur += a[1][i];
ans = max(ans, cur);
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |