| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1336042 | YSH2020 | 메기 농장 (IOI22_fish) | C++20 | 48 ms | 9052 KiB |
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
//long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
//long long ans = 0; for (int i =0; i < M; i++) ans += W[i];
//return ans;
//}
long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
long long pref[2][N+1];
memset(pref,0,sizeof(pref));
for (int i = 0; i < M; i++) {
pref[X[i]][Y[i]+1]+=W[i];
}
for (int i = 1; i <= N; i++) {
pref[0][i]+=pref[0][i-1];
pref[1][i]+=pref[1][i-1];
}
return max(pref[0][N], pref[1][N]);
}| # | 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... | ||||
