제출 #821924

#제출 시각아이디문제언어결과실행 시간메모리
821924YesPy메기 농장 (IOI22_fish)C++17
0 / 100
79 ms15208 KiB
#include <bits/stdc++.h> #include "fish.h" #define tcT template<class T #define fastio ios::sync_with_stdio(false);cin.tie(nullptr); #define ln '\n' #define nwln cout<<ln; using namespace std; tcT> using vr = vector<T>; using ll = long long; using vi = vr<int>; #define fri(i,a,b) for(int i=(a); i<(b); ++i) #define each(x, a) for(auto& x: a) #define maxs(i, j) (i = max(i, j)) const int MX = (int) 3e5+3; ll res, pf[2][MX]; ll max_weights(int n, int m, vi x, vi y, vi w) { fri(i,0,m) pf[x[i]][y[i]] += w[i]; fri(i,1,n) { fri(j,0,2) pf[j][i] += pf[j][i-1]; } res = pf[1][n-1]; fri(i,0,n) { maxs(res, pf[0][i] + pf[1][n-1] - pf[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...