oj.uz

Submission #737043

# Submission time Handle Problem Language Result Execution time Memory
737043 2023-05-06T13:49:06 Z minhcool Catfish Farm (IOI22_fish) C++17
52 / 100
 934 ms 295304 KB 
#include<bits/stdc++.h>
using namespace std;

//#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 = 3e3 + 5;

const int oo = 1e18 + 7, mod = 1e9 + 7;

int n, m;

long long val[N][N], pref[N][N];

// dp[row_i][row_j][i - 1 > or = or <]
long long dp[N][N][2];

long long max_weights(int _n, int _m, vector<int> _x, vector<int> _y, vector<int> _w){
	n = _n, m = _m;
	for(int i = 0; i < m; i++){
		val[_x[i] + 1][_y[i] + 1] += (long long)_w[i];
	}
	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]);
}

/*
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:16:21: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   16 | const int oo = 1e18 + 7, mod = 1e9 + 7;
      |                ~~~~~^~~

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Runtime error 879 ms 149472 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Runtime error 907 ms 153392 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 934 ms 143904 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

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 312 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 340 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 4 ms 2772 KB Output is correct
10 Correct 5 ms 6100 KB Output is correct
11 Correct 2 ms 2620 KB Output is correct
12 Correct 4 ms 6100 KB Output is correct
13 Correct 1 ms 1236 KB Output is correct
14 Correct 5 ms 6000 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 312 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 340 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 4 ms 2772 KB Output is correct
10 Correct 5 ms 6100 KB Output is correct
11 Correct 2 ms 2620 KB Output is correct
12 Correct 4 ms 6100 KB Output is correct
13 Correct 1 ms 1236 KB Output is correct
14 Correct 5 ms 6000 KB Output is correct
15 Correct 5 ms 6064 KB Output is correct
16 Correct 2 ms 1236 KB Output is correct
17 Correct 16 ms 7892 KB Output is correct
18 Correct 15 ms 7740 KB Output is correct
19 Correct 16 ms 8240 KB Output is correct
20 Correct 16 ms 8252 KB Output is correct
21 Correct 15 ms 8148 KB Output is correct
22 Correct 35 ms 9644 KB Output is correct
23 Correct 8 ms 7092 KB Output is correct
24 Correct 12 ms 7932 KB Output is correct
25 Correct 4 ms 6100 KB Output is correct
26 Correct 7 ms 6612 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 312 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 340 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 4 ms 2772 KB Output is correct
10 Correct 5 ms 6100 KB Output is correct
11 Correct 2 ms 2620 KB Output is correct
12 Correct 4 ms 6100 KB Output is correct
13 Correct 1 ms 1236 KB Output is correct
14 Correct 5 ms 6000 KB Output is correct
15 Correct 5 ms 6064 KB Output is correct
16 Correct 2 ms 1236 KB Output is correct
17 Correct 16 ms 7892 KB Output is correct
18 Correct 15 ms 7740 KB Output is correct
19 Correct 16 ms 8240 KB Output is correct
20 Correct 16 ms 8252 KB Output is correct
21 Correct 15 ms 8148 KB Output is correct
22 Correct 35 ms 9644 KB Output is correct
23 Correct 8 ms 7092 KB Output is correct
24 Correct 12 ms 7932 KB Output is correct
25 Correct 4 ms 6100 KB Output is correct
26 Correct 7 ms 6612 KB Output is correct
27 Correct 191 ms 224204 KB Output is correct
28 Correct 69 ms 32012 KB Output is correct
29 Correct 306 ms 227944 KB Output is correct
30 Correct 268 ms 270808 KB Output is correct
31 Correct 299 ms 271332 KB Output is correct
32 Correct 92 ms 28556 KB Output is correct
33 Correct 289 ms 295304 KB Output is correct
34 Correct 274 ms 295284 KB Output is correct
35 Correct 210 ms 231836 KB Output is correct
36 Correct 276 ms 240960 KB Output is correct

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 934 ms 143904 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Runtime error 879 ms 149472 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -