oj.uz

답안 #398025

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
398025 2021-05-03T14:34:38 Z Antekb 카니발 티켓 (IOI20_tickets) C++14
100 / 100
 843 ms 76164 KB 
        #include "tickets.h"
        #include <bits/stdc++.h>
        using namespace std;
        #define st first
        #define nd second
        #define mp(x, y) make_pair(x, y)
        #define pb(x) push_back(x)
        typedef pair<int, int> pii;
        typedef long long ll;
        long long find_maximum(int k, std::vector<std::vector<int>> x) {
            int n = x.size();
            int m = x[0].size();
            int ile[n], ile2[n];
            for(int i=0; i<n; i++){
                ile[i]=k;
                ile2[i]=m-1;
            }
            ll ans=0;
            for(int i=0; i<n; i++)for(int j=0; j<k; j++)ans-=x[i][j];
            std::vector<std::vector<int>> answer;
            for (int i = 0; i < n; i++) {
                std::vector<int> row(m);
                answer.pb(row);
            }
            priority_queue<pair<int, int> > Q;
            for(int j=0; j<n; j++){ 
                Q.push(mp(x[j][k-1]+x[j][m-1], j));
            }
            for(int i=0; i<k*n/2; i++){
                auto a=Q.top();
                Q.pop();
                ans+=a.st;
                ile2[a.nd]--;
                if(--ile[a.nd])Q.push(mp(x[a.nd][ile2[a.nd]]+x[a.nd][ile[a.nd]-1], a.nd));
            }
            for(int i=1; i<=k; i++){
                vector<int> todo;
                int a=0, b=0;
                for(int j=0; j<n; j++){
                    if(ile[j]==0)a++, answer[j][++ile2[j]]=i;
                    else if(ile2[j]==m-1)b++, answer[j][--ile[j]]=i;
                    else todo.pb(j);
                }
                for(int j:todo){
                    if(a<n/2){
                        a++;
                        answer[j][++ile2[j]]=i;
                    }
                    else{
                        b++;
                        answer[j][--ile[j]]=i;
                    }
                }
            }
            for(auto &i:answer){
                for(auto &j:i)j--;
            }
            allocate_tickets(answer);
            return ans;
        }

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 3 ms 716 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 484 KB Output is correct
5 Correct 28 ms 3140 KB Output is correct
6 Correct 651 ms 53672 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 436 KB Output is correct
5 Correct 25 ms 2492 KB Output is correct
6 Correct 629 ms 56660 KB Output is correct
7 Correct 655 ms 57240 KB Output is correct
8 Correct 4 ms 460 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 7 ms 844 KB Output is correct
13 Correct 22 ms 2176 KB Output is correct
14 Correct 22 ms 2072 KB Output is correct
15 Correct 678 ms 57836 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 32 ms 3284 KB Output is correct
6 Correct 6 ms 716 KB Output is correct
7 Correct 7 ms 972 KB Output is correct
8 Correct 830 ms 55044 KB Output is correct
9 Correct 773 ms 51260 KB Output is correct
10 Correct 773 ms 51352 KB Output is correct
11 Correct 831 ms 54980 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 3 ms 460 KB Output is correct
3 Correct 3 ms 460 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 3 ms 460 KB Output is correct
6 Correct 3 ms 460 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 3 ms 460 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 3 ms 476 KB Output is correct
12 Correct 3 ms 436 KB Output is correct

Subtask #6
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 3 ms 460 KB Output is correct
3 Correct 3 ms 460 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 3 ms 460 KB Output is correct
6 Correct 3 ms 460 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 3 ms 460 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 3 ms 476 KB Output is correct
12 Correct 3 ms 436 KB Output is correct
13 Correct 27 ms 3208 KB Output is correct
14 Correct 30 ms 3244 KB Output is correct
15 Correct 30 ms 3140 KB Output is correct
16 Correct 40 ms 3228 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 3 ms 460 KB Output is correct
19 Correct 2 ms 440 KB Output is correct
20 Correct 27 ms 2580 KB Output is correct
21 Correct 33 ms 3076 KB Output is correct
22 Correct 29 ms 2680 KB Output is correct
23 Correct 36 ms 3140 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 3 ms 716 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 3 ms 484 KB Output is correct
11 Correct 28 ms 3140 KB Output is correct
12 Correct 651 ms 53672 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 3 ms 436 KB Output is correct
17 Correct 25 ms 2492 KB Output is correct
18 Correct 629 ms 56660 KB Output is correct
19 Correct 655 ms 57240 KB Output is correct
20 Correct 4 ms 460 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 7 ms 844 KB Output is correct
25 Correct 22 ms 2176 KB Output is correct
26 Correct 22 ms 2072 KB Output is correct
27 Correct 678 ms 57836 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 3 ms 460 KB Output is correct
32 Correct 32 ms 3284 KB Output is correct
33 Correct 6 ms 716 KB Output is correct
34 Correct 7 ms 972 KB Output is correct
35 Correct 830 ms 55044 KB Output is correct
36 Correct 773 ms 51260 KB Output is correct
37 Correct 773 ms 51352 KB Output is correct
38 Correct 831 ms 54980 KB Output is correct
39 Correct 1 ms 256 KB Output is correct
40 Correct 3 ms 460 KB Output is correct
41 Correct 3 ms 460 KB Output is correct
42 Correct 3 ms 460 KB Output is correct
43 Correct 3 ms 460 KB Output is correct
44 Correct 3 ms 460 KB Output is correct
45 Correct 1 ms 204 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 3 ms 460 KB Output is correct
48 Correct 3 ms 460 KB Output is correct
49 Correct 3 ms 476 KB Output is correct
50 Correct 3 ms 436 KB Output is correct
51 Correct 27 ms 3208 KB Output is correct
52 Correct 30 ms 3244 KB Output is correct
53 Correct 30 ms 3140 KB Output is correct
54 Correct 40 ms 3228 KB Output is correct
55 Correct 2 ms 332 KB Output is correct
56 Correct 3 ms 460 KB Output is correct
57 Correct 2 ms 440 KB Output is correct
58 Correct 27 ms 2580 KB Output is correct
59 Correct 33 ms 3076 KB Output is correct
60 Correct 29 ms 2680 KB Output is correct
61 Correct 36 ms 3140 KB Output is correct
62 Correct 75 ms 8424 KB Output is correct
63 Correct 80 ms 8400 KB Output is correct
64 Correct 92 ms 8624 KB Output is correct
65 Correct 336 ms 33104 KB Output is correct
66 Correct 365 ms 33576 KB Output is correct
67 Correct 7 ms 972 KB Output is correct
68 Correct 6 ms 716 KB Output is correct
69 Correct 673 ms 73156 KB Output is correct
70 Correct 791 ms 74128 KB Output is correct
71 Correct 843 ms 76164 KB Output is correct
72 Correct 731 ms 60560 KB Output is correct
73 Correct 808 ms 73400 KB Output is correct
74 Correct 652 ms 59080 KB Output is correct
75 Correct 736 ms 71888 KB Output is correct