oj.uz

Submission #629423

# Submission time Handle Problem Language Result Execution time Memory
629423 2022-08-14T13:32:29 Z handlename Catfish Farm (IOI22_fish) C++17
18 / 100
 433 ms 76672 KB 
#include <bits/stdc++.h>
//#include "fish.h"
using namespace std;
#define pb push_back
#define mp make_pair
 
vector<pair<int,long long> > arr[100005];
long long qry(int col,int height){ //prefixsum of col to height
	if (arr[col].empty()) return 0;
	pair<int,long long> lol=mp(height,1e18);
	int pos=upper_bound(arr[col].begin(),arr[col].end(),lol)-arr[col].begin();
	pos--;
	return arr[col][pos].second;
}
vector<long long> dp1[100005]; //col,height,increasing
vector<long long> dp2[100005]; //col,height,decreasing
vector<long long> whack[100005];
long long max_weights(int n,int m,vector<int> x,vector<int> y,vector<int> w){
	for (int i=0;i<m;i++){
		x[i]++;
		y[i]++;
		arr[x[i]].pb(mp(y[i],w[i]));
	}
	for (int i=1;i<=n;i++){
		arr[i].pb(mp(0,0));
		sort(arr[i].begin(),arr[i].end());
		for (int j=1;j<(int)arr[i].size();j++){
			arr[i][j].second+=arr[i][j-1].second;
		}
		for (auto j:arr[i]){
			whack[i].pb(j.first);
			if (j.first>0) whack[i].pb(j.first-1);
			whack[i+1].pb(j.first);
			whack[i-1].pb(j.first);
		}
	}
	for (int i=0;i<=n;i++){
		sort(whack[i].begin(),whack[i].end());
		whack[i].resize(unique(whack[i].begin(),whack[i].end())-whack[i].begin());
		for (int j=0;j<(int) whack[i].size();j++){
			dp1[i].pb(0);
			dp2[i].pb(0);
		}
	}
	for (int i=1;i<=n;i++){ //col
		long long maxi=0,id=0;
		for (int j=0;j<(int)whack[i].size();j++){
			int k=whack[i][j];
			while (id<(int)whack[i-1].size() && whack[i-1][id]<=k){
				maxi=max(maxi,dp1[i-1][id]-qry(i,whack[i-1][id])-qry(i-1,whack[i-1][id]));
				id++;
			}
			dp1[i][j]=maxi+qry(i-1,k)+qry(i+1,k);
		}
		/*
		for (int j=0;j<=n;j++){
			maxi=max(maxi,dp1[i-1][j]-qry(i,j)-qry(i-1,j));
			if (i>=2){
				maxi=max(maxi,dp2[i-2][j]-qry(i-1,j));
			}
			dp1[i][j]=maxi+qry(i-1,j)+qry(i+1,j);
		}
		*/
		
		if (i>=2){
			maxi=0;
			id=whack[i-2].size()-1;
			for (int j=whack[i].size()-1;j>=0;j--){
				int k=whack[i][j];
				while (id>=0 && whack[i-2][id]>=k){
					maxi=max(maxi,dp2[i-2][id]);
					id--;
				}
				dp1[i][j]=max(dp1[i][j],maxi+qry(i+1,k));
			}
			/*
			for (int j=n;j>=0;j--){
				maxi=max(maxi,dp2[i-2][j]);
				dp1[i][j]=max(dp1[i][j],maxi+qry(i+1,j));
			}
			*/
		}
		
		maxi=0;
		id=whack[i-1].size()-1;
		for (int j=whack[i].size()-1;j>=0;j--){
			int k=whack[i][j];
			while (id>=0 && whack[i-1][id]>=k){
				maxi=max(maxi,dp2[i-1][id]);
				id--;
			}
			dp2[i][j]=maxi+qry(i+1,k)-qry(i,k);
		}
		/*
		for (int j=n;j>=0;j--){
			maxi=max(maxi,dp2[i-1][j]);
			dp2[i][j]=maxi+qry(i+1,j)-qry(i,j);
		}
		*/
		for (int j=0;j<(int)whack[i].size();j++){
			dp2[i][j]=max(dp2[i][j],dp1[i][j]);
		}
	}
	long long ans=0;
	for (int j=0;j<(int)dp2[n].size();j++){
		ans=max(ans,dp2[n][j]);
	}
	return ans;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 32388 KB Output is correct
2 Correct 150 ms 35828 KB Output is correct
3 Correct 43 ms 23676 KB Output is correct
4 Correct 37 ms 23688 KB Output is correct
5 Correct 382 ms 61948 KB Output is correct
6 Correct 433 ms 76672 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9684 KB Output is correct
2 Correct 189 ms 39556 KB Output is correct
3 Correct 218 ms 44560 KB Output is correct
4 Correct 119 ms 32392 KB Output is correct
5 Correct 138 ms 35828 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 5 ms 9684 KB Output is correct
8 Correct 5 ms 9700 KB Output is correct
9 Correct 5 ms 9684 KB Output is correct
10 Correct 40 ms 23692 KB Output is correct
11 Correct 49 ms 23756 KB Output is correct
12 Correct 128 ms 32340 KB Output is correct
13 Correct 159 ms 35836 KB Output is correct
14 Correct 116 ms 33076 KB Output is correct
15 Correct 126 ms 33508 KB Output is correct
16 Correct 136 ms 33244 KB Output is correct
17 Correct 135 ms 35556 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 23672 KB Output is correct
2 Correct 43 ms 23708 KB Output is correct
3 Correct 82 ms 26308 KB Output is correct
4 Correct 68 ms 26352 KB Output is correct
5 Correct 127 ms 31348 KB Output is correct
6 Correct 98 ms 31352 KB Output is correct
7 Correct 107 ms 31340 KB Output is correct
8 Correct 101 ms 31356 KB Output is correct

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 5 ms 9700 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 5 ms 9632 KB Output is correct
8 Correct 5 ms 9684 KB Output is correct
9 Correct 8 ms 9728 KB Output is correct
10 Correct 7 ms 10068 KB Output is correct
11 Incorrect 6 ms 9812 KB 1st lines differ - on the 1st token, expected: '278622587073', found: '278080972720'
12 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 5 ms 9700 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 5 ms 9632 KB Output is correct
8 Correct 5 ms 9684 KB Output is correct
9 Correct 8 ms 9728 KB Output is correct
10 Correct 7 ms 10068 KB Output is correct
11 Incorrect 6 ms 9812 KB 1st lines differ - on the 1st token, expected: '278622587073', found: '278080972720'
12 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 5 ms 9700 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 5 ms 9632 KB Output is correct
8 Correct 5 ms 9684 KB Output is correct
9 Correct 8 ms 9728 KB Output is correct
10 Correct 7 ms 10068 KB Output is correct
11 Incorrect 6 ms 9812 KB 1st lines differ - on the 1st token, expected: '278622587073', found: '278080972720'
12 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 23672 KB Output is correct
2 Correct 43 ms 23708 KB Output is correct
3 Correct 82 ms 26308 KB Output is correct
4 Correct 68 ms 26352 KB Output is correct
5 Correct 127 ms 31348 KB Output is correct
6 Correct 98 ms 31352 KB Output is correct
7 Correct 107 ms 31340 KB Output is correct
8 Correct 101 ms 31356 KB Output is correct
9 Correct 121 ms 34928 KB Output is correct
10 Correct 90 ms 27980 KB Output is correct
11 Correct 162 ms 46340 KB Output is correct
12 Correct 5 ms 9684 KB Output is correct
13 Correct 5 ms 9684 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 7 ms 9684 KB Output is correct
16 Correct 5 ms 9684 KB Output is correct
17 Correct 5 ms 9684 KB Output is correct
18 Correct 39 ms 23756 KB Output is correct
19 Correct 38 ms 23768 KB Output is correct
20 Correct 37 ms 23756 KB Output is correct
21 Correct 37 ms 23676 KB Output is correct
22 Incorrect 161 ms 39532 KB 1st lines differ - on the 1st token, expected: '45561826463480', found: '45439909458545'
23 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 32388 KB Output is correct
2 Correct 150 ms 35828 KB Output is correct
3 Correct 43 ms 23676 KB Output is correct
4 Correct 37 ms 23688 KB Output is correct
5 Correct 382 ms 61948 KB Output is correct
6 Correct 433 ms 76672 KB Output is correct
7 Correct 7 ms 9684 KB Output is correct
8 Correct 189 ms 39556 KB Output is correct
9 Correct 218 ms 44560 KB Output is correct
10 Correct 119 ms 32392 KB Output is correct
11 Correct 138 ms 35828 KB Output is correct
12 Correct 5 ms 9684 KB Output is correct
13 Correct 5 ms 9684 KB Output is correct
14 Correct 5 ms 9700 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct
16 Correct 40 ms 23692 KB Output is correct
17 Correct 49 ms 23756 KB Output is correct
18 Correct 128 ms 32340 KB Output is correct
19 Correct 159 ms 35836 KB Output is correct
20 Correct 116 ms 33076 KB Output is correct
21 Correct 126 ms 33508 KB Output is correct
22 Correct 136 ms 33244 KB Output is correct
23 Correct 135 ms 35556 KB Output is correct
24 Correct 41 ms 23672 KB Output is correct
25 Correct 43 ms 23708 KB Output is correct
26 Correct 82 ms 26308 KB Output is correct
27 Correct 68 ms 26352 KB Output is correct
28 Correct 127 ms 31348 KB Output is correct
29 Correct 98 ms 31352 KB Output is correct
30 Correct 107 ms 31340 KB Output is correct
31 Correct 101 ms 31356 KB Output is correct
32 Correct 5 ms 9684 KB Output is correct
33 Correct 5 ms 9684 KB Output is correct
34 Correct 5 ms 9684 KB Output is correct
35 Correct 5 ms 9700 KB Output is correct
36 Correct 5 ms 9684 KB Output is correct
37 Correct 5 ms 9684 KB Output is correct
38 Correct 5 ms 9632 KB Output is correct
39 Correct 5 ms 9684 KB Output is correct
40 Correct 8 ms 9728 KB Output is correct
41 Correct 7 ms 10068 KB Output is correct
42 Incorrect 6 ms 9812 KB 1st lines differ - on the 1st token, expected: '278622587073', found: '278080972720'
43 Halted 0 ms 0 KB -