Submission #639468

# Submission time Handle Problem Language Result Execution time Memory
639468 2022-09-10T04:35:39 Z slime Carnival Tickets (IOI20_tickets) C++14
100 / 100
920 ms 98144 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 1 ms 212 KB Output is correct
3 Correct 1 ms 212 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 668 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 23 ms 3152 KB Output is correct
6 Correct 576 ms 73032 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 212 KB Output is correct
4 Correct 2 ms 444 KB Output is correct
5 Correct 22 ms 2768 KB Output is correct
6 Correct 589 ms 62216 KB Output is correct
7 Correct 597 ms 66644 KB Output is correct
8 Correct 4 ms 724 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 7 ms 920 KB Output is correct
13 Correct 19 ms 2528 KB Output is correct
14 Correct 21 ms 2572 KB Output is correct
15 Correct 638 ms 70204 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 0 ms 212 KB Output is correct
4 Correct 3 ms 596 KB Output is correct
5 Correct 40 ms 3960 KB Output is correct
6 Correct 5 ms 924 KB Output is correct
7 Correct 6 ms 1152 KB Output is correct
8 Correct 920 ms 97944 KB Output is correct
9 Correct 812 ms 94864 KB Output is correct
10 Correct 806 ms 94856 KB Output is correct
11 Correct 876 ms 98108 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 4 ms 596 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 3 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 3 ms 596 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 4 ms 596 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 3 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 3 ms 596 KB Output is correct
13 Correct 21 ms 3284 KB Output is correct
14 Correct 22 ms 3272 KB Output is correct
15 Correct 27 ms 3432 KB Output is correct
16 Correct 32 ms 3968 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 1 ms 436 KB Output is correct
20 Correct 31 ms 3048 KB Output is correct
21 Correct 35 ms 3524 KB Output is correct
22 Correct 37 ms 3328 KB Output is correct
23 Correct 39 ms 3872 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 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 668 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 23 ms 3152 KB Output is correct
12 Correct 576 ms 73032 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 212 KB Output is correct
16 Correct 2 ms 444 KB Output is correct
17 Correct 22 ms 2768 KB Output is correct
18 Correct 589 ms 62216 KB Output is correct
19 Correct 597 ms 66644 KB Output is correct
20 Correct 4 ms 724 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 7 ms 920 KB Output is correct
25 Correct 19 ms 2528 KB Output is correct
26 Correct 21 ms 2572 KB Output is correct
27 Correct 638 ms 70204 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 3 ms 596 KB Output is correct
32 Correct 40 ms 3960 KB Output is correct
33 Correct 5 ms 924 KB Output is correct
34 Correct 6 ms 1152 KB Output is correct
35 Correct 920 ms 97944 KB Output is correct
36 Correct 812 ms 94864 KB Output is correct
37 Correct 806 ms 94856 KB Output is correct
38 Correct 876 ms 98108 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 2 ms 468 KB Output is correct
41 Correct 2 ms 468 KB Output is correct
42 Correct 2 ms 512 KB Output is correct
43 Correct 2 ms 468 KB Output is correct
44 Correct 4 ms 596 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 3 ms 468 KB Output is correct
48 Correct 2 ms 468 KB Output is correct
49 Correct 3 ms 468 KB Output is correct
50 Correct 3 ms 596 KB Output is correct
51 Correct 21 ms 3284 KB Output is correct
52 Correct 22 ms 3272 KB Output is correct
53 Correct 27 ms 3432 KB Output is correct
54 Correct 32 ms 3968 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 2 ms 468 KB Output is correct
57 Correct 1 ms 436 KB Output is correct
58 Correct 31 ms 3048 KB Output is correct
59 Correct 35 ms 3524 KB Output is correct
60 Correct 37 ms 3328 KB Output is correct
61 Correct 39 ms 3872 KB Output is correct
62 Correct 59 ms 8412 KB Output is correct
63 Correct 70 ms 8396 KB Output is correct
64 Correct 112 ms 10556 KB Output is correct
65 Correct 271 ms 35596 KB Output is correct
66 Correct 419 ms 41388 KB Output is correct
67 Correct 6 ms 1048 KB Output is correct
68 Correct 7 ms 924 KB Output is correct
69 Correct 545 ms 73176 KB Output is correct
70 Correct 687 ms 79492 KB Output is correct
71 Correct 879 ms 98144 KB Output is correct
72 Correct 759 ms 83948 KB Output is correct
73 Correct 808 ms 88036 KB Output is correct
74 Correct 585 ms 65512 KB Output is correct
75 Correct 677 ms 77820 KB Output is correct