제출 #629359

#제출 시각아이디문제언어결과실행 시간메모리
629359DarkMatter메기 농장 (IOI22_fish)C++17
6 / 100
96 ms8804 KiB
#include<bits/stdc++.h> #include "fish.h" #include <vector> using namespace std; typedef long long ll; long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) { ll ans = 0; vector<ll>cs1(N + 1, 0), cs2(N + 1, 0); for (int i = 0; i < M; i++) { if (X[i] == 0) cs1[Y[i]] += W[i]; else cs2[Y[i]] += W[i]; } for (int i = 1; i < N; i++) cs1[i] += cs1[i - 1], cs2[i] += cs2[i - 1]; ans = max(cs1[N - 1], cs2[N - 1]); if (N == 2) return ans; for (int i = 0; i < N; i++) { ll cur = cs2[N - 1]; cur -= cs2[i]; cur += cs1[i]; ans = max(ans, cur); } return ans; }
#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...