제출 #1223538

#제출 시각아이디문제언어결과실행 시간메모리
1223538trimkus메기 농장 (IOI22_fish)C++20
0 / 100
27 ms6216 KiB
#include "fish.h" #include <bits/stdc++.h> using namespace std; using ll = long long; void chmax(ll& x, ll y) { x = max(x, y); } long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) { vector<vector<ll>> cnt(2, vector<ll>(N + 1)); for (int i = 0; i < N; ++i) { cnt[X[i]][Y[i] + 1] += W[i]; } for (int i = 0; i < N; ++i) { for (int j = 0; j < 2; ++j) { cnt[j][i + 1] += cnt[j][i]; } } if (N == 2) { return max(cnt[0][N], cnt[1][N]); } if (N == 1) return 0; ll res = 0; for (int i = 0; i < N; ++i) { res = max(res, cnt[0][i] + cnt[1][N] - cnt[1][i]); } return res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...