oj.uz

Submission #659489

# Submission time Handle Problem Language Result Execution time Memory
659489 2022-11-18T00:40:16 Z pere_gil Catfish Farm (IOI22_fish) C++17
61 / 100
 866 ms 2097152 KB 
#include "fish.h"
#include "bits/stdc++.h"
using namespace std;
                 
typedef long long ll;
#define all(x) x.begin(),x.end()
     
void fill(vector<ll> &pier, vector<ll> &fish, vector<ll> &v){
	for(int i=0,j=0;i<(int)pier.size();)
		if(j==(int)fish.size()-1 || (pier[i]>=fish[j] && pier[i]<fish[j+1]))
			v[i++]=j;
		else
			j++;
}
     
ll max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w){
	vector<ll> sum[n],fish[n],temp_pier[n],pier[n];
	vector<pair<ll,ll>> inf_fish[n];
	for(int i=0;i<m;i++) inf_fish[x[i]].push_back({y[i]+1,w[i]});
	for(int i=0;i<n;i++){
		sum[i].push_back(0); fish[i].push_back(0); temp_pier[i].push_back(0);
     
		sort(all(inf_fish[i]));
    		
		for(int j=0;j<(int)inf_fish[i].size();j++){
			fish[i].push_back(inf_fish[i][j].first);
			sum[i].push_back(inf_fish[i][j].second);
			if(i) temp_pier[i-1].push_back(inf_fish[i][j].first);
			if(i!=n-1) temp_pier[i+1].push_back(inf_fish[i][j].first);
		}
	}
	for(int i=0;i<n;i++){
		sort(all(temp_pier[i]));
		pier[i].push_back(temp_pier[i][0]);
		for(int j=1;j<(int)temp_pier[i].size();j++)
			if(temp_pier[i][j]!=temp_pier[i][j-1])
				pier[i].push_back(temp_pier[i][j]);
     
		for(int j=1;j<(int)fish[i].size();j++)
			sum[i][j]+=sum[i][j-1];
	}
	vector<ll> left[n],me[n],right[n];
	for(int i=0;i<n;i++){
		left[i].assign(pier[i].size(),0);
		me[i].assign(pier[i].size(),0);
		right[i].assign(pier[i].size(),0);
     
		if(i) fill(pier[i],fish[i-1],left[i]);
		fill(pier[i],fish[i],me[i]);
		if(i!=n-1) fill(pier[i],fish[i+1],right[i]);
	}
    	
	vector<vector<ll>> dec[n],inc[n];
	for(int i=0;i<n;i++){
		int j=(i) ? pier[i-1].size() : 1;
		int k=pier[i].size();
		dec[i].assign(j,vector<ll>(k,0));
		inc[i].assign(j,vector<ll>(k,0));
	}
     
	for(int i=0;i<(int)pier[0].size();i++)
		for(int j=0;j<(int)pier[1].size();j++){
			ll aux=0;
			if(pier[0][i]>=pier[1][j])
				aux+=sum[1][right[0][i]]-sum[1][me[1][j]];
			else
				aux+=sum[0][left[1][j]]-sum[0][me[0][i]];
			dec[1][i][j]=inc[1][i][j]=aux;
		}
     
	for(int i=2;i<n;i++){
		for(int j=0;j<(int)pier[i-1].size();j++){
     
			//decreasing:
			if(pier[i-1][j]){
				ll prev=0;
				for(int k=0;k<(int)pier[i-2].size();k++){
					if(pier[i-2][k]<pier[i-1][j]) continue;
					prev=max(prev,max(dec[i-1][k][j],inc[i-1][k][j]));
				}
				for(int k=0;k<(int)pier[i].size();k++){
					if(pier[i][k]>pier[i-1][j]) break;
					dec[i][j][k]+=prev;
					dec[i][j][k]+=sum[i][right[i-1][j]]-sum[i][me[i][k]];
				}
			}
			else{
				ll prev=0;
				int pos=0;
				for(int k=0;k<(int)pier[i-2].size();k++){
					ll aux=max(dec[i-1][k][j],inc[i-1][k][j]);
					if(aux>=prev){
						prev=aux;
						pos=k;
					}
				}
				for(int k=0;k<(int)pier[i].size();k++){
					dec[i][j][k]+=prev;
					if(pier[i][k]<pier[i-2][pos]) continue;
					dec[i][j][k]+=sum[i-1][left[i][k]]-sum[i-1][right[i-2][pos]];
				}
			}
     
			//increasing:
			ll prev=0;
			for(int k=0;k<(int)pier[i-2].size();k++){
				if(pier[i-2][k]>pier[i-1][j]) break;
				prev=max(prev,inc[i-1][k][j]);
				if(!pier[i-2][k]) prev=max(prev,dec[i-1][k][j]);
			}
			for(int k=0;k<(int)pier[i].size();k++){
				inc[i][j][k]+=prev;
				if(pier[i-1][j]>=pier[i][k])
					inc[i][j][k]+=sum[i][right[i-1][j]]-sum[i][me[i][k]];
				else
					inc[i][j][k]+=sum[i-1][left[i][k]]-sum[i-1][me[i-1][j]];
			}
		}
	}

	ll res=0;
	for(int i=0;i<(int)pier[n-2].size();i++)
		for(int j=0;j<(int)pier[n-1].size();j++)
			res=max({res,dec[n-1][i][j],inc[n-1][i][j]});
	
	return res;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 71852 KB Output is correct
2 Correct 146 ms 82124 KB Output is correct
3 Correct 83 ms 58108 KB Output is correct
4 Correct 84 ms 58232 KB Output is correct
5 Correct 335 ms 181104 KB Output is correct
6 Correct 497 ms 183956 KB Output is correct

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Runtime error 866 ms 2097152 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 58136 KB Output is correct
2 Correct 85 ms 58168 KB Output is correct
3 Correct 134 ms 64360 KB Output is correct
4 Correct 131 ms 66272 KB Output is correct
5 Correct 182 ms 78560 KB Output is correct
6 Correct 177 ms 78556 KB Output is correct
7 Correct 179 ms 78428 KB Output is correct
8 Correct 183 ms 78560 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 296 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 432 KB Output is correct
10 Correct 3 ms 1236 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 2 ms 980 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 772 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 296 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 432 KB Output is correct
10 Correct 3 ms 1236 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 2 ms 980 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 772 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 5 ms 3772 KB Output is correct
17 Correct 251 ms 259120 KB Output is correct
18 Correct 231 ms 243248 KB Output is correct
19 Correct 172 ms 169260 KB Output is correct
20 Correct 128 ms 122496 KB Output is correct
21 Correct 123 ms 117032 KB Output is correct
22 Correct 431 ms 443716 KB Output is correct
23 Correct 25 ms 18800 KB Output is correct
24 Correct 151 ms 139756 KB Output is correct
25 Correct 2 ms 980 KB Output is correct
26 Correct 18 ms 15160 KB Output is correct

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 296 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 432 KB Output is correct
10 Correct 3 ms 1236 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 2 ms 980 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 772 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 5 ms 3772 KB Output is correct
17 Correct 251 ms 259120 KB Output is correct
18 Correct 231 ms 243248 KB Output is correct
19 Correct 172 ms 169260 KB Output is correct
20 Correct 128 ms 122496 KB Output is correct
21 Correct 123 ms 117032 KB Output is correct
22 Correct 431 ms 443716 KB Output is correct
23 Correct 25 ms 18800 KB Output is correct
24 Correct 151 ms 139756 KB Output is correct
25 Correct 2 ms 980 KB Output is correct
26 Correct 18 ms 15160 KB Output is correct
27 Correct 5 ms 2900 KB Output is correct
28 Runtime error 826 ms 2097152 KB Execution killed with signal 9
29 Halted 0 ms 0 KB -

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 58136 KB Output is correct
2 Correct 85 ms 58168 KB Output is correct
3 Correct 134 ms 64360 KB Output is correct
4 Correct 131 ms 66272 KB Output is correct
5 Correct 182 ms 78560 KB Output is correct
6 Correct 177 ms 78556 KB Output is correct
7 Correct 179 ms 78428 KB Output is correct
8 Correct 183 ms 78560 KB Output is correct
9 Correct 202 ms 88748 KB Output is correct
10 Correct 132 ms 49716 KB Output is correct
11 Correct 275 ms 102672 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 85 ms 58196 KB Output is correct
19 Correct 85 ms 58108 KB Output is correct
20 Correct 86 ms 58276 KB Output is correct
21 Correct 88 ms 58188 KB Output is correct
22 Correct 263 ms 94172 KB Output is correct
23 Correct 366 ms 134748 KB Output is correct
24 Correct 361 ms 142668 KB Output is correct

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 71852 KB Output is correct
2 Correct 146 ms 82124 KB Output is correct
3 Correct 83 ms 58108 KB Output is correct
4 Correct 84 ms 58232 KB Output is correct
5 Correct 335 ms 181104 KB Output is correct
6 Correct 497 ms 183956 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Runtime error 866 ms 2097152 KB Execution killed with signal 9
9 Halted 0 ms 0 KB -