제출 #1244237

#제출 시각아이디문제언어결과실행 시간메모리
1244237amine_aroua메기 농장 (IOI22_fish)C++20
0 / 100
1014 ms2162688 KiB
#include "fish.h" #include <bits/stdc++.h> using namespace std; using ll = long long; long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) { vector<vector<ll>> y(2 ,vector<ll>(N)); vector<vector<ll>> w(N ,vector<ll>(N)); for(int i = 0 ; i <M ; i++) { y[X[i]][Y[i]] = W[i]; w[X[i]][Y[i]] = W[i]; } for(int i = 0 ; i < 2 ; i++) { for(int j = 1 ; j < N ; j++) { y[i][j]+=y[i][j - 1]; } } if(N == 2) { return max(y[0][N - 1] , y[1][N - 1]); } ll ans = max(y[0][N - 1] , y[1][N - 1]); ll s = y[1][N - 1]; for(int i = 0 ; i < N ; i++) { s-=w[1][i]; ans = max(ans , y[0][i] + s); } 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...