oj.uz

Submission #300444

# Submission time Handle Problem Language Result Execution time Memory
300444 2020-09-17T07:19:45 Z tqbfjotld Carnival Tickets (IOI20_tickets) C++14
100 / 100
 1457 ms 72204 KB 
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;

int numsmall[1505];

long long find_maximum(int k, std::vector<std::vector<int>> X) {
	int n = X.size();
	int m = X[0].size();

	long long ans = 0;
	vector<vector<pair<int,int> > > sorted;
	for (int x = 0; x<n; x++){
        vector<pair<int,int> > stuff;
        for (int y = 0; y<m; y++){
            stuff.push_back({X[x][y],y});
        }
        sort(stuff.begin(),stuff.end());
        sorted.push_back(stuff);
	}
    for (int x = 0; x<n; x++){
        for (int y = m-k; y<m; y++){
            ans += sorted[x][y].first;
        }
    }
    priority_queue<pair<int,int> > pq;
    for (int x = 0; x<n; x++){
        pq.push({-sorted[x][m-k].first-sorted[x][0].first,x});
    }
    for (int x = 0; x<k*n/2; x++){
        int cur = pq.top().second;
        ans += pq.top().first;
        pq.pop();
        numsmall[cur]++;
        if (numsmall[cur]<k)pq.push({-sorted[cur][m-k+numsmall[cur]].first-sorted[cur][numsmall[cur]].first,cur});
    }
  //  printf("ans = %lld\n",ans);
    std::vector<std::vector<int>> answer;
	for (int i = 0; i < n; i++) {
		std::vector<int> row(m);
		for (int j = 0; j < m; j++) {
			row[j] = -1;
		}
		answer.push_back(row);
	}
    for (int x = 0; x<k; x++){
       // printf("round %d\n",x);
        vector<pair<int,int> > thing;
        for (int y = 0; y<n; y++){
            thing.push_back({numsmall[y],y});
        }
        sort(thing.begin(),thing.end());
        for (int y = 0; y<n/2; y++){
            int cur = thing[y].second;
          //  printf("assigning big to %d\n",cur);
            int numbig = k-x-numsmall[cur];
            answer[cur][sorted[cur][m-numbig].second] = x;
        }
        for (int y = n/2; y<n; y++){
            int cur = thing[y].second;
          //  printf("assigning small to %d\n",cur);
            answer[cur][sorted[cur][numsmall[cur]-1].second] = x;
            numsmall[cur]--;
        }
    }

	allocate_tickets(answer);
	return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 3 ms 896 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 4 ms 512 KB Output is correct
5 Correct 41 ms 3204 KB Output is correct
6 Correct 832 ms 69368 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 32 ms 3196 KB Output is correct
6 Correct 874 ms 70128 KB Output is correct
7 Correct 969 ms 70500 KB Output is correct
8 Correct 6 ms 640 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 9 ms 1024 KB Output is correct
13 Correct 37 ms 2680 KB Output is correct
14 Correct 27 ms 2688 KB Output is correct
15 Correct 918 ms 71032 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 4 ms 512 KB Output is correct
5 Correct 43 ms 3192 KB Output is correct
6 Correct 8 ms 768 KB Output is correct
7 Correct 10 ms 1024 KB Output is correct
8 Correct 1187 ms 72204 KB Output is correct
9 Correct 1137 ms 67128 KB Output is correct
10 Correct 1183 ms 67220 KB Output is correct
11 Correct 1457 ms 71940 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 3 ms 488 KB Output is correct
10 Correct 5 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 4 ms 512 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 3 ms 488 KB Output is correct
10 Correct 5 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 4 ms 512 KB Output is correct
13 Correct 35 ms 3192 KB Output is correct
14 Correct 39 ms 3200 KB Output is correct
15 Correct 41 ms 3192 KB Output is correct
16 Correct 47 ms 3320 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 5 ms 512 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 49 ms 3064 KB Output is correct
21 Correct 54 ms 3064 KB Output is correct
22 Correct 49 ms 3064 KB Output is correct
23 Correct 44 ms 3064 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 3 ms 896 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 4 ms 512 KB Output is correct
11 Correct 41 ms 3204 KB Output is correct
12 Correct 832 ms 69368 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 3 ms 512 KB Output is correct
17 Correct 32 ms 3196 KB Output is correct
18 Correct 874 ms 70128 KB Output is correct
19 Correct 969 ms 70500 KB Output is correct
20 Correct 6 ms 640 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 0 ms 256 KB Output is correct
24 Correct 9 ms 1024 KB Output is correct
25 Correct 37 ms 2680 KB Output is correct
26 Correct 27 ms 2688 KB Output is correct
27 Correct 918 ms 71032 KB Output is correct
28 Correct 1 ms 256 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 4 ms 512 KB Output is correct
32 Correct 43 ms 3192 KB Output is correct
33 Correct 8 ms 768 KB Output is correct
34 Correct 10 ms 1024 KB Output is correct
35 Correct 1187 ms 72204 KB Output is correct
36 Correct 1137 ms 67128 KB Output is correct
37 Correct 1183 ms 67220 KB Output is correct
38 Correct 1457 ms 71940 KB Output is correct
39 Correct 1 ms 256 KB Output is correct
40 Correct 3 ms 512 KB Output is correct
41 Correct 3 ms 512 KB Output is correct
42 Correct 3 ms 512 KB Output is correct
43 Correct 3 ms 512 KB Output is correct
44 Correct 3 ms 512 KB Output is correct
45 Correct 1 ms 384 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 3 ms 488 KB Output is correct
48 Correct 5 ms 512 KB Output is correct
49 Correct 3 ms 512 KB Output is correct
50 Correct 4 ms 512 KB Output is correct
51 Correct 35 ms 3192 KB Output is correct
52 Correct 39 ms 3200 KB Output is correct
53 Correct 41 ms 3192 KB Output is correct
54 Correct 47 ms 3320 KB Output is correct
55 Correct 2 ms 384 KB Output is correct
56 Correct 5 ms 512 KB Output is correct
57 Correct 2 ms 512 KB Output is correct
58 Correct 49 ms 3064 KB Output is correct
59 Correct 54 ms 3064 KB Output is correct
60 Correct 49 ms 3064 KB Output is correct
61 Correct 44 ms 3064 KB Output is correct
62 Correct 117 ms 8056 KB Output is correct
63 Correct 132 ms 8056 KB Output is correct
64 Correct 127 ms 8184 KB Output is correct
65 Correct 466 ms 31480 KB Output is correct
66 Correct 537 ms 31992 KB Output is correct
67 Correct 12 ms 1024 KB Output is correct
68 Correct 8 ms 896 KB Output is correct
69 Correct 876 ms 69124 KB Output is correct
70 Correct 1037 ms 70048 KB Output is correct
71 Correct 1219 ms 72080 KB Output is correct
72 Correct 1069 ms 69388 KB Output is correct
73 Correct 1184 ms 69372 KB Output is correct
74 Correct 943 ms 67764 KB Output is correct
75 Correct 1053 ms 67844 KB Output is correct