oj.uz

답안 #652443

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
652443 2022-10-22T16:53:37 Z blue 메기 농장 (IOI22_fish) C++17
78 / 100
 1000 ms 73404 KB 
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
 
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using vpii = vector<pii>;
using vvpii = vector<vpii>;
using vi = vector<int>;
using vvi = vector<vi>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
#define sz(x) int(x.size())
 
void selfmax(ll& a, ll b)
{
	a = max(a, b);
}
 
const int maxN = 100'000;
 
vpll fish[1 + maxN];
vll fishpref[1 + maxN];
vll tot(1 + maxN, 0);
 
ll max_weights(int N, int M, vi X, vi Y, vi W)
{
	vvll sm(2, vll(N, 0));
	for(int j = 0; j < M; j++)
		if(X[j] < 2)
			sm[X[j]][Y[j]] += W[j];
 
	if(N == 2)
	{
		return max(sm[0][0] + sm[0][1], sm[1][0] + sm[1][1]);
	}
	
 
	int xmx = 0;
	for(int j = 0; j < M; j++)
	{
		X[j]++;
		xmx = max(xmx, X[j] + 2);
		Y[j]++;
	}
	xmx = min(xmx, N);
 
	// cerr << "xmx = " << xmx << '\n';
 
	vpll fish[1+N];
	vll fishpref[1+N];
 
	vpii fishbyY[1+N];
 
	for(int j = 0; j < M; j++)
	{
		// fish[X[j]].push_back({Y[j], W[j]});
		fishbyY[Y[j]].push_back({X[j], W[j]});
		tot[X[j]] += W[j];
	}
 
	for(int y = 0; y <= N; y++)
		for(pii z : fishbyY[y])
			fish[z.first].push_back({y, z.second});
 
	for(int r = 1; r <= xmx; r++)
	{
		fish[r].push_back({N+1, 0});
		// sort(fish[r].begin(), fish[r].end());
 
		if(fish[r][0].first != 1)
		{
			fish[r].insert(fish[r].begin(), {1, 0});
		}
 
		fishpref[r] = vll(sz(fish[r]));
		for(int i = 0; i < sz(fishpref[r]); i++)
		{
			fishpref[r][i] = (i == 0 ? 0 : fishpref[r][i-1]) + fish[r][i].second;
		}
	}
 
	fish[0] = vpll{{0, 0}};
	fishpref[0] = vll{0};
 
	vvll inc(1+N), dec(1+N);
	vvll incpref(1+N), decpref(1+N); //pref inc dec mx
	inc[0] = dec[0] = vll{0};
 
	// cerr << "done\n";
 
	for(int r = 1; r <= xmx; r++)
	{
		incpref[r-1] = inc[r-1];
		decpref[r-1] = dec[r-1];
		for(int i = 1; i < sz(fish[r-1]); i++)
		{
			incpref[r-1][i] = max(incpref[r-1][i-1], inc[r-1][i]);
			decpref[r-1][i] = max(decpref[r-1][i-1], dec[r-1][i]);
		}
 
 
		inc[r] = dec[r] = vll(sz(fish[r]), 0);
 
 
 
 
 
 
		vll Csuff;
		if(r >= 2)
		{
			Csuff = vll(sz(fish[r-2]));
 
			int pi = sz(fish[r-1])-1;
			ll pwt = tot[r-1];
 
			for(int j = sz(fish[r-2])-1; j >= 0; j--)
			{
				while(pi >= 0 && fish[r-1][pi].first > fish[r-2][j].first - 1)
				{
					pwt -= fish[r-1][pi].second;
					pi--;
				}
 
				// Csuff[j] = max(inc[r-2][j], dec[r-2][j]) + htwt(r-1, fish[r-2][j].first - 1);
				Csuff[j] = max(inc[r-2][j], dec[r-2][j]) + pwt;
				if(j+1 < sz(fish[r-2]))
					selfmax(Csuff[j], Csuff[j+1]);
			}
		}
 
 
		ll Dmx = 0;
		ll Did = -1;
 
		int ppi = -1;
 		int qi = -1;
 		ll qwt = 0;
 
		for(int i = 0; i < sz(fish[r]); i++)
		{
			ll basic = 0;
 
			ll Bcatch = 0;
			int Bk = -1;
 
			while(qi+1 < sz(fish[r-1]) && fish[r-1][qi+1].first <= fish[r][i].first - 1)
			{
				qi++;
				qwt += fish[r-1][qi].second;
			}
			ll prevpwt = qwt;
 
			ll constD = -(tot[r-1] - prevpwt) + tot[r-1];
 
			if(r >= 2)
			{
				//A
				selfmax(basic, max(inc[r-2][0], dec[r-2][0]) + prevpwt);
 
 
 
 
 				while(ppi+1 < sz(fish[r-2]) && fish[r-2][ppi+1].first <= fish[r][i].first)
 					ppi++;
				int ploci = ppi;
 
				while(Bk+1 < sz(fish[r-1]) && fish[r-1][Bk+1].first <= fish[r][i].first - 1)
				{
					Bk++;
					Bcatch += fish[r-1][Bk].second;
				}
				selfmax(basic, Bcatch + max(incpref[r-2][ploci], decpref[r-2][ploci]));
	
				if(ploci+1 < sz(fish[r-2]))
				{
					// cerr << ploci << " : " << sz(fish[r-2]) << '\n';
					selfmax(basic, Csuff[ploci+1]);
				}
			}
 
			selfmax(inc[r][i], basic);
			selfmax(dec[r][i], basic);
 
			//type D transition
 
			while(Did+1 < sz(fish[r-1]) && fish[r-1][Did+1].first <= fish[r][i].first)
			{
				Did++;
				Dmx = max(Dmx, inc[r-1][Did] - (Did >= 1 ? fishpref[r-1][Did-1] : 0));
			}
 
			selfmax(inc[r][i], Dmx + constD);
			selfmax(dec[r][i], Dmx + constD);
 
		}
 
		int j = sz(fish[r-1]);
		ll bestval = -1'000'000'000'000'000'000LL;
 
		int ri = sz(fish[r]);
		ll rwt = 0;
 
 
		for(int i = sz(fish[r])-1; i >= 0; i--)
		{
 			while(j-1 >= 0 && fish[r-1][j-1].first > fish[r][i].first)
 			{
 				j--;
 				while(ri-1 >= 0 && fish[r][ri-1].first >= fish[r-1][j].first)
 				{
 					ri--;
 					rwt += fish[r][ri].second;
 				}
 				bestval = max(bestval, dec[r-1][j] + tot[r] - rwt);
 			}
 
 			selfmax(dec[r][i], bestval - (i >= 1 ? fishpref[r][i-1] : 0));
		}
	}
 
	ll res = 0;
	for(vll x : inc)
		for(ll y : x)
			res = max(res, y);
	for(vll x : dec)
		for(ll y : x)
			res = max(res, y);
 
	return res;
}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 31364 KB Output is correct
2 Correct 79 ms 35512 KB Output is correct
3 Correct 14 ms 23776 KB Output is correct
4 Correct 14 ms 23688 KB Output is correct
5 Correct 244 ms 71832 KB Output is correct
6 Correct 325 ms 73404 KB Output is correct

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5716 KB Output is correct
2 Execution timed out 1087 ms 36096 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 23744 KB Output is correct
2 Correct 74 ms 44020 KB Output is correct
3 Correct 84 ms 41768 KB Output is correct
4 Correct 95 ms 43148 KB Output is correct
5 Correct 122 ms 47268 KB Output is correct
6 Correct 115 ms 47184 KB Output is correct
7 Correct 124 ms 47192 KB Output is correct
8 Correct 117 ms 47288 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5716 KB Output is correct
2 Correct 3 ms 5716 KB Output is correct
3 Correct 3 ms 5716 KB Output is correct
4 Correct 3 ms 5716 KB Output is correct
5 Correct 4 ms 5716 KB Output is correct
6 Correct 3 ms 5716 KB Output is correct
7 Correct 3 ms 5716 KB Output is correct
8 Correct 3 ms 5716 KB Output is correct
9 Correct 3 ms 5844 KB Output is correct
10 Correct 5 ms 6100 KB Output is correct
11 Correct 4 ms 5844 KB Output is correct
12 Correct 4 ms 5972 KB Output is correct
13 Correct 3 ms 5716 KB Output is correct
14 Correct 4 ms 5972 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5716 KB Output is correct
2 Correct 3 ms 5716 KB Output is correct
3 Correct 3 ms 5716 KB Output is correct
4 Correct 3 ms 5716 KB Output is correct
5 Correct 4 ms 5716 KB Output is correct
6 Correct 3 ms 5716 KB Output is correct
7 Correct 3 ms 5716 KB Output is correct
8 Correct 3 ms 5716 KB Output is correct
9 Correct 3 ms 5844 KB Output is correct
10 Correct 5 ms 6100 KB Output is correct
11 Correct 4 ms 5844 KB Output is correct
12 Correct 4 ms 5972 KB Output is correct
13 Correct 3 ms 5716 KB Output is correct
14 Correct 4 ms 5972 KB Output is correct
15 Correct 3 ms 5844 KB Output is correct
16 Correct 4 ms 5972 KB Output is correct
17 Correct 25 ms 10096 KB Output is correct
18 Correct 24 ms 10680 KB Output is correct
19 Correct 23 ms 10612 KB Output is correct
20 Correct 27 ms 10572 KB Output is correct
21 Correct 26 ms 10544 KB Output is correct
22 Correct 64 ms 15220 KB Output is correct
23 Correct 8 ms 6776 KB Output is correct
24 Correct 17 ms 8660 KB Output is correct
25 Correct 4 ms 5972 KB Output is correct
26 Correct 7 ms 6612 KB Output is correct

Subtask #6
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5716 KB Output is correct
2 Correct 3 ms 5716 KB Output is correct
3 Correct 3 ms 5716 KB Output is correct
4 Correct 3 ms 5716 KB Output is correct
5 Correct 4 ms 5716 KB Output is correct
6 Correct 3 ms 5716 KB Output is correct
7 Correct 3 ms 5716 KB Output is correct
8 Correct 3 ms 5716 KB Output is correct
9 Correct 3 ms 5844 KB Output is correct
10 Correct 5 ms 6100 KB Output is correct
11 Correct 4 ms 5844 KB Output is correct
12 Correct 4 ms 5972 KB Output is correct
13 Correct 3 ms 5716 KB Output is correct
14 Correct 4 ms 5972 KB Output is correct
15 Correct 3 ms 5844 KB Output is correct
16 Correct 4 ms 5972 KB Output is correct
17 Correct 25 ms 10096 KB Output is correct
18 Correct 24 ms 10680 KB Output is correct
19 Correct 23 ms 10612 KB Output is correct
20 Correct 27 ms 10572 KB Output is correct
21 Correct 26 ms 10544 KB Output is correct
22 Correct 64 ms 15220 KB Output is correct
23 Correct 8 ms 6776 KB Output is correct
24 Correct 17 ms 8660 KB Output is correct
25 Correct 4 ms 5972 KB Output is correct
26 Correct 7 ms 6612 KB Output is correct
27 Correct 7 ms 7124 KB Output is correct
28 Correct 124 ms 28276 KB Output is correct
29 Correct 309 ms 35180 KB Output is correct
30 Correct 153 ms 35020 KB Output is correct
31 Correct 172 ms 34896 KB Output is correct
32 Correct 163 ms 37576 KB Output is correct
33 Correct 148 ms 34960 KB Output is correct
34 Correct 151 ms 34872 KB Output is correct
35 Correct 61 ms 17908 KB Output is correct
36 Correct 153 ms 35924 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 23744 KB Output is correct
2 Correct 74 ms 44020 KB Output is correct
3 Correct 84 ms 41768 KB Output is correct
4 Correct 95 ms 43148 KB Output is correct
5 Correct 122 ms 47268 KB Output is correct
6 Correct 115 ms 47184 KB Output is correct
7 Correct 124 ms 47192 KB Output is correct
8 Correct 117 ms 47288 KB Output is correct
9 Correct 144 ms 52660 KB Output is correct
10 Correct 90 ms 30260 KB Output is correct
11 Correct 182 ms 54592 KB Output is correct
12 Correct 3 ms 5716 KB Output is correct
13 Correct 3 ms 5716 KB Output is correct
14 Correct 3 ms 5716 KB Output is correct
15 Correct 3 ms 5716 KB Output is correct
16 Correct 3 ms 5716 KB Output is correct
17 Correct 3 ms 5716 KB Output is correct
18 Correct 16 ms 23748 KB Output is correct
19 Correct 17 ms 23684 KB Output is correct
20 Correct 79 ms 44124 KB Output is correct
21 Correct 69 ms 44016 KB Output is correct
22 Correct 164 ms 53260 KB Output is correct
23 Correct 203 ms 60988 KB Output is correct
24 Correct 175 ms 62388 KB Output is correct

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 31364 KB Output is correct
2 Correct 79 ms 35512 KB Output is correct
3 Correct 14 ms 23776 KB Output is correct
4 Correct 14 ms 23688 KB Output is correct
5 Correct 244 ms 71832 KB Output is correct
6 Correct 325 ms 73404 KB Output is correct
7 Correct 3 ms 5716 KB Output is correct
8 Execution timed out 1087 ms 36096 KB Time limit exceeded
9 Halted 0 ms 0 KB -