oj.uz

Submission #782409

# Submission time Handle Problem Language Result Execution time Memory
782409 2023-07-13T23:28:42 Z jasmin Carnival Tickets (IOI20_tickets) C++17
100 / 100
 1694 ms 196384 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();
 
	vector<vector<int> > answer(n, vector<int> (m, -1));
    long long ans=0;
    vector<pair<int, pair<int,int> > > sorted;
    vector<set<pair<int,int> > > smaller(k);
    for(int i=0; i<n; i++){
        for(int j=0; j<k; j++){
            ans-=x[i][j];
            int indswap=m-(k-j);
            sorted.push_back({x[i][j]+x[i][indswap], {i, j}});
            answer[i][j]=j;
            smaller[j].insert({i, j});
        }
    }
    sort(sorted.begin(), sorted.end());
    reverse(sorted.begin(), sorted.end());
 
    //cout << ans << "\n";
 
    vector<set<pair<int,int> > > bigger(k);
    for(int i=0; i<(n*k)/2; i++){
 
        int gain=sorted[i].first;
        auto [ind, j]=sorted[i].second;
 
        int indswap = m-(k-j);
 
        ans += gain;
        smaller[j].erase({ind, j});
        bigger[j].insert({ind, indswap});
      swap(answer[ind][j], answer[ind][indswap]);
 
        //cout << "swap " << ind << " " << j << " => " << ans << "\n";
    }
 
    vector<int> manybig;
    vector<int> manysmall;
    for(int i=0; i<k; i++){
        if(bigger[i].size()>(n/2)){
            manybig.push_back(i);
        }
        else if(bigger[i].size()<(n/2)){
            manysmall.push_back(i);
        }
    }
 
    int mom=0;
    for(auto i: manybig){
 
        int cnt=0;
        while(bigger[i].size()-cnt > (n/2)){
 
            vector<pair<int,int> > gone;
            int inds=manysmall[mom];
 
            for(auto [ind, j]: bigger[i]){
                if(bigger[i].size()-cnt==(n/2)) break;
 
                auto it=smaller[inds].lower_bound({ind, 0});
 
                if(it!=smaller[inds].end() && (*it).first==ind){
                    swap(answer[ind][j], answer[ind][(*it).second]);
 
                    smaller[inds].erase(*it);
                    gone.push_back({ind, j});
                    cnt++;
                }
 
                if(smaller[manysmall[mom]].size()==(n/2)){
                    mom++;
                    break;
                }
            }
 
            for(auto e: gone){
                bigger[i].erase(e);
            }
            cnt=0;
        }
    }
 
    allocate_tickets(answer);
    return ans;
}

Compilation message

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:46:28: warning: comparison of integer expressions of different signedness: 'std::set<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   46 |         if(bigger[i].size()>(n/2)){
      |            ~~~~~~~~~~~~~~~~^~~~~~
tickets.cpp:49:33: warning: comparison of integer expressions of different signedness: 'std::set<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   49 |         else if(bigger[i].size()<(n/2)){
      |                 ~~~~~~~~~~~~~~~~^~~~~~
tickets.cpp:58:36: warning: comparison of integer expressions of different signedness: 'std::set<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   58 |         while(bigger[i].size()-cnt > (n/2)){
      |               ~~~~~~~~~~~~~~~~~~~~~^~~~~~~
tickets.cpp:64:40: warning: comparison of integer expressions of different signedness: 'std::set<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   64 |                 if(bigger[i].size()-cnt==(n/2)) break;
      |                    ~~~~~~~~~~~~~~~~~~~~^~~~~~~
tickets.cpp:76:50: warning: comparison of integer expressions of different signedness: 'std::set<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   76 |                 if(smaller[manysmall[mom]].size()==(n/2)){
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~

Subtask #1
11.0 / 11.0

# 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 0 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 724 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 17 ms 3236 KB Output is correct
6 Correct 437 ms 73120 KB Output is correct

Subtask #3
14.0 / 14.0

