제출 #778602

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
778602		Tekor	메기 농장 (IOI22_fish)	C++17	12 / 100	160 ms	43968 KiB

fish

#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define en '\n'
#define pii pair <int,int>
#define mp make_pair
#define f first
#define s second
#define all(v) v.begin(),v.end()
const int N = 1e5 + 10;
const ll LLINF = (ll)1e18;
vector <pair <int,ll>> g[N];
vector <ll> dp[N],dp1[N];
map <int,bool> was[N];
ll max_weights(int n, int m, vector <int> X, vector <int> Y, vector <int> W) {
	for(int i = 0;i < m;i++) {
		g[X[i]].pb(mp(Y[i] + 1,W[i]));
//		was[X[i] + 1][Y[i] + 1] = 1;
	}
	for(int i = 0;i < n;i++) {
		g[i].pb(mp(0,0));
		sort(all(g[i]));
		if(g[i].back().f != n)g[i].pb(mp(n,0));
		for(int j = 1;j <= (int)g[i].size();j++) {
			dp[i].pb(0);
			dp1[i].pb(0);
		}
	}
	ll ans = 0;
	for(int i = 1;i < n;i++) {
		ll typ1mx = -LLINF,typ2mx = -LLINF;
		int R = 0;
		ll cur = 0,cur1 = 0;
		for(int j = 0;j < g[i - 1].size();j++) {
			auto to = g[i - 1][j];
			cur1 += to.s;
			while(R < g[i].size() && to.f >= g[i][R].f) {
				cur += g[i][R].s;
				R++;
			}
			typ1mx = max(typ1mx,dp[i - 1][j] + cur);
			typ2mx = max(typ2mx,dp1[i - 1][j] - cur1);
		}
		cur = 0,cur1 = 0;
		R = 0;
		ll tek = 0,sum = 0;
		for(int j = 0;j < g[i].size();j++) {
			auto to = g[i][j];
			while(R < g[i - 1].size() && to.f >= g[i - 1][R].f) {
				if(to.f > g[i - 1][R].f) {
					tek = max(tek,dp[i - 1][R] + sum);
				}else {
					tek = max(tek,dp[i - 1][R] + sum + to.s);
				}
				cur += g[i - 1][R].s;
				R++;
			}
			sum += to.s;
			dp[i][j] = ans;
//			dp1[i][j] = ans;
			dp[i][j] = max(dp[i][j],typ1mx - sum);
			dp[i][j] = max(dp[i][j],typ2mx + cur);
			dp1[i][j] = max(dp1[i][j],typ2mx + cur);
			while(R < g[i - 1].size() && (to.f != n ? g[i][j + 1].f : n + 1) > g[i - 1][R].f) {
				cur += g[i - 1][R].s;
				tek = max(tek,dp[i - 1][R] + sum);
				R++;
			}
			dp1[i][j] = max(dp1[i][j],tek);
		}
//		cout << i << " " << typ1mx << " " << typ2mx << " gooo " << en;
		for(int j = 0;j < g[i].size();j++) {
			ans = max(ans,dp[i][j]);
			ans = max(ans,dp1[i][j]);
//			cout << dp[i][j] << " " << dp1[i][j] << " " << g[i][j].f << en;
		}
//		cout << ans << en;
	}
	return ans;
}

컴파일 시 표준 에러 (stderr) 메시지

fish.cpp: In function 'long long int max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:37:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |   for(int j = 0;j < g[i - 1].size();j++) {
      |                 ~~^~~~~~~~~~~~~~~~~
fish.cpp:40:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |    while(R < g[i].size() && to.f >= g[i][R].f) {
      |          ~~^~~~~~~~~~~~~
fish.cpp:50:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |   for(int j = 0;j < g[i].size();j++) {
      |                 ~~^~~~~~~~~~~~~
fish.cpp:52:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |    while(R < g[i - 1].size() && to.f >= g[i - 1][R].f) {
      |          ~~^~~~~~~~~~~~~~~~~
fish.cpp:67:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |    while(R < g[i - 1].size() && (to.f != n ? g[i][j + 1].f : n + 1) > g[i - 1][R].f) {
      |          ~~^~~~~~~~~~~~~~~~~
fish.cpp:75:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |   for(int j = 0;j < g[i].size();j++) {
      |                 ~~^~~~~~~~~~~~~

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