제출 #821925

#제출 시각아이디문제언어결과실행 시간메모리
821925YesPyCatfish Farm (IOI22_fish)C++17
0 / 100
78 ms17872 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>;
using vl = vr<ll>;
using vvl = vr<vl>;

#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;
vvl pf;

ll max_weights(int n, int m, vi x, vi y, vi w) {
	pf.assign(2, vl(n, 0));
	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...