제출 #1266927

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1266927		thelegendary08	Catfish Farm (IOI22_fish)	C++17	0 / 100	79 ms	15784 KiB

fish

#include "fish.h"
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
using namespace std;

// sub 2
ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
  vector<pair<ll,ll>> a, b;
  for (int i = 0; i < M; i++) {
    if (X[i] == 0) a.pb({Y[i],W[i]});
    else b.pb({Y[i],W[i]});
  }
  sort(all(a)); sort(all(b));
  ll cur = 0, mx = 0; int R = 0;
  for (auto x : b) cur += x.se;
  mx = max(mx, cur);
  for (int i = 0; i < a.size(); i++) {
    cur += a[i].se; 
    while (R < b.size() && b[R].fi < a[i].fi) {
      cur -= b[R].se; R++;
    }
    mx = max(mx, cur);
  }
  return mx;
}
/*
signed main(){
	int n,m; cin>>n>>m;
	vector<signed>x(m), y(m), w(m); 
	for(int i = 0; i < m; i++){
		cin>>x[i]>>y[i]>>w[i]; 
	}
	cout<<max_weights(n,m,x,y,w);
}
*/

• Subtask 1: 0 / 3
• Subtask 2: 0 / 6
• Subtask 3: 0 / 9
• Subtask 4: 0 / 14
• Subtask 5: 0 / 21
• Subtask 6: 0 / 17
• Subtask 7: 0 / 14
• Subtask 8: 0 / 16