| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1357162 | lyra_g13 | 메기 농장 (IOI22_fish) | C++20 | 38 ms | 7260 KiB |
#include "fish.h"
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
long long max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w) {
ll sum = 0;
ll sum2 = 0;
for (int i = 0; i < m; i++) {
if (x[i] == 0)
sum += w[i];
else if (x[i] == 1)
sum2 += w[i];
}
ll find = max(sum, sum2);
return find;
};| # | 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... | ||||
