oj.uz

Submission #955060

# Submission time Handle Problem Language Result Execution time Memory
955060 2024-03-29T09:59:25 Z Trisanu_Das Carnival Tickets (IOI20_tickets) C++17
100 / 100
 699 ms 84420 KB 
#include <bits/stdc++.h>
#include "tickets.h"
using namespace std;
const int N=1505;
 
int n, m, d[N], s[N];
long long sum;
vector<pair<int, int> > v, l;
long long find_maximum(int k, vector<vector<int> > x){
	n = x.size(); m = x[0].size();
	vector<vector<int> > ans(n, vector<int>(m, -1));
	for(int i = 0; i < n; i++){
		for(int j = 0; j < k; j++) {
          sum += x[i][m - 1 - j]; 
          v.push_back(make_pair(x[i][j] + x[i][m - k + j], i));
        }
    }
	sort(v.begin(), v.end());
	for(int i = 0; i < n * k / 2; i++) {
      sum -= v[i].first;
      d[v[i].second]++;
    }
	for(int i = 0; i < n; i++){
		l.clear();
		for(int j = 0; j < k; j++) l.push_back(make_pair(s[j], j));
		sort(l.begin(), l.end());
		for(int j = 0; j < k; j++){
			if(j < d[i]) {
              ans[i][j] = l[j].second; 
              s[l[j].second]++;
            } else ans[i][m - k + j] = l[j].second;
        }
	}
	allocate_tickets(ans); 
    return sum;
}

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 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 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 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 18 ms 2420 KB Output is correct
6 Correct 422 ms 51480 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 768 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 18 ms 2808 KB Output is correct
6 Correct 464 ms 61740 KB Output is correct
7 Correct 470 ms 67488 KB Output is correct
8 Correct 3 ms 604 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 5 ms 1112 KB Output is correct
13 Correct 16 ms 2516 KB Output is correct
14 Correct 17 ms 2732 KB Output is correct
15 Correct 495 ms 71400 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 444 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 2 ms 856 KB Output is correct
5 Correct 27 ms 3748 KB Output is correct
6 Correct 5 ms 856 KB Output is correct
7 Correct 5 ms 1020 KB Output is correct
8 Correct 699 ms 84336 KB Output is correct
9 Correct 652 ms 79056 KB Output is correct
10 Correct 646 ms 78544 KB Output is correct
11 Correct 684 ms 84420 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 3 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 1 ms 444 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 2 ms 604 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 3 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 1 ms 444 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 17 ms 2900 KB Output is correct
14 Correct 17 ms 3152 KB Output is correct
15 Correct 21 ms 3284 KB Output is correct
16 Correct 25 ms 3784 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 21 ms 3292 KB Output is correct
21 Correct 22 ms 3452 KB Output is correct
22 Correct 24 ms 3480 KB Output is correct
23 Correct 24 ms 3528 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 18 ms 2420 KB Output is correct
12 Correct 422 ms 51480 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 768 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 18 ms 2808 KB Output is correct
18 Correct 464 ms 61740 KB Output is correct
19 Correct 470 ms 67488 KB Output is correct
20 Correct 3 ms 604 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 604 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 5 ms 1112 KB Output is correct
25 Correct 16 ms 2516 KB Output is correct
26 Correct 17 ms 2732 KB Output is correct
27 Correct 495 ms 71400 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 444 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 2 ms 856 KB Output is correct
32 Correct 27 ms 3748 KB Output is correct
33 Correct 5 ms 856 KB Output is correct
34 Correct 5 ms 1020 KB Output is correct
35 Correct 699 ms 84336 KB Output is correct
36 Correct 652 ms 79056 KB Output is correct
37 Correct 646 ms 78544 KB Output is correct
38 Correct 684 ms 84420 KB Output is correct
39 Correct 1 ms 600 KB Output is correct
40 Correct 2 ms 604 KB Output is correct
41 Correct 2 ms 604 KB Output is correct
42 Correct 3 ms 604 KB Output is correct
43 Correct 2 ms 604 KB Output is correct
44 Correct 2 ms 604 KB Output is correct
45 Correct 1 ms 444 KB Output is correct
46 Correct 1 ms 600 KB Output is correct
47 Correct 2 ms 604 KB Output is correct
48 Correct 2 ms 604 KB Output is correct
49 Correct 2 ms 604 KB Output is correct
50 Correct 2 ms 604 KB Output is correct
51 Correct 17 ms 2900 KB Output is correct
52 Correct 17 ms 3152 KB Output is correct
53 Correct 21 ms 3284 KB Output is correct
54 Correct 25 ms 3784 KB Output is correct
55 Correct 1 ms 348 KB Output is correct
56 Correct 2 ms 604 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 21 ms 3292 KB Output is correct
59 Correct 22 ms 3452 KB Output is correct
60 Correct 24 ms 3480 KB Output is correct
61 Correct 24 ms 3528 KB Output is correct
62 Correct 51 ms 8132 KB Output is correct
63 Correct 49 ms 7508 KB Output is correct
64 Correct 72 ms 9864 KB Output is correct
65 Correct 237 ms 32444 KB Output is correct
66 Correct 289 ms 36884 KB Output is correct
67 Correct 6 ms 1372 KB Output is correct
68 Correct 5 ms 860 KB Output is correct
69 Correct 417 ms 62536 KB Output is correct
70 Correct 529 ms 73408 KB Output is correct
71 Correct 665 ms 83888 KB Output is correct
72 Correct 634 ms 74860 KB Output is correct
73 Correct 614 ms 79276 KB Output is correct
74 Correct 492 ms 65452 KB Output is correct
75 Correct 533 ms 72480 KB Output is correct