oj.uz

Submission #983926

# Submission time Handle Problem Language Result Execution time Memory
983926 2024-05-16T08:07:06 Z phoenix0423 Carnival Tickets (IOI20_tickets) C++17
27 / 100
 407 ms 71120 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define pb push_back
#define eb emplace_back
#include "tickets.h"
const int maxn = 1505;
const ll INF = 1e18;
// ll dp[maxn][maxn];

long long find_maximum(int k, std::vector<std::vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	vector<vector<int>> ans(n, vector<int>(m, -1));
	ll cost = 0;
	multiset<pll> stl, str; // l : l -> r, r : r -> l
	vector<int> l(n), r(n);
	auto rid = [&](int i) -> void {
		if(l[i]) stl.erase({x[i][r[i]] + x[i][l[i] - 1], i});
		if(r[i] < m - 1) str.erase({x[i][r[i] + 1] + x[i][l[i]], i});
	};
	auto put = [&](int i) -> void {
		if(l[i]) stl.insert({x[i][r[i]] + x[i][l[i] - 1], i});
		if(r[i] < m - 1) str.insert({x[i][r[i] + 1] + x[i][l[i]], i});
	};
	for(int i = 0; i < n; i++){
		if(i < n / 2) l[i] = k, r[i] = m - 1;
		else l[i] = 0, r[i] = m - 1 - k;
		int cnt = 0;
		for(int j = 0; j < l[i]; j++) cost -= x[i][j], ans[i][j] = cnt++;
		cnt = k - 1;
		for(int j = r[i] + 1; j < m; j++) cost += x[i][j], ans[i][j] = cnt--;
		put(i);
	}
	while(true){
		auto [a, b] = *prev(stl.end());
		auto [c, d] = *str.begin();
		if(b == d || a <= c) break;
		// cout<<"cur : "<<b<<" : "<<a<<", "<<d<<" : "<<c<<"\n";
		// cout<<l[b]<<" "<<r[b]<<" "<<l[d]<<" "<<r[d]<<"\n";
		cost += a - c;
		rid(b), rid(d);
		// stl.erase(prev(stl.end()));
		// str.erase(str.begin());
		swap(ans[b][l[b] - 1], ans[b][r[b]]);
		swap(ans[d][l[d]], ans[d][r[d] + 1]);
		l[b] --, r[b] --;
		l[d] ++, r[d] ++;
		put(b), put(d);
	}
	cost = 0;
	for(int i = 0; i < n; i++){
		for(int j = 0; j < l[i]; j++) cost -= x[i][j];
		for(int j = r[i] + 1; j < m; j++) cost += x[i][j];
	}
	// cout<<"c : "<<cost<<"\n";
	allocate_tickets(ans);
	return cost;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 860 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 368 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 16 ms 3260 KB Output is correct
6 Correct 407 ms 71120 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Contestant returned 4 but the tickets gives a total value of 6
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Contestant returned 11 but the tickets gives a total value of 13
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Contestant returned 11 but the tickets gives a total value of 13
2 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Contestant returned 11 but the tickets gives a total value of 13
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 368 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 16 ms 3260 KB Output is correct
12 Correct 407 ms 71120 KB Output is correct
13 Incorrect 0 ms 348 KB Contestant returned 4 but the tickets gives a total value of 6
14 Halted 0 ms 0 KB -