oj.uz

Submission #579781

# Submission time Handle Problem Language Result Execution time Memory
579781 2022-06-19T20:17:22 Z AugustinasJucas Carnival Tickets (IOI20_tickets) C++14
100 / 100
 824 ms 127512 KB 
#include <bits/stdc++.h>
#include "tickets.h"
using namespace std;
vector<vector<int> > mas, ans;
vector<vector<pair<int, int> > > maz, did, pos;
long long check(int n, int m, int k) {
    vector<vector<int> > vec(m);
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            if(ans[i][j] == -1) continue;
            vec[ans[i][j]].push_back(mas[i][j]);
        }
    }
    long long ret = 0;
    for(int i = 0; i < k; i++) {
        sort(vec[i].begin(), vec[i].end());
        for(int j = 0; j < vec[i].size(); j++) {
            if(j < vec[i].size() / 2) {
                ret -= vec[i][j];
            }else {
                ret += vec[i][j];
            }
        }
    }
    return ret;
}
/*
2 3 3
1 2 3
3 1 4
*/
long long find_maximum(int k, vector<vector<int> > x) {
    int n = x.size();
    int m = x[0].size();
    mas = ans = x;
    for(auto &x : ans) for(auto &y : x) y = -1;
    maz.resize(n); did.resize(n); pos.resize(n);
    long long sum = 0;
    priority_queue<pair<long long, int> > q;
    for(int i = 0; i < n; i++) {
        vector<pair<int, int> > dd, mm;
        for(int j = 0; j < m; j++) {
            dd.push_back({x[i][j], j});
            mm.push_back({x[i][j], j});
        }
        sort(mm.begin(), mm.end());
        sort(dd.begin(), dd.end());
        reverse(dd.begin(), dd.end());
        for(int j = 0; j < k; j++) {
            sum -= mm[j].first; 
            maz[i].push_back(mm[j]);
            pos[i].push_back(dd[j]);
        }
        reverse(pos[i].begin(), pos[i].end());
            
        q.push({pos[i].back().first + maz[i].back().first, i});
    }
    //cout << "kai visi minusai, sum = " << sum << endl;
    for(int i = 0; i < n * k / 2; i++) {
        long long pl = q.top().first;
        int ind = q.top().second;
        q.pop();
        sum += pl;
        //cout << "taciau galiu paimti ir sukeisti eileje " << ind << ", " << maz[ind].back().second << " su " << pos[ind].back().second << endl;
        maz[ind].pop_back();
        did[ind].push_back(pos[ind].back());
        pos[ind].pop_back();

        if(pos[ind].size()) {
            q.push({pos[ind].back().first + maz[ind].back().first, ind});
        }
    }
    /*cout << "taigi:\n";
    for(int i = 0; i < n; i++) {
        cout << "eileje " << i << ", minusai: "; for(auto &x : maz[i]) cout << x.second << " ";
        cout << ", pliusai: "; for(auto x : did[i]) cout << x.second <<  " ";
        cout << endl;
    }*/
    /*
    for(int i = 0; i < n; i++) {
        for(auto &x : maz[i]) ans[]
    } */
    
    vector<pair<int, int> > bal (k);
    for(int i = 0; i < k; i++) {
        bal[i] = {0, i};
    }
  //  cout << "start" << endl;
    for(int i = 0; i < n; i++) {
        int i1 = 0; int i2 = 0;
        for(int jj = 0; jj < k; jj++) {
            int j = bal[jj].second;
            if(i1 == did[i].size()) {
                ans[i][maz[i][i2].second] = j; 
                i2++;
            }else {
                if(bal[jj].first != n / 2) {
                    ans[i][did[i][i1].second] = j;
                    i1++;
                    bal[jj].first++;
                }else {
//                    cout << "i2 = " << i2 << ", maz[i].size() = " << maz[i].size() << endl;
                    ans[i][maz[i][i2].second] = j; 
                    i2++;
                }
            }
        }
        sort(bal.begin(), bal.end());
    }


    allocate_tickets(ans);
    
    //auto turi = check(n, m,k);
    //cout << "turi " << turi << endl;
    return sum;

/*

2 3 2
0 2 5
1 1 3

4 2 1
5 9
1 4
3 6
2 7



*/
	//allocate_tickets(answer);
}

Compilation message

