Submission #678470

# Submission time Handle Problem Language Result Execution time Memory
678470 2023-01-06T04:30:07 Z cig32 Carnival Tickets (IOI20_tickets) C++17
100 / 100
937 ms 98140 KB
#include "tickets.h"
#include "bits/stdc++.h"
using namespace std;
long long find_maximum(int k, std::vector<std::vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	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);
	}
  
  priority_queue<pair<int, pair<int, int> > > pq;
  long long ans = 0;
 
  for(int i=0; i<n; i++) {
    for(int j=0; j<k; j++) {
      ans -= x[i][j];
      answer[i][j] = -2;
    }
  }
 
 
  for(int i=0; i<n; i++) {
    for(int j=m-k; j<m; j++) {
      pq.push({x[i][j] + x[i][j - (m-k)], {i, j}});
    }
  }
 
  int elev = n*k / 2;
  while(elev--) {
    ans += pq.top().first;
    answer[pq.top().second.first][pq.top().second.second] = 1;
    if(m != k) answer[pq.top().second.first][pq.top().second.second - (m-k)] = -1;
    pq.pop();
  }
 
  int nxt = 0;
 
  for(int i=0; i<n; i++) {
    for(int j=0; j<m; j++) {
      if(answer[i][j] == 1) {
 
        answer[i][j] = nxt;
        nxt = (nxt + 1) % k;
      }
    }
  }
 
  for(int i=0; i<n; i++) {
 
    bool bruh[m];
    for(int j=0; j<m; j++) bruh[j] = 0;
    for(int j=0; j<m; j++) if(answer[i][j] >= 0) bruh[answer[i][j]] = 1;
 
    nxt = 0;
 
    for(int j=0; j<m; j++) {
      if(answer[i][j] == -2) {
        while(bruh[nxt]) nxt++;
        bruh[nxt] = 1;
        answer[i][j] = nxt;
      }
    }
  }
 
  allocate_tickets(answer);
  return ans;
  
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
# 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 1 ms 296 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 26 ms 3240 KB Output is correct
6 Correct 454 ms 73196 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 25 ms 2756 KB Output is correct
6 Correct 505 ms 62184 KB Output is correct
7 Correct 527 ms 66568 KB Output is correct
8 Correct 3 ms 724 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 6 ms 948 KB Output is correct
13 Correct 18 ms 2524 KB Output is correct
14 Correct 19 ms 2564 KB Output is correct
15 Correct 582 ms 70112 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 28 ms 3996 KB Output is correct
6 Correct 5 ms 872 KB Output is correct
7 Correct 6 ms 1048 KB Output is correct
8 Correct 820 ms 98140 KB Output is correct
9 Correct 740 ms 94936 KB Output is correct
10 Correct 727 ms 94836 KB Output is correct
11 Correct 787 ms 98136 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 496 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 3 ms 440 KB Output is correct
5 Correct 3 ms 440 KB Output is correct
6 Correct 2 ms 596 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 496 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 3 ms 440 KB Output is correct
5 Correct 3 ms 440 KB Output is correct
6 Correct 2 ms 596 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Correct 20 ms 3156 KB Output is correct
14 Correct 21 ms 3228 KB Output is correct
15 Correct 25 ms 3408 KB Output is correct
16 Correct 29 ms 3960 KB Output is correct
17 Correct 2 ms 308 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 1 ms 436 KB Output is correct
20 Correct 23 ms 3020 KB Output is correct
21 Correct 26 ms 3576 KB Output is correct
22 Correct 32 ms 3324 KB Output is correct
23 Correct 27 ms 3888 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 296 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 26 ms 3240 KB Output is correct
12 Correct 454 ms 73196 KB Output is correct
13 Correct 1 ms 296 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 25 ms 2756 KB Output is correct
18 Correct 505 ms 62184 KB Output is correct
19 Correct 527 ms 66568 KB Output is correct
20 Correct 3 ms 724 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 6 ms 948 KB Output is correct
25 Correct 18 ms 2524 KB Output is correct
26 Correct 19 ms 2564 KB Output is correct
27 Correct 582 ms 70112 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 2 ms 596 KB Output is correct
32 Correct 28 ms 3996 KB Output is correct
33 Correct 5 ms 872 KB Output is correct
34 Correct 6 ms 1048 KB Output is correct
35 Correct 820 ms 98140 KB Output is correct
36 Correct 740 ms 94936 KB Output is correct
37 Correct 727 ms 94836 KB Output is correct
38 Correct 787 ms 98136 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 2 ms 496 KB Output is correct
41 Correct 2 ms 596 KB Output is correct
42 Correct 3 ms 440 KB Output is correct
43 Correct 3 ms 440 KB Output is correct
44 Correct 2 ms 596 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 2 ms 468 KB Output is correct
48 Correct 2 ms 468 KB Output is correct
49 Correct 2 ms 468 KB Output is correct
50 Correct 2 ms 596 KB Output is correct
51 Correct 20 ms 3156 KB Output is correct
52 Correct 21 ms 3228 KB Output is correct
53 Correct 25 ms 3408 KB Output is correct
54 Correct 29 ms 3960 KB Output is correct
55 Correct 2 ms 308 KB Output is correct
56 Correct 2 ms 468 KB Output is correct
57 Correct 1 ms 436 KB Output is correct
58 Correct 23 ms 3020 KB Output is correct
59 Correct 26 ms 3576 KB Output is correct
60 Correct 32 ms 3324 KB Output is correct
61 Correct 27 ms 3888 KB Output is correct
62 Correct 53 ms 8392 KB Output is correct
63 Correct 54 ms 8432 KB Output is correct
64 Correct 85 ms 10560 KB Output is correct
65 Correct 274 ms 35560 KB Output is correct
66 Correct 339 ms 41428 KB Output is correct
67 Correct 6 ms 1048 KB Output is correct
68 Correct 5 ms 896 KB Output is correct
69 Correct 518 ms 73048 KB Output is correct
70 Correct 736 ms 79564 KB Output is correct
71 Correct 937 ms 97988 KB Output is correct
72 Correct 800 ms 83672 KB Output is correct
73 Correct 836 ms 87984 KB Output is correct
74 Correct 608 ms 65528 KB Output is correct
75 Correct 679 ms 77900 KB Output is correct