| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1335907 | enson | Catfish Farm (IOI22_fish) | C++20 | 49 ms | 7260 KiB |
#include <bits/stdc++.h>
using namespace std;
long long max_weights(int N, int M, vector<int>X, vector<int>Y, vector<int>W){
bool st1 = true;
for(int i = 0; i < M; i++) st1 &= (X[i]%2==0);
bool st2 = true;
for(int i = 0; i < M; i++) st2 &= (X[i]<=1);
bool st3 = true;
for(int i = 0; i < M; i++) st3 &= (Y[i]==0);
if (st1){
long long ans = 0;
for(int i = 0; i < M; i++){
ans += W[i];
}
return ans;
}
if (st2){
long long e = 0, o = 0;
for(int i = 0; i < M; i++){
if (X[i] == 0) e += W[i];
else o += W[i];
}
return max(e, o);
}
if (st3){
int A[M] = {0};
A[0] = W[0];
A[1] = W[1];
for(int i = 2; i < M; i++){
A[i] = max(A[i-2] + W[i], A[i-1]);
}
return max(A[M-1], A[M-2]);
}
}
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... | ||||