tickets.cpp: In function 'long long int check(int, int, int)':
tickets.cpp:17:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |         for(int j = 0; j < vec[i].size(); j++) {
      |                        ~~^~~~~~~~~~~~~~~
tickets.cpp:18:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |             if(j < vec[i].size() / 2) {
      |                ~~^~~~~~~~~~~~~~~~~~~
tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:93:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |             if(i1 == did[i].size()) {
      |                ~~~^~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.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 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 2 ms 980 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 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 27 ms 2784 KB Output is correct
6 Correct 557 ms 60408 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 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 24 ms 4352 KB Output is correct
6 Correct 620 ms 99188 KB Output is correct
7 Correct 642 ms 101420 KB Output is correct
8 Correct 4 ms 852 KB Output is correct
9 Correct 1 ms 296 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 7 ms 1344 KB Output is correct
13 Correct 22 ms 3772 KB Output is correct
14 Correct 22 ms 3952 KB Output is correct
15 Correct 660 ms 117544 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 0 ms 212 KB Output is correct
4 Correct 3 ms 724 KB Output is correct
5 Correct 34 ms 6756 KB Output is correct
6 Correct 6 ms 1236 KB Output is correct
7 Correct 7 ms 1680 KB Output is correct
8 Correct 820 ms 124648 KB Output is correct
9 Correct 767 ms 116208 KB Output is correct
10 Correct 759 ms 114336 KB Output is correct
11 Correct 813 ms 122568 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 468 KB Output is correct
3 Correct 3 ms 500 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 3 ms 568 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 296 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 3 ms 596 KB Output is correct
11 Correct 4 ms 724 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 468 KB Output is correct
3 Correct 3 ms 500 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 3 ms 568 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 296 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 3 ms 596 KB Output is correct
11 Correct 4 ms 724 KB Output is correct
12 Correct 3 ms 724 KB Output is correct
13 Correct 23 ms 3648 KB Output is correct
14 Correct 24 ms 3720 KB Output is correct
15 Correct 28 ms 5196 KB Output is correct
16 Correct 32 ms 6732 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 3 ms 596 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 27 ms 4580 KB Output is correct
21 Correct 30 ms 4940 KB Output is correct
22 Correct 32 ms 5932 KB Output is correct
23 Correct 31 ms 6424 KB Output is correct

Subtask #7
10.0 / 10.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 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 2 ms 980 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 27 ms 2784 KB Output is correct
12 Correct 557 ms 60408 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 2 ms 596 KB Output is correct
17 Correct 24 ms 4352 KB Output is correct
18 Correct 620 ms 99188 KB Output is correct
19 Correct 642 ms 101420 KB Output is correct
20 Correct 4 ms 852 KB Output is correct
21 Correct 1 ms 296 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 7 ms 1344 KB Output is correct
25 Correct 22 ms 3772 KB Output is correct
26 Correct 22 ms 3952 KB Output is correct
27 Correct 660 ms 117544 KB Output is correct
28 Correct 0 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 724 KB Output is correct
32 Correct 34 ms 6756 KB Output is correct
33 Correct 6 ms 1236 KB Output is correct
34 Correct 7 ms 1680 KB Output is correct
35 Correct 820 ms 124648 KB Output is correct
36 Correct 767 ms 116208 KB Output is correct
37 Correct 759 ms 114336 KB Output is correct
38 Correct 813 ms 122568 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 2 ms 468 KB Output is correct
41 Correct 3 ms 500 KB Output is correct
42 Correct 2 ms 596 KB Output is correct
43 Correct 3 ms 596 KB Output is correct
44 Correct 3 ms 568 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 296 KB Output is correct
47 Correct 2 ms 596 KB Output is correct
48 Correct 3 ms 596 KB Output is correct
49 Correct 4 ms 724 KB Output is correct
50 Correct 3 ms 724 KB Output is correct
51 Correct 23 ms 3648 KB Output is correct
52 Correct 24 ms 3720 KB Output is correct
53 Correct 28 ms 5196 KB Output is correct
54 Correct 32 ms 6732 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 3 ms 596 KB Output is correct
57 Correct 2 ms 468 KB Output is correct
58 Correct 27 ms 4580 KB Output is correct
59 Correct 30 ms 4940 KB Output is correct
60 Correct 32 ms 5932 KB Output is correct
61 Correct 31 ms 6424 KB Output is correct
62 Correct 63 ms 9500 KB Output is correct
63 Correct 64 ms 9648 KB Output is correct
64 Correct 90 ms 15092 KB Output is correct
65 Correct 297 ms 49156 KB Output is correct
66 Correct 359 ms 59004 KB Output is correct
67 Correct 7 ms 1648 KB Output is correct
68 Correct 6 ms 1204 KB Output is correct
69 Correct 584 ms 64768 KB Output is correct
70 Correct 687 ms 101252 KB Output is correct
71 Correct 824 ms 127512 KB Output is correct
72 Correct 715 ms 124852 KB Output is correct
73 Correct 784 ms 118348 KB Output is correct
74 Correct 623 ms 102348 KB Output is correct
75 Correct 708 ms 96592 KB Output is correct