제출 #1043158

#제출 시각아이디문제언어결과실행 시간메모리
1043158ezzzay메기 농장 (IOI22_fish)C++17
0 / 100
12 ms4440 KiB
#include "fish.h" #include<bits/stdc++.h> using namespace std; #include <vector> #define ll long long const int MN=1e6; ll ps[MN][2]; long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,std::vector<int> W) { ll ans=0; for(int i=0;i<M;i++){ ps[Y[i]][X[i]]+=W[i]; } return 0; for(int i=1;i<MN-5;i++){ ps[i][0]+=ps[i-1][0]; ps[i][1]+=ps[i-1][1]; } for(int i=0;i<N;i++){ ans=max(ans,ps[N+5][0]-ps[i][0]+ps[i][1]); } ans=max(ans,ps[N+5][0]); ans=max(ans,ps[N+5][1]); }
#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...