# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
712559 | josanneo22 | Catfish Farm (IOI22_fish) | C++17 | 96 ms | 25828 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//#include "fish.h"
#include<bits/stdc++.h>
#include<iostream>
#include<math.h>
#include <vector>
using namespace std;
long long max_weights(int n, int m, std::vector<int> x, std::vector<int> y,std::vector<int> w) {
int mx1 = -1, mx2 = -1;
vector<vector<long long>> grid(n, vector<long long>(2,0LL));
for (int i = 0; i < m; i++) {
if (x[i] == 0) mx1 = max(mx1, y[i]);
else if(x[i]==1) mx2 = max(mx2, y[i]);
grid[y[i]][x[i]] = w[i];
}
if (mx1 == -1 || mx2 == -1) {
long long ans = 0;
for (int i = 0; i < m; i++) {
ans += (long long)w[i];
}
return ans;
}
else {
long long ans = 0;
long long meow0 = 0,meow1 = 0;
for (int i = mx1; i >= 0;i--) {
meow0 += grid[i][0];
}
for (int i = mx2; i >= 0; i--) {
meow1 += grid[i][1];
}
return max(meow0,meow1);
}
}
Compilation message (stderr)
# | 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... |