oj.uz

Submission #730868

# Submission time Handle Problem Language Result Execution time Memory
730868 2023-04-26T14:38:57 Z beaconmc Carnival Tickets (IOI20_tickets) C++14
100 / 100
 1785 ms 212856 KB 
#include "tickets.h"
 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
 
typedef long long ll;
using namespace std;
//using namespace __gnu_pbds;
 
#define FOR(i, x, y) for(ll i=x; i<y; i++)
#define FORNEG(i, x, y) for(ll i=x; i>y; i--)
//#define ordered_set tree<ll, null_type,less_equal<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define fast() ios_base::sync_with_stdio(false);cin.tie(NULL)
 
ll dp[1501][1501];
ll nextt[1501][1501];
ll maxi = -1;
ll mini = -1;

 
long long find_maximum(int k, vector<vector<int>> x) {
 
	ll n = x.size();
	ll m = x[0].size();
 
	vector<vector<int>> assigns;  
	 FOR(i,0,n){
    	vector<int> temp;
    	FOR(j,0,m) temp.push_back(-1);
    	assigns.push_back(temp);
    }
 
	vector<vector<ll>> orders;
	vector<vector<ll>> minmax;
	FOR(i,0,n){
		minmax.push_back({k,0});
	}
	FOR(i,0,n){

		FOR(j,m-k,m){
			orders.push_back({x[i][j]+x[i][j-(m-k)], i});
		}
	}


	sort(orders.begin(), orders.end());
	reverse(orders.begin(), orders.end());



	ll top = 0;
	FOR(i,0,orders.size()){
		ll ind = orders[i][1];
		//cout << ind <<" " << plus << endl;
		if (minmax[ind][0]>0 && top < n*k/2){
			minmax[ind][1] += 1;
			minmax[ind][0] -= 1;
			top += 1;
		}
	}

 
	vector<vector<ll>> q;
 
	for (auto&i : minmax) q.push_back(i);
	FOR(i,0,n) q[i].push_back(i);
	ll ans = 0;
 
	ll cur = 0;
 
	while (q[0][0] + q[0][1] > 0){
		sort(q.begin(), q.end());
		reverse(q.begin(), q.end());

 
 
		FOR(i,0,n/2){
			assigns[q[i][2]][q[i][0]-1] = cur;
			q[i][0] -= 1;
			ans -= x[q[i][2]][q[i][0]];
		}
		FOR(i,n/2,n){
 
			assigns[q[i][2]][m-q[i][1]] = cur;
			ans += x[q[i][2]][m-q[i][1]];
			q[i][1] -= 1;
		}
 
		cur++;
	}
 
 
	allocate_tickets(assigns);

	return ans;
 
 
 
 
 
 
}

