oj.uz

답안 #863727

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
863727 2023-10-20T18:20:25 Z JakobZorz 카니발 티켓 (IOI20_tickets) C++17
100 / 100
 866 ms 76368 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;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 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 16 ms 2396 KB Output is correct
6 Correct 384 ms 51460 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 16 ms 2652 KB Output is correct
6 Correct 398 ms 57068 KB Output is correct
7 Correct 435 ms 57204 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 388 KB Output is correct
11 Correct 0 ms 436 KB Output is correct
12 Correct 5 ms 1016 KB Output is correct
13 Correct 16 ms 2140 KB Output is correct
14 Correct 15 ms 2136 KB Output is correct
15 Correct 461 ms 57680 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 544 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 444 KB Output is correct
5 Correct 29 ms 3420 KB Output is correct
6 Correct 5 ms 856 KB Output is correct
7 Correct 6 ms 1112 KB Output is correct
8 Correct 866 ms 76232 KB Output is correct
9 Correct 716 ms 71048 KB Output is correct
10 Correct 723 ms 71300 KB Output is correct
11 Correct 799 ms 76152 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 600 KB Output is correct
7 Correct 1 ms 456 KB Output is correct
8 Correct 1 ms 348 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 476 KB Output is correct
12 Correct 2 ms 604 KB Output is correct

Subtask #6
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 600 KB Output is correct
7 Correct 1 ms 456 KB Output is correct
8 Correct 1 ms 348 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 476 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 19 ms 3164 KB Output is correct
14 Correct 17 ms 3160 KB Output is correct
15 Correct 29 ms 3488 KB Output is correct
16 Correct 30 ms 3408 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 23 ms 2652 KB Output is correct
21 Correct 23 ms 3064 KB Output is correct
22 Correct 29 ms 2648 KB Output is correct
23 Correct 26 ms 3160 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 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 600 KB Output is correct
8 Correct 0 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 16 ms 2396 KB Output is correct
12 Correct 384 ms 51460 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 16 ms 2652 KB Output is correct
18 Correct 398 ms 57068 KB Output is correct
19 Correct 435 ms 57204 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 388 KB Output is correct
23 Correct 0 ms 436 KB Output is correct
24 Correct 5 ms 1016 KB Output is correct
25 Correct 16 ms 2140 KB Output is correct
26 Correct 15 ms 2136 KB Output is correct
27 Correct 461 ms 57680 KB Output is correct
28 Correct 0 ms 544 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 2 ms 444 KB Output is correct
32 Correct 29 ms 3420 KB Output is correct
33 Correct 5 ms 856 KB Output is correct
34 Correct 6 ms 1112 KB Output is correct
35 Correct 866 ms 76232 KB Output is correct
36 Correct 716 ms 71048 KB Output is correct
37 Correct 723 ms 71300 KB Output is correct
38 Correct 799 ms 76152 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 2 ms 348 KB Output is correct
42 Correct 2 ms 604 KB Output is correct
43 Correct 2 ms 604 KB Output is correct
44 Correct 2 ms 600 KB Output is correct
45 Correct 1 ms 456 KB Output is correct
46 Correct 1 ms 348 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 476 KB Output is correct
50 Correct 2 ms 604 KB Output is correct
51 Correct 19 ms 3164 KB Output is correct
52 Correct 17 ms 3160 KB Output is correct
53 Correct 29 ms 3488 KB Output is correct
54 Correct 30 ms 3408 KB Output is correct
55 Correct 1 ms 348 KB Output is correct
56 Correct 2 ms 604 KB Output is correct
57 Correct 2 ms 348 KB Output is correct
58 Correct 23 ms 2652 KB Output is correct
59 Correct 23 ms 3064 KB Output is correct
60 Correct 29 ms 2648 KB Output is correct
61 Correct 26 ms 3160 KB Output is correct
62 Correct 44 ms 8528 KB Output is correct
63 Correct 48 ms 8356 KB Output is correct
64 Correct 85 ms 8532 KB Output is correct
65 Correct 260 ms 33104 KB Output is correct
66 Correct 359 ms 33620 KB Output is correct
67 Correct 6 ms 1116 KB Output is correct
68 Correct 4 ms 860 KB Output is correct
69 Correct 392 ms 73296 KB Output is correct
70 Correct 597 ms 74244 KB Output is correct
71 Correct 833 ms 76368 KB Output is correct
72 Correct 724 ms 60748 KB Output is correct
73 Correct 707 ms 73296 KB Output is correct
74 Correct 563 ms 59204 KB Output is correct
75 Correct 570 ms 72128 KB Output is correct