oj.uz

Submission #629426

# Submission time Handle Problem Language Result Execution time Memory
629426 2022-08-14T13:34:36 Z handlename Catfish Farm (IOI22_fish) C++17
18 / 100
 371 ms 65564 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].erase(unique(whack[i].begin(),whack[i].end()),whack[i].end());
		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 100 ms 31548 KB Output is correct
2 Correct 125 ms 34916 KB Output is correct
3 Correct 36 ms 23724 KB Output is correct
4 Correct 42 ms 23756 KB Output is correct
5 Correct 359 ms 58984 KB Output is correct
6 Correct 371 ms 65564 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 182 ms 38308 KB Output is correct
3 Correct 211 ms 42736 KB Output is correct
4 Correct 101 ms 31620 KB Output is correct
5 Correct 129 ms 34912 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 9684 KB Output is correct
9 Correct 5 ms 9684 KB Output is correct
10 Correct 37 ms 23740 KB Output is correct
11 Correct 36 ms 23772 KB Output is correct
12 Correct 111 ms 31736 KB Output is correct
13 Correct 143 ms 35004 KB Output is correct
14 Correct 108 ms 32432 KB Output is correct
15 Correct 122 ms 32780 KB Output is correct
16 Correct 110 ms 32440 KB Output is correct
17 Correct 128 ms 34636 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 23760 KB Output is correct
2 Correct 36 ms 23760 KB Output is correct
3 Correct 75 ms 26324 KB Output is correct
4 Correct 72 ms 26216 KB Output is correct
5 Correct 110 ms 31360 KB Output is correct
6 Correct 105 ms 31312 KB Output is correct
7 Correct 101 ms 31428 KB Output is correct
8 Correct 99 ms 31340 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 6 ms 9684 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 7 ms 9684 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 9684 KB Output is correct
9 Correct 6 ms 9748 KB Output is correct
10 Correct 6 ms 10000 KB Output is correct
11 Incorrect 6 ms 9684 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 6 ms 9684 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 7 ms 9684 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 9684 KB Output is correct
9 Correct 6 ms 9748 KB Output is correct
10 Correct 6 ms 10000 KB Output is correct
11 Incorrect 6 ms 9684 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 6 ms 9684 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 7 ms 9684 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 9684 KB Output is correct
9 Correct 6 ms 9748 KB Output is correct
10 Correct 6 ms 10000 KB Output is correct
11 Incorrect 6 ms 9684 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 40 ms 23760 KB Output is correct
2 Correct 36 ms 23760 KB Output is correct
3 Correct 75 ms 26324 KB Output is correct
4 Correct 72 ms 26216 KB Output is correct
5 Correct 110 ms 31360 KB Output is correct
6 Correct 105 ms 31312 KB Output is correct
7 Correct 101 ms 31428 KB Output is correct
8 Correct 99 ms 31340 KB Output is correct
9 Correct 113 ms 34880 KB Output is correct
10 Correct 92 ms 27844 KB Output is correct
11 Correct 189 ms 46212 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 5 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 36 ms 23676 KB Output is correct
19 Correct 42 ms 23712 KB Output is correct
20 Correct 37 ms 23764 KB Output is correct
21 Correct 39 ms 23756 KB Output is correct
22 Incorrect 144 ms 36076 KB 1st lines differ - on the 1st token, expected: '45561826463480', found: '45419180086758'
23 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 31548 KB Output is correct
2 Correct 125 ms 34916 KB Output is correct
3 Correct 36 ms 23724 KB Output is correct
4 Correct 42 ms 23756 KB Output is correct
5 Correct 359 ms 58984 KB Output is correct
6 Correct 371 ms 65564 KB Output is correct
7 Correct 5 ms 9684 KB Output is correct
8 Correct 182 ms 38308 KB Output is correct
9 Correct 211 ms 42736 KB Output is correct
10 Correct 101 ms 31620 KB Output is correct
11 Correct 129 ms 34912 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 5 ms 9684 KB Output is correct
16 Correct 37 ms 23740 KB Output is correct
17 Correct 36 ms 23772 KB Output is correct
18 Correct 111 ms 31736 KB Output is correct
19 Correct 143 ms 35004 KB Output is correct
20 Correct 108 ms 32432 KB Output is correct
21 Correct 122 ms 32780 KB Output is correct
22 Correct 110 ms 32440 KB Output is correct
23 Correct 128 ms 34636 KB Output is correct
24 Correct 40 ms 23760 KB Output is correct
25 Correct 36 ms 23760 KB Output is correct
26 Correct 75 ms 26324 KB Output is correct
27 Correct 72 ms 26216 KB Output is correct
28 Correct 110 ms 31360 KB Output is correct
29 Correct 105 ms 31312 KB Output is correct
30 Correct 101 ms 31428 KB Output is correct
31 Correct 99 ms 31340 KB Output is correct
32 Correct 5 ms 9684 KB Output is correct
33 Correct 5 ms 9684 KB Output is correct
34 Correct 6 ms 9684 KB Output is correct
35 Correct 5 ms 9684 KB Output is correct
36 Correct 7 ms 9684 KB Output is correct
37 Correct 5 ms 9684 KB Output is correct
38 Correct 5 ms 9684 KB Output is correct
39 Correct 5 ms 9684 KB Output is correct
40 Correct 6 ms 9748 KB Output is correct
41 Correct 6 ms 10000 KB Output is correct
42 Incorrect 6 ms 9684 KB 1st lines differ - on the 1st token, expected: '278622587073', found: '278080972720'
43 Halted 0 ms 0 KB -