oj.uz

Submission #1074076

# Submission time Handle Problem Language Result Execution time Memory
1074076 2024-08-25T07:39:10 Z Gromp15 Catfish Farm (IOI22_fish) C++17
3 / 100
 867 ms 2097152 KB 
#include <bits/stdc++.h>
#include "fish.h"
#define ll long long
#define ar array
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
using namespace std;

const ll INF = 1e18;
template<typename T> bool ckmin(T &a, const T &b ) { return a > b ? a = b, 1 : 0; }
template<typename T> bool ckmax(T &a, const T &b ) { return a < b ? a = b, 1 : 0; }

long long max_weights(int n, int m, std::vector<int> x, std::vector<int> y, std::vector<int> w) {
	vector<vector<ar<ll, 2>>> each(n);
	for (int i = 0; i < m; i++) {
		each[x[i]].push_back({y[i], w[i]});
		each[x[i]].push_back({y[i]-1, 0});
	}
	for (int i = 0; i < n; i++) each[i].push_back({n-1, 0}), each[i].push_back({-1, 0});
	for (int i = 0; i < n; i++) {
		sort(all(each[i]));
		vector<ar<ll, 2>> nw;
		ll s = 0;
		for (int j = 0; j < sz(each[i]); j++) {
			int r = j;
			while (r+1 < sz(each[i]) && each[i][r+1][0] == each[i][r][0]) r++;
			for (int k = j; k <= r; k++) s += each[i][k][1];
			nw.push_back({each[i][j][0], s});
			j = r;
		}
		swap(each[i], nw);
	}
	vector<vector<ll>> dp;
	auto query = [&](int pos, int x) {
		return (*prev(upper_bound(all(each[pos]), ar<ll, 2>{x, LLONG_MAX})))[1];
	};
	for (int i = 0; i < n; i++) {
		vector<vector<ll>> dp2;
		const int N = sz(each[i]);
		dp2.resize(i ? sz(each[i-1]) : 1, vector<ll>(N, -INF));
		if (!i) {
			for (int j = 0; j < N; j++) {
				dp2[0][j] = 0;
			}
			swap(dp, dp2);
		}
		else {
			for (int j = 0; j < sz(dp); j++) {
				for (int k = 0; k < sz(dp[j]); k++) {
					for (int l = 0; l < N; l++) {
						int L = each[i-1][k][0], R = max(i-2 >= 0 ? each[i-2][j][0] : -1, each[i][l][0]);
						ckmax(dp2[k][l], dp[j][k] + (L <= R ? query(i-1, R) : 0) - query(i-1, L));
					}
				}
			}
			swap(dp, dp2);
		}
	}
	ll ans = -INF;
	for (int i = 0; i < sz(dp); i++) {
		for (int j = 0; j < sz(dp[i]); j++) {
			int L = each[n-1][j][0], R = each[n-2][i][0];
			ckmax(ans, dp[i][j] + (L <= R ? query(n-1, R) - query(n-1, L) : 0));
		}
	}
	return ans;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 16860 KB Output is correct
2 Correct 93 ms 19260 KB Output is correct
3 Correct 29 ms 7296 KB Output is correct
4 Correct 27 ms 7256 KB Output is correct
5 Correct 304 ms 33688 KB Output is correct
6 Correct 348 ms 34404 KB Output is correct

Subtask #2
0 / 6.0

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

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 7256 KB Output is correct
2 Correct 26 ms 7260 KB Output is correct
3 Incorrect 71 ms 11140 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '18509152103730'
4 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 1 ms 348 KB 1st lines differ - on the 1st token, expected: '4044', found: '2022'
4 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 1 ms 348 KB 1st lines differ - on the 1st token, expected: '4044', found: '2022'
4 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 1 ms 348 KB 1st lines differ - on the 1st token, expected: '4044', found: '2022'
4 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 7256 KB Output is correct
2 Correct 26 ms 7260 KB Output is correct
3 Incorrect 71 ms 11140 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '18509152103730'
4 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 16860 KB Output is correct
2 Correct 93 ms 19260 KB Output is correct
3 Correct 29 ms 7296 KB Output is correct
4 Correct 27 ms 7256 KB Output is correct
5 Correct 304 ms 33688 KB Output is correct
6 Correct 348 ms 34404 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Runtime error 867 ms 2097152 KB Execution killed with signal 9
9 Halted 0 ms 0 KB -