oj.uz

답안 #737051

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
737051 2023-05-06T13:57:37 Z minhcool 메기 농장 (IOI22_fish) C++17
70 / 100
 282 ms 296708 KB 
#include<bits/stdc++.h>
using namespace std;
 
#define ll long long
//#define int long long
#define fi first
#define se second
#define pb push_back
//#define mp make_pair
 
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;
 
const int N = 3e5 + 5;
 
const int oo = 1e18 + 7, mod = 1e9 + 7;
 
int n, m;
 
long long val[3005][3005], pref[3005][3005];
 
// dp[row_i][row_j][i - 1 > or = or <]
long long dp[3005][3005][2];
 
ll x[N], y[N], w[N];
 
ll solve1(){
	ll tol = 0;
	for(int i = 1; i <= m; i++) tol += w[i];
	return tol;
}
 
map<ii, ll> mp;
 
ll solve2(){
	for(int i = 1; i <= m; i++) mp[{x[i], y[i]}] = w[i];
	if(n >= 3){
		ll mx = -1, total = 0;
		for(int i = 1; i <= n; i++) total += mp[{2, i}];
		mx = total;
		for(int i = 1; i <= n; i++){
			total += (mp[{1, i}] - mp[{2, i}]);
			mx = max(mx, total);
		}
		return mx;
	}
	else{
		return max(mp[{1, 1}] + mp[{1, 2}], mp[{2, 1}] + mp[{2, 2}]);
	}
}
 
ll dp1[N][2][2];
 
ll solve3(){
	//cout << "OK\n";
	for(int i = 1; i <= m; i++) mp[{x[i], y[i]}] = w[i];
	for(int i = 1; i <= n; i++){
		for(int j = 0; j < 2; j++){
			for(int k = 0; k < 2; k++) dp1[i][j][k] = -oo;
		}
	}
	dp1[1][0][0] = dp1[1][1][0] = 0;
	for(int i = 2; i <= (n + 1); i++){
		for(int j = 0; j < 2; j++){
			if(i == (n + 1) && j) break;
			for(int k = 0; k < 2; k++){
				for(int h = 0; h < 2; h++){
					dp1[i][j][k] = max(dp1[i][j][k], dp1[i - 1][k][h] + mp[{i - 1, 1}] * (!k && (j | h)));
				}
				//cout << i << " " << j << " " << k << " " << dp1[i][j][k] << "\n";
			}
		}
	}
	return max(dp1[n + 1][0][0], dp1[n + 1][0][1]);
}
 
 
long long max_weights(int _n, int _m, vector<int> _x, vector<int> _y, vector<int> _w){
	n = _n, m = _m;
	bool chk1 = 1, chk2 = 1, chk3 = 1;
	for(int i = 0; i < m; i++){
		x[i + 1] = _x[i] + 1, y[i + 1] = _y[i] + 1, w[i + 1] = _w[i];
		chk1 &= (!(_x[i] & 1));
		chk2 &= (_x[i] <= 1);
		chk3 &= (_y[i] <= 0);
		if(n <= 3000) val[_x[i] + 1][_y[i] + 1] += (long long)_w[i];
	}
	if(n <= 3000){
		for(int i = 1; i <= n; i++){
			for(int j = 1; j <= n; j++) pref[i][j] = pref[i][j - 1] + val[i][j];
		}
		for(int i = 0; i <= n; i++){
			for(int j = 0; j <= n; j++){
				dp[i][j][0] = dp[i][j][1] = -oo;
			}
		}
		//dp[0][0][0] = 0;
		//15206896898496
		for(int i = 0; i <= n; i++){
			//dp[2][i][0] = pref[1][i];// 0 -> <=
			//dp[2][i][1] = pref[2][i;
			dp[1][i][0] = 0;
		}
		for(int i = 2; i <= n + 1; i++){
			// calculate (i - 1)
			long long maximum = -oo;
			for(int nxt = 0; nxt <= n; nxt++){
				maximum = max(maximum, dp[i - 1][nxt][0] - pref[i - 1][nxt]);
				dp[i][nxt][0] = max(dp[i][nxt][0], maximum + pref[i - 1][nxt]);
			}
			maximum = -oo;
			for(int nxt = n; nxt >= 0; nxt--){
				dp[i][nxt][1] = max(dp[i][nxt][1], maximum - pref[i][nxt]);
				maximum = max(maximum, dp[i - 1][nxt][1] + pref[i][nxt]);
			}
			for(int lst = 0; lst <= n; lst++){
				// 0 - 0
				/*
				for(int nxt = lst; nxt <= n; nxt++){
					dp[i][nxt][0] = max(dp[i][nxt][0], dp[i - 1][lst][0] + (pref[i - 1][nxt] - pref[i - 1][lst]));
				}
				// 1 - 1
				for(int nxt = lst - 1; nxt >= 0; nxt--){
					dp[i][nxt][1] = max(dp[i][nxt][1], dp[i - 1][lst][1] + pref[i][lst] - pref[i][nxt]);	
				}*/
				// 0 - 1
				if(lst == n){
					for(int nxt = 0; nxt < n; nxt++) dp[i][nxt][1] = max(dp[i][nxt][1], dp[i - 1][n][0] + pref[i][n] - pref[i][nxt]);
				}
				// 1 - 0
				if(!lst){
					dp[i][0][0] = max(dp[i][0][0], dp[i - 1][0][1]);
					for(int nxt = 1; nxt <= n; nxt++) dp[i][nxt][0] = max(dp[i][nxt][0], max(dp[i - 1][0][0] + pref[i - 1][nxt], dp[i - 1][0][1]));
				}
			}
		}
		return max(dp[n + 1][0][0], dp[n + 1][0][1]);
	}
	else if(chk1) return solve1();
	else if(chk2) return solve2();
	else if(chk3) return solve3();
}
 