# 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 212 KB Output is correct
4 Correct 2 ms 544 KB Output is correct
5 Correct 24 ms 4880 KB Output is correct
6 Correct 716 ms 115236 KB Output is correct
7 Correct 827 ms 127776 KB Output is correct
8 Correct 4 ms 980 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 7 ms 1620 KB Output is correct
13 Correct 23 ms 4712 KB Output is correct
14 Correct 24 ms 5184 KB Output is correct
15 Correct 975 ms 148560 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 3 ms 752 KB Output is correct
5 Correct 45 ms 6868 KB Output is correct
6 Correct 8 ms 1620 KB Output is correct
7 Correct 9 ms 1660 KB Output is correct
8 Correct 1532 ms 176320 KB Output is correct
9 Correct 1454 ms 174720 KB Output is correct
10 Correct 1462 ms 174540 KB Output is correct
11 Correct 1694 ms 176664 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 436 KB Output is correct
3 Correct 2 ms 440 KB Output is correct
4 Correct 3 ms 596 KB Output is correct
5 Correct 2 ms 568 KB Output is correct
6 Correct 3 ms 696 KB Output is correct
7 Correct 1 ms 304 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 3 ms 596 KB Output is correct
10 Correct 3 ms 620 KB Output is correct
11 Correct 3 ms 700 KB Output is correct
12 Correct 3 ms 724 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 436 KB Output is correct
3 Correct 2 ms 440 KB Output is correct
4 Correct 3 ms 596 KB Output is correct
5 Correct 2 ms 568 KB Output is correct
6 Correct 3 ms 696 KB Output is correct
7 Correct 1 ms 304 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 3 ms 596 KB Output is correct
10 Correct 3 ms 620 KB Output is correct
11 Correct 3 ms 700 KB Output is correct
12 Correct 3 ms 724 KB Output is correct
13 Correct 17 ms 3268 KB Output is correct
14 Correct 18 ms 3412 KB Output is correct
15 Correct 38 ms 4924 KB Output is correct
16 Correct 44 ms 7568 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 596 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 33 ms 5472 KB Output is correct
21 Correct 34 ms 5760 KB Output is correct
22 Correct 41 ms 6656 KB Output is correct
23 Correct 42 ms 7004 KB Output is correct

Subtask #7
10.0 / 10.0

# 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 0 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 724 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 17 ms 3236 KB Output is correct
12 Correct 437 ms 73120 KB Output is correct
13 Correct 0 ms 212 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 544 KB Output is correct
17 Correct 24 ms 4880 KB Output is correct
18 Correct 716 ms 115236 KB Output is correct
19 Correct 827 ms 127776 KB Output is correct
20 Correct 4 ms 980 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 300 KB Output is correct
24 Correct 7 ms 1620 KB Output is correct
25 Correct 23 ms 4712 KB Output is correct
26 Correct 24 ms 5184 KB Output is correct
27 Correct 975 ms 148560 KB Output is correct
28 Correct 0 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 3 ms 752 KB Output is correct
32 Correct 45 ms 6868 KB Output is correct
33 Correct 8 ms 1620 KB Output is correct
34 Correct 9 ms 1660 KB Output is correct
35 Correct 1532 ms 176320 KB Output is correct
36 Correct 1454 ms 174720 KB Output is correct
37 Correct 1462 ms 174540 KB Output is correct
38 Correct 1694 ms 176664 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 2 ms 436 KB Output is correct
41 Correct 2 ms 440 KB Output is correct
42 Correct 3 ms 596 KB Output is correct
43 Correct 2 ms 568 KB Output is correct
44 Correct 3 ms 696 KB Output is correct
45 Correct 1 ms 304 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 3 ms 596 KB Output is correct
48 Correct 3 ms 620 KB Output is correct
49 Correct 3 ms 700 KB Output is correct
50 Correct 3 ms 724 KB Output is correct
51 Correct 17 ms 3268 KB Output is correct
52 Correct 18 ms 3412 KB Output is correct
53 Correct 38 ms 4924 KB Output is correct
54 Correct 44 ms 7568 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 2 ms 596 KB Output is correct
57 Correct 2 ms 468 KB Output is correct
58 Correct 33 ms 5472 KB Output is correct
59 Correct 34 ms 5760 KB Output is correct
60 Correct 41 ms 6656 KB Output is correct
61 Correct 42 ms 7004 KB Output is correct
62 Correct 46 ms 8492 KB Output is correct
63 Correct 48 ms 8620 KB Output is correct
64 Correct 130 ms 20400 KB Output is correct
65 Correct 385 ms 51232 KB Output is correct
66 Correct 597 ms 80652 KB Output is correct
67 Correct 9 ms 1620 KB Output is correct
68 Correct 6 ms 1588 KB Output is correct
69 Correct 418 ms 73704 KB Output is correct
70 Correct 982 ms 122428 KB Output is correct
71 Correct 1577 ms 196384 KB Output is correct
72 Correct 1257 ms 182036 KB Output is correct
73 Correct 1452 ms 166464 KB Output is correct
74 Correct 887 ms 113560 KB Output is correct
75 Correct 1038 ms 123932 KB Output is correct