oj.uz

Submission #1051422

# Submission time Handle Problem Language Result Execution time Memory
1051422 2024-08-10T06:29:09 Z LittleOrange Carnival Tickets (IOI20_tickets) C++17
27 / 100
 321 ms 110756 KB 
#include "tickets.h"
#include <vector>
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
long long find_maximum(int k, std::vector<std::vector<int>> x) {
	ll n = x.size();
	ll m = x[0].size();
	vector<vector<int>> ans(n,vector<int>(m,-1));
	/*if (m == 1){
		vector<ll> v;
		for(ll i = 0;i<n;i++) {
			v.push_back(x[i][0]);
			ans[i][0] = 0;
		}
		allocate_tickets(ans);
		sort(v.begin(),v.end());
		ll sm = 0;
		for(ll i : v) sm += abs(i-v[v.size()/2]);
		return sm;
	}*/
	vector<deque<pair<ll,ll>>> a(n);
	for(ll i = 0;i<n;i++){
		for(ll j = 0;j<m;j++){
			a[i].push_back({x[i][j],j});
		}
		sort(a[i].begin(),a[i].end());
	}
	ll sm = 0;
	for(ll r = 0;r<k;r++){
		/*for(ll i = 0;i<n;i++){
			cerr << i << ":";
			for(auto [v,j] : a[i]){
				cerr << " " << v << "," << j;
			}
			cerr << "\n";
		}*/
		vector<pair<ll,ll>> ord;
		for(ll i = 0;i<n;i++){
			ord.push_back({a[i].front().first+a[i].back().first,i});
		}
		sort(ord.begin(),ord.end());
		for(ll i = 0;i<n/2;i++){
			auto [v,j] = a[ord[i].second].front();a[ord[i].second].pop_front();
			ans[ord[i].second][j] = r;
			//cerr << r << " -> " << ord[i].second << " " << j << "\n";
			sm -= v;
		}
		for(ll i = n/2;i<n;i++){
			auto [v,j] = a[ord[i].second].back();a[ord[i].second].pop_back();
			ans[ord[i].second][j] = r;
			//cerr << r << " -> " << ord[i].second << " " << j << "\n";
			sm += v;
		}
	}
	allocate_tickets(ans);
	return sm;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 704 KB Output is correct
6 Correct 1 ms 1628 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 0 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 12 ms 4952 KB Output is correct
6 Correct 321 ms 110756 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Contestant returned 5 while correct return value is 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 while correct return value is 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 while correct return value is 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 while correct return value is 13.
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 704 KB Output is correct
6 Correct 1 ms 1628 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 12 ms 4952 KB Output is correct
12 Correct 321 ms 110756 KB Output is correct
13 Incorrect 0 ms 348 KB Contestant returned 5 while correct return value is 6.
14 Halted 0 ms 0 KB -