/*
void process(){
	int n, m;
	vector<int> a, b, c;
	cin >> n >> m;
	for(int i = 1; i <= m; i++){
		int x, y, z;
		cin >> x >> y >> z;
		a.pb(x), b.pb(y), c.pb(z);
	}
	cout << max_weights(n, m, a, b, c) << "\n";
}
 
signed main(){
	ios_base::sync_with_stdio(0);
	freopen("fish.inp", "r", stdin);
	//freopen("fish.out", "w", stdout);
	//cout << "OK\n";
	//return 0;
	process();
}
*/

Compilation message

fish.cpp:17:21: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   17 | const int oo = 1e18 + 7, mod = 1e9 + 7;
      |                ~~~~~^~~
fish.cpp: In function 'long long int max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:143:1: warning: control reaches end of non-void function [-Wreturn-type]
  143 | }
      | ^

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 4172 KB Output is correct
2 Correct 28 ms 5044 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 79 ms 14412 KB Output is correct
6 Correct 88 ms 20972 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 166 ms 19352 KB Output is correct
3 Correct 222 ms 25604 KB Output is correct
4 Correct 26 ms 5460 KB Output is correct
5 Correct 28 ms 6732 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 320 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 90 ms 16756 KB Output is correct
13 Correct 121 ms 19264 KB Output is correct
14 Correct 106 ms 16736 KB Output is correct
15 Correct 112 ms 18728 KB Output is correct
16 Correct 112 ms 16748 KB Output is correct
17 Correct 117 ms 18560 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 96 ms 9724 KB Output is correct
3 Correct 78 ms 12208 KB Output is correct
4 Correct 76 ms 11988 KB Output is correct
5 Correct 112 ms 16040 KB Output is correct
6 Correct 98 ms 15300 KB Output is correct
7 Correct 117 ms 15968 KB Output is correct
8 Correct 124 ms 15948 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 2624 KB Output is correct
10 Correct 4 ms 6228 KB Output is correct
11 Correct 3 ms 2644 KB Output is correct
12 Correct 4 ms 6100 KB Output is correct
13 Correct 1 ms 1364 KB Output is correct
14 Correct 4 ms 6084 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 2624 KB Output is correct
10 Correct 4 ms 6228 KB Output is correct
11 Correct 3 ms 2644 KB Output is correct
12 Correct 4 ms 6100 KB Output is correct
13 Correct 1 ms 1364 KB Output is correct
14 Correct 4 ms 6084 KB Output is correct
15 Correct 4 ms 6100 KB Output is correct
16 Correct 2 ms 1364 KB Output is correct
17 Correct 17 ms 8336 KB Output is correct
18 Correct 16 ms 8088 KB Output is correct
19 Correct 16 ms 8532 KB Output is correct
20 Correct 16 ms 8608 KB Output is correct
21 Correct 15 ms 8536 KB Output is correct
22 Correct 27 ms 11064 KB Output is correct
23 Correct 7 ms 7252 KB Output is correct
24 Correct 15 ms 8152 KB Output is correct
25 Correct 4 ms 6100 KB Output is correct
26 Correct 7 ms 6868 KB Output is correct

Subtask #6
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 2624 KB Output is correct
10 Correct 4 ms 6228 KB Output is correct
11 Correct 3 ms 2644 KB Output is correct
12 Correct 4 ms 6100 KB Output is correct
13 Correct 1 ms 1364 KB Output is correct
14 Correct 4 ms 6084 KB Output is correct
15 Correct 4 ms 6100 KB Output is correct
16 Correct 2 ms 1364 KB Output is correct
17 Correct 17 ms 8336 KB Output is correct
18 Correct 16 ms 8088 KB Output is correct
19 Correct 16 ms 8532 KB Output is correct
20 Correct 16 ms 8608 KB Output is correct
21 Correct 15 ms 8536 KB Output is correct
22 Correct 27 ms 11064 KB Output is correct
23 Correct 7 ms 7252 KB Output is correct
24 Correct 15 ms 8152 KB Output is correct
25 Correct 4 ms 6100 KB Output is correct
26 Correct 7 ms 6868 KB Output is correct
27 Correct 180 ms 224348 KB Output is correct
28 Correct 76 ms 33372 KB Output is correct
29 Correct 259 ms 229440 KB Output is correct
30 Correct 266 ms 272204 KB Output is correct
31 Correct 264 ms 272828 KB Output is correct
32 Correct 87 ms 30336 KB Output is correct
33 Correct 282 ms 296652 KB Output is correct
34 Correct 281 ms 296708 KB Output is correct
35 Correct 216 ms 232548 KB Output is correct
36 Correct 258 ms 242420 KB Output is correct

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 96 ms 9724 KB Output is correct
3 Correct 78 ms 12208 KB Output is correct
4 Correct 76 ms 11988 KB Output is correct
5 Correct 112 ms 16040 KB Output is correct
6 Correct 98 ms 15300 KB Output is correct
7 Correct 117 ms 15968 KB Output is correct
8 Correct 124 ms 15948 KB Output is correct
9 Incorrect 123 ms 21960 KB 1st lines differ - on the 1st token, expected: '99999', found: '1'
10 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 4172 KB Output is correct
2 Correct 28 ms 5044 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 79 ms 14412 KB Output is correct
6 Correct 88 ms 20972 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 166 ms 19352 KB Output is correct
9 Correct 222 ms 25604 KB Output is correct
10 Correct 26 ms 5460 KB Output is correct
11 Correct 28 ms 6732 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 320 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 90 ms 16756 KB Output is correct
19 Correct 121 ms 19264 KB Output is correct
20 Correct 106 ms 16736 KB Output is correct
21 Correct 112 ms 18728 KB Output is correct
22 Correct 112 ms 16748 KB Output is correct
23 Correct 117 ms 18560 KB Output is correct
24 Correct 1 ms 316 KB Output is correct
25 Correct 96 ms 9724 KB Output is correct
26 Correct 78 ms 12208 KB Output is correct
27 Correct 76 ms 11988 KB Output is correct
28 Correct 112 ms 16040 KB Output is correct
29 Correct 98 ms 15300 KB Output is correct
30 Correct 117 ms 15968 KB Output is correct
31 Correct 124 ms 15948 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 312 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 320 KB Output is correct
38 Correct 1 ms 320 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 2 ms 2624 KB Output is correct
41 Correct 4 ms 6228 KB Output is correct
42 Correct 3 ms 2644 KB Output is correct
43 Correct 4 ms 6100 KB Output is correct
44 Correct 1 ms 1364 KB Output is correct
45 Correct 4 ms 6084 KB Output is correct
46 Correct 4 ms 6100 KB Output is correct
47 Correct 2 ms 1364 KB Output is correct
48 Correct 17 ms 8336 KB Output is correct
49 Correct 16 ms 8088 KB Output is correct
50 Correct 16 ms 8532 KB Output is correct
51 Correct 16 ms 8608 KB Output is correct
52 Correct 15 ms 8536 KB Output is correct
53 Correct 27 ms 11064 KB Output is correct
54 Correct 7 ms 7252 KB Output is correct
55 Correct 15 ms 8152 KB Output is correct
56 Correct 4 ms 6100 KB Output is correct
57 Correct 7 ms 6868 KB Output is correct
58 Correct 180 ms 224348 KB Output is correct
59 Correct 76 ms 33372 KB Output is correct
60 Correct 259 ms 229440 KB Output is correct
61 Correct 266 ms 272204 KB Output is correct
62 Correct 264 ms 272828 KB Output is correct
63 Correct 87 ms 30336 KB Output is correct
64 Correct 282 ms 296652 KB Output is correct
65 Correct 281 ms 296708 KB Output is correct
66 Correct 216 ms 232548 KB Output is correct
67 Correct 258 ms 242420 KB Output is correct
68 Incorrect 123 ms 21960 KB 1st lines differ - on the 1st token, expected: '99999', found: '1'
69 Halted 0 ms 0 KB -