Compilation message

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:11:35: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::vector<long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 | #define FOR(i, x, y) for(ll i=x; i<y; i++)
......
   53 |  FOR(i,0,orders.size()){
      |      ~~~~~~~~~~~~~~~~~             
tickets.cpp:53:2: note: in expansion of macro 'FOR'
   53 |  FOR(i,0,orders.size()){
      |  ^~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 980 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 3 ms 448 KB Output is correct
5 Correct 26 ms 3228 KB Output is correct
6 Correct 488 ms 73452 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 26 ms 4724 KB Output is correct
6 Correct 707 ms 113392 KB Output is correct
7 Correct 839 ms 131364 KB Output is correct
8 Correct 4 ms 1108 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 304 KB Output is correct
11 Correct 1 ms 308 KB Output is correct
12 Correct 7 ms 1552 KB Output is correct
13 Correct 27 ms 4776 KB Output is correct
14 Correct 24 ms 5304 KB Output is correct
15 Correct 930 ms 147924 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 4 ms 724 KB Output is correct
5 Correct 49 ms 7036 KB Output is correct
6 Correct 6 ms 1316 KB Output is correct
7 Correct 11 ms 1828 KB Output is correct
8 Correct 1669 ms 191080 KB Output is correct
9 Correct 1324 ms 189320 KB Output is correct
10 Correct 1311 ms 189452 KB Output is correct
11 Correct 1473 ms 191128 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Correct 2 ms 452 KB Output is correct
4 Correct 4 ms 572 KB Output is correct
5 Correct 2 ms 636 KB Output is correct
6 Correct 3 ms 724 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 3 ms 724 KB Output is correct
10 Correct 4 ms 724 KB Output is correct
11 Correct 4 ms 724 KB Output is correct
12 Correct 4 ms 724 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Correct 2 ms 452 KB Output is correct
4 Correct 4 ms 572 KB Output is correct
5 Correct 2 ms 636 KB Output is correct
6 Correct 3 ms 724 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 3 ms 724 KB Output is correct
10 Correct 4 ms 724 KB Output is correct
11 Correct 4 ms 724 KB Output is correct
12 Correct 4 ms 724 KB Output is correct
13 Correct 20 ms 3256 KB Output is correct
14 Correct 21 ms 3412 KB Output is correct
15 Correct 34 ms 5432 KB Output is correct
16 Correct 51 ms 7904 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 3 ms 724 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 51 ms 5712 KB Output is correct
21 Correct 37 ms 6080 KB Output is correct
22 Correct 45 ms 6988 KB Output is correct
23 Correct 44 ms 7340 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 980 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 3 ms 448 KB Output is correct
11 Correct 26 ms 3228 KB Output is correct
12 Correct 488 ms 73452 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 304 KB Output is correct
16 Correct 2 ms 596 KB Output is correct
17 Correct 26 ms 4724 KB Output is correct
18 Correct 707 ms 113392 KB Output is correct
19 Correct 839 ms 131364 KB Output is correct
20 Correct 4 ms 1108 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 304 KB Output is correct
23 Correct 1 ms 308 KB Output is correct
24 Correct 7 ms 1552 KB Output is correct
25 Correct 27 ms 4776 KB Output is correct
26 Correct 24 ms 5304 KB Output is correct
27 Correct 930 ms 147924 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 4 ms 724 KB Output is correct
32 Correct 49 ms 7036 KB Output is correct
33 Correct 6 ms 1316 KB Output is correct
34 Correct 11 ms 1828 KB Output is correct
35 Correct 1669 ms 191080 KB Output is correct
36 Correct 1324 ms 189320 KB Output is correct
37 Correct 1311 ms 189452 KB Output is correct
38 Correct 1473 ms 191128 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 2 ms 460 KB Output is correct
41 Correct 2 ms 452 KB Output is correct
42 Correct 4 ms 572 KB Output is correct
43 Correct 2 ms 636 KB Output is correct
44 Correct 3 ms 724 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 3 ms 724 KB Output is correct
48 Correct 4 ms 724 KB Output is correct
49 Correct 4 ms 724 KB Output is correct
50 Correct 4 ms 724 KB Output is correct
51 Correct 20 ms 3256 KB Output is correct
52 Correct 21 ms 3412 KB Output is correct
53 Correct 34 ms 5432 KB Output is correct
54 Correct 51 ms 7904 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 3 ms 724 KB Output is correct
57 Correct 2 ms 468 KB Output is correct
58 Correct 51 ms 5712 KB Output is correct
59 Correct 37 ms 6080 KB Output is correct
60 Correct 45 ms 6988 KB Output is correct
61 Correct 44 ms 7340 KB Output is correct
62 Correct 56 ms 8508 KB Output is correct
63 Correct 63 ms 8548 KB Output is correct
64 Correct 140 ms 21492 KB Output is correct
65 Correct 457 ms 57180 KB Output is correct
66 Correct 631 ms 84792 KB Output is correct
67 Correct 10 ms 1936 KB Output is correct
68 Correct 7 ms 1552 KB Output is correct
69 Correct 532 ms 74004 KB Output is correct
70 Correct 1122 ms 130848 KB Output is correct
71 Correct 1785 ms 212856 KB Output is correct
72 Correct 1280 ms 198768 KB Output is correct
73 Correct 1269 ms 175632 KB Output is correct
74 Correct 910 ms 117436 KB Output is correct
75 Correct 910 ms 129272 KB Output is correct