제출 #1169741

#제출 시각아이디문제언어결과실행 시간메모리
1169741thelegendary08Catfish Farm (IOI22_fish)C++17
0 / 100
48 ms8776 KiB
#include "fish.h"
#include<bits/stdc++.h>
#define int long long
#define vi vector<int>
#define pb push_back
#define f0r(i,n) for(int i = 0; i<n; i++)
#define FOR(i, k, n) for(int i = k; i<n; i++)

using namespace std;

int max_weights(signed n, signed m, std::vector<signed> x, std::vector<signed> y,
                      std::vector<signed> w) {
	int ans = 0;
	vi a(n, 0);
	vi b(n, 0);
	f0r(i,m){
		if(x[i] == 0){
			a[y[i]] = w[i];
		}
		else{
			b[y[i]] = w[i];
		}
	}
	f0r(i, n){
		ans += b[i];
	}
	int cur = ans;
	f0r(i,n){
		cur += a[i] - b[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...