oj.uz

Submission #853808

# Submission time Handle Problem Language Result Execution time Memory
853808 2023-09-25T09:24:00 Z ntkphong Carnival Tickets (IOI20_tickets) C++14
100 / 100
 878 ms 76380 KB 
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;

long long find_maximum(int k, vector<vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	
	vector<vector<int>> answer(n, vector<int> (m, -1));
    
    int timer = 0;
    long long sum = 0;
    vector<int> l(n, 0), r(n, 0), rr(n, 0);
    
    for(int i = 0; i < n; i ++) {
        l[i] = 0;
        r[i] = m - 1 - k + 1;
    
        timer += k;
    
        for(int j = 0; j < k; j ++) 
            sum += x[i][m - 1 - j];
    }
    
    for(int i = 0; i < n; i ++) rr[i] = m - 1;
    
    priority_queue<array<int, 2>> pq;
    
    for(int i = 0; i < n; i ++) {
        int L = l[i];
        int R = r[i];
        
        pq.push({- x[i][L] - x[i][R], i});
    }
    
    while(!pq.empty() && timer > k * n / 2) {
        int c = pq.top()[0];
        int i = pq.top()[1];
        pq.pop();
        
        sum += c;
        l[i] ++ ;
        r[i] ++ ;
        timer --;
        
        if(r[i] < m) {
            int L = l[i];
            int R = r[i];
            pq.push({- x[i][L] - x[i][R], i});
        }
    }
    
    for(int j = 0; j < k; j ++) {
        vector<array<int, 3>> p; 
        
        vector<int> mark(n, 0);
        int cnt = 0, _cnt = 0;
        
        for(int i = 0; i < n; i ++) {
            if(l[i] > 0 && rr[i] >= r[i]) {
                p.push_back({x[i][l[i] - 1], i, 0});
                p.push_back({x[i][rr[i]], i, 1});
                continue ;
            }
            
            if(l[i] > 0) {
                cnt ++ ;
                mark[i] = 1;
                answer[i][l[i] - 1] = j;
                l[i] -- ;
                
                continue ;
            }
            
            if(rr[i] >= r[i]) {
                _cnt ++ ;
                mark[i] = 1;
                answer[i][rr[i]] = j;
                rr[i] -- ;
            }
        }
        
        sort(p.begin(), p.end());
        reverse(p.begin(), p.end());
        
        for(auto [c, i, type] : p) {
            if(mark[i]) continue ;
            
            if(type == 0 && cnt < n / 2) {
                cnt ++ ;
                mark[i] = 1;
                answer[i][l[i] - 1] = j;
                l[i] -- ;
            }
            
            if(type == 1 && _cnt < n / 2) {
                _cnt ++ ;
                mark[i] = 1;
                answer[i][rr[i]] = j;
                rr[i] -- ;
            }
        }
    }
	
	allocate_tickets(answer);
	
	return sum;
}

Compilation message

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:86:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   86 |         for(auto [c, i, type] : p) {
      |                  ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 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 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 16 ms 2392 KB Output is correct
6 Correct 420 ms 51496 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 2 ms 600 KB Output is correct
5 Correct 15 ms 2648 KB Output is correct
6 Correct 368 ms 56752 KB Output is correct
7 Correct 415 ms 57168 KB Output is correct
8 Correct 3 ms 600 KB Output is correct
9 Correct 0 ms 600 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 5 ms 856 KB Output is correct
13 Correct 15 ms 2100 KB Output is correct
14 Correct 15 ms 2136 KB Output is correct
15 Correct 461 ms 57776 KB Output is correct

Subtask #4
14.0 / 14.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 0 ms 344 KB Output is correct
4 Correct 2 ms 600 KB Output is correct
5 Correct 41 ms 3408 KB Output is correct
6 Correct 4 ms 860 KB Output is correct
7 Correct 6 ms 1112 KB Output is correct
8 Correct 878 ms 76052 KB Output is correct
9 Correct 725 ms 71344 KB Output is correct
10 Correct 703 ms 71248 KB Output is correct
11 Correct 754 ms 76232 KB Output is correct

Subtask #5
12.0 / 12.0

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

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 2 ms 600 KB Output is correct
4 Correct 2 ms 600 KB Output is correct
5 Correct 2 ms 600 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 600 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 2 ms 600 KB Output is correct
13 Correct 17 ms 3160 KB Output is correct
14 Correct 18 ms 3548 KB Output is correct
15 Correct 22 ms 3152 KB Output is correct
16 Correct 29 ms 3412 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 2 ms 600 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 24 ms 2788 KB Output is correct
21 Correct 24 ms 3260 KB Output is correct
22 Correct 27 ms 2580 KB Output is correct
23 Correct 26 ms 3152 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 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 16 ms 2392 KB Output is correct
12 Correct 420 ms 51496 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 2 ms 600 KB Output is correct
17 Correct 15 ms 2648 KB Output is correct
18 Correct 368 ms 56752 KB Output is correct
19 Correct 415 ms 57168 KB Output is correct
20 Correct 3 ms 600 KB Output is correct
21 Correct 0 ms 600 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 5 ms 856 KB Output is correct
25 Correct 15 ms 2100 KB Output is correct
26 Correct 15 ms 2136 KB Output is correct
27 Correct 461 ms 57776 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 2 ms 600 KB Output is correct
32 Correct 41 ms 3408 KB Output is correct
33 Correct 4 ms 860 KB Output is correct
34 Correct 6 ms 1112 KB Output is correct
35 Correct 878 ms 76052 KB Output is correct
36 Correct 725 ms 71344 KB Output is correct
37 Correct 703 ms 71248 KB Output is correct
38 Correct 754 ms 76232 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 1 ms 604 KB Output is correct
41 Correct 2 ms 600 KB Output is correct
42 Correct 2 ms 600 KB Output is correct
43 Correct 2 ms 600 KB Output is correct
44 Correct 2 ms 604 KB Output is correct
45 Correct 1 ms 344 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 2 ms 600 KB Output is correct
48 Correct 2 ms 600 KB Output is correct
49 Correct 2 ms 600 KB Output is correct
50 Correct 2 ms 600 KB Output is correct
51 Correct 17 ms 3160 KB Output is correct
52 Correct 18 ms 3548 KB Output is correct
53 Correct 22 ms 3152 KB Output is correct
54 Correct 29 ms 3412 KB Output is correct
55 Correct 1 ms 344 KB Output is correct
56 Correct 2 ms 600 KB Output is correct
57 Correct 1 ms 344 KB Output is correct
58 Correct 24 ms 2788 KB Output is correct
59 Correct 24 ms 3260 KB Output is correct
60 Correct 27 ms 2580 KB Output is correct
61 Correct 26 ms 3152 KB Output is correct
62 Correct 42 ms 8464 KB Output is correct
63 Correct 44 ms 8528 KB Output is correct
64 Correct 92 ms 8724 KB Output is correct
65 Correct 257 ms 33104 KB Output is correct
66 Correct 352 ms 33616 KB Output is correct
67 Correct 6 ms 1112 KB Output is correct
68 Correct 4 ms 856 KB Output is correct
69 Correct 390 ms 73200 KB Output is correct
70 Correct 595 ms 74256 KB Output is correct
71 Correct 827 ms 76380 KB Output is correct
72 Correct 714 ms 60760 KB Output is correct
73 Correct 715 ms 73296 KB Output is correct
74 Correct 551 ms 59216 KB Output is correct
75 Correct 553 ms 71904 KB Output is correct