oj.uz

답안 #630658

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
630658 2022-08-16T20:34:09 Z CSQ31 메기 농장 (IOI22_fish) C++17
18 / 100
 364 ms 87408 KB 
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> pii;
#define fi first
#define se second
#define sz(a) (int)(a.size())
//0 -> previous is lower
//1 -> previous is higher
const int MAXN = 111111;
vector<int>st[MAXN];
vector<pii>fish[MAXN];
vector<ll>dp[2][MAXN],pre[3][MAXN];
int cnt[MAXN];
const ll INF = -1e17;
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]++;
		fish[X[i]].push_back({Y[i],i});
	}
	for(int i=1;i<=n;i++)sort(fish[i].begin(),fish[i].end());
	for(int i=0;i<=n;i++){
		vector<pii>f;
		st[i].push_back(0);
		if(i){
			for(auto x:fish[i-1]){
				st[i].push_back(x.fi);
				f.push_back(x);
			}
		}
		for(auto x:fish[i]){
			st[i].push_back(x.fi);
			f.push_back(x);
		}
		for(auto x:fish[i+1]){
			st[i].push_back(x.fi);
			f.push_back(x);
		}
		sort(st[i].begin(),st[i].end());
		sort(f.begin(),f.end());
		st[i].resize(unique(st[i].begin(),st[i].end()) - st[i].begin());
		cnt[i] = st[i].size();
		for(int k=0;k<3;k++)pre[k][i].assign(cnt[i],0);
		for(int k=0;k<2;k++)dp[k][i].assign(cnt[i],INF);
		int ptr = -1;
		for(int j=0;j<cnt[i];j++){
			while(ptr+1<sz(fish[i]) && fish[i][ptr+1].fi <= st[i][j]){
				ptr++;
				pre[1][i][j]+=W[fish[i][ptr].se];
			}
		}
		ptr = -1;
		for(int j=0;j<cnt[i];j++){
			while(ptr+1<sz(fish[i+1]) && fish[i+1][ptr+1].fi <= st[i][j]){
				ptr++;
				pre[2][i][j]+=W[fish[i+1][ptr].se];
			}
		}
		if(i){
			ptr = -1;
			for(int j=0;j<cnt[i];j++){
				while(ptr+1<sz(fish[i-1]) && fish[i-1][ptr+1].fi <= st[i][j]){
					ptr++;
					pre[0][i][j]+=W[fish[i-1][ptr].se];
				}
			}
		}
		for(int k=0;k<3;k++){
			for(int j=1;j<cnt[i];j++)pre[k][i][j]+=pre[k][i][j-1];
		}
	}
	dp[0][0][0] = 0;
	for(int i=1;i<=n;i++){
		ll mx = INF;
		int ptr = -1;
		for(int j=0;j<cnt[i];j++){
			while(ptr+1<cnt[i-1] && st[i-1][ptr+1] <= st[i][j]){
				ptr++;
				mx = max(mx,dp[0][i-1][ptr] - pre[1][i-1][ptr]);
			}
			dp[0][i][j] = max(dp[0][i][j],mx + pre[0][i][j]);
		}
		mx = INF;
		ptr = cnt[i-1];
		for(int j=cnt[i]-1;j>=0;j--){
			while(ptr-1>=0 && st[i-1][ptr-1] >= st[i][j]){
				ptr--;
				mx = max(mx,dp[0][i-1][ptr] + pre[2][i-1][ptr]);
				mx = max(mx,dp[1][i-1][ptr] + pre[2][i-1][ptr]);
			}
			dp[1][i][j] = max(dp[1][i][j],mx - pre[1][i][j]);	
		}
		if(i<2)continue;
		mx = INF;
		ptr = -1;
		for(int j=0;j<cnt[i];j++){
			while(ptr+1 < cnt[i-2] && st[i-2][ptr+1] <= st[i][j]){
				ptr++;
				mx = max(mx,dp[0][i-2][ptr]);
				mx = max(mx,dp[1][i-2][ptr]);
			}
			dp[0][i][j] = max(dp[0][i][j],mx + pre[0][i][j]);
		}
	}
  ll ans = 0;
  for(ll x:dp[0][n])ans = max(ans,x);
  for(ll x:dp[1][n])ans = max(ans,x);
  return ans;
}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 93 ms 49316 KB Output is correct
2 Correct 128 ms 54056 KB Output is correct
3 Correct 50 ms 37696 KB Output is correct
4 Correct 43 ms 37648 KB Output is correct
5 Correct 230 ms 87408 KB Output is correct
6 Correct 364 ms 81848 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 18576 KB Output is correct
2 Correct 186 ms 56808 KB Output is correct
3 Correct 224 ms 62420 KB Output is correct
4 Correct 100 ms 49352 KB Output is correct
5 Correct 113 ms 54080 KB Output is correct
6 Correct 10 ms 18516 KB Output is correct
7 Correct 10 ms 18524 KB Output is correct
8 Correct 9 ms 18540 KB Output is correct
9 Correct 9 ms 18516 KB Output is correct
10 Correct 47 ms 37684 KB Output is correct
11 Correct 49 ms 37732 KB Output is correct
12 Correct 122 ms 49416 KB Output is correct
13 Correct 116 ms 54168 KB Output is correct
14 Correct 100 ms 49068 KB Output is correct
15 Correct 126 ms 49148 KB Output is correct
16 Correct 107 ms 49088 KB Output is correct
17 Correct 108 ms 52160 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 37664 KB Output is correct
2 Correct 42 ms 37648 KB Output is correct
3 Correct 81 ms 38672 KB Output is correct
4 Correct 69 ms 39620 KB Output is correct
5 Correct 107 ms 43124 KB Output is correct
6 Correct 105 ms 43124 KB Output is correct
7 Correct 115 ms 43128 KB Output is correct
8 Correct 112 ms 43352 KB Output is correct

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 18516 KB Output is correct
2 Correct 10 ms 18516 KB Output is correct
3 Correct 10 ms 18484 KB Output is correct
4 Correct 11 ms 18576 KB Output is correct
5 Correct 10 ms 18516 KB Output is correct
6 Correct 10 ms 18516 KB Output is correct
7 Correct 13 ms 18572 KB Output is correct
8 Correct 10 ms 18516 KB Output is correct
9 Correct 10 ms 18644 KB Output is correct
10 Correct 10 ms 18772 KB Output is correct
11 Incorrect 10 ms 18644 KB 1st lines differ - on the 1st token, expected: '278622587073', found: '278441359083'
12 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 18516 KB Output is correct
2 Correct 10 ms 18516 KB Output is correct
3 Correct 10 ms 18484 KB Output is correct
4 Correct 11 ms 18576 KB Output is correct
5 Correct 10 ms 18516 KB Output is correct
6 Correct 10 ms 18516 KB Output is correct
7 Correct 13 ms 18572 KB Output is correct
8 Correct 10 ms 18516 KB Output is correct
9 Correct 10 ms 18644 KB Output is correct
10 Correct 10 ms 18772 KB Output is correct
11 Incorrect 10 ms 18644 KB 1st lines differ - on the 1st token, expected: '278622587073', found: '278441359083'
12 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 18516 KB Output is correct
2 Correct 10 ms 18516 KB Output is correct
3 Correct 10 ms 18484 KB Output is correct
4 Correct 11 ms 18576 KB Output is correct
5 Correct 10 ms 18516 KB Output is correct
6 Correct 10 ms 18516 KB Output is correct
7 Correct 13 ms 18572 KB Output is correct
8 Correct 10 ms 18516 KB Output is correct
9 Correct 10 ms 18644 KB Output is correct
10 Correct 10 ms 18772 KB Output is correct
11 Incorrect 10 ms 18644 KB 1st lines differ - on the 1st token, expected: '278622587073', found: '278441359083'
12 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 37664 KB Output is correct
2 Correct 42 ms 37648 KB Output is correct
3 Correct 81 ms 38672 KB Output is correct
4 Correct 69 ms 39620 KB Output is correct
5 Correct 107 ms 43124 KB Output is correct
6 Correct 105 ms 43124 KB Output is correct
7 Correct 115 ms 43128 KB Output is correct
8 Correct 112 ms 43352 KB Output is correct
9 Correct 122 ms 50972 KB Output is correct
10 Correct 93 ms 32784 KB Output is correct
11 Correct 158 ms 47088 KB Output is correct
12 Correct 9 ms 18516 KB Output is correct
13 Correct 11 ms 18572 KB Output is correct
14 Correct 11 ms 18516 KB Output is correct
15 Correct 9 ms 18540 KB Output is correct
16 Correct 12 ms 18540 KB Output is correct
17 Correct 11 ms 18452 KB Output is correct
18 Correct 47 ms 37672 KB Output is correct
19 Correct 42 ms 37668 KB Output is correct
20 Correct 43 ms 37824 KB Output is correct
21 Correct 44 ms 37824 KB Output is correct
22 Incorrect 160 ms 48732 KB 1st lines differ - on the 1st token, expected: '45561826463480', found: '45409419542258'
23 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 93 ms 49316 KB Output is correct
2 Correct 128 ms 54056 KB Output is correct
3 Correct 50 ms 37696 KB Output is correct
4 Correct 43 ms 37648 KB Output is correct
5 Correct 230 ms 87408 KB Output is correct
6 Correct 364 ms 81848 KB Output is correct
7 Correct 9 ms 18576 KB Output is correct
8 Correct 186 ms 56808 KB Output is correct
9 Correct 224 ms 62420 KB Output is correct
10 Correct 100 ms 49352 KB Output is correct
11 Correct 113 ms 54080 KB Output is correct
12 Correct 10 ms 18516 KB Output is correct
13 Correct 10 ms 18524 KB Output is correct
14 Correct 9 ms 18540 KB Output is correct
15 Correct 9 ms 18516 KB Output is correct
16 Correct 47 ms 37684 KB Output is correct
17 Correct 49 ms 37732 KB Output is correct
18 Correct 122 ms 49416 KB Output is correct
19 Correct 116 ms 54168 KB Output is correct
20 Correct 100 ms 49068 KB Output is correct
21 Correct 126 ms 49148 KB Output is correct
22 Correct 107 ms 49088 KB Output is correct
23 Correct 108 ms 52160 KB Output is correct
24 Correct 43 ms 37664 KB Output is correct
25 Correct 42 ms 37648 KB Output is correct
26 Correct 81 ms 38672 KB Output is correct
27 Correct 69 ms 39620 KB Output is correct
28 Correct 107 ms 43124 KB Output is correct
29 Correct 105 ms 43124 KB Output is correct
30 Correct 115 ms 43128 KB Output is correct
31 Correct 112 ms 43352 KB Output is correct
32 Correct 11 ms 18516 KB Output is correct
33 Correct 10 ms 18516 KB Output is correct
34 Correct 10 ms 18484 KB Output is correct
35 Correct 11 ms 18576 KB Output is correct
36 Correct 10 ms 18516 KB Output is correct
37 Correct 10 ms 18516 KB Output is correct
38 Correct 13 ms 18572 KB Output is correct
39 Correct 10 ms 18516 KB Output is correct
40 Correct 10 ms 18644 KB Output is correct
41 Correct 10 ms 18772 KB Output is correct
42 Incorrect 10 ms 18644 KB 1st lines differ - on the 1st token, expected: '278622587073', found: '278441359083'
43 Halted 0 ms 0 KB -