oj.uz

Submission #593586

# Submission time Handle Problem Language Result Execution time Memory
593586 2022-07-11T12:16:10 Z keta_tsimakuridze Carnival Tickets (IOI20_tickets) C++14
100 / 100
 2957 ms 178268 KB 
#include "tickets.h"
#include <vector>
#include<bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pii pair<int,int>
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<pair<int, int> > v;
	vector<int> l(n), r(n);
	vector<vector<pii> > b(n);
	ll ans = 0;
	multiset<pii> s;
	vector<int> LF(n);
	for(int i = 0; i < n; i++) {
        LF[i] = k;
        for(int j = 0; j < k; j++) {
            ans -= x[i][j];
            s.insert({x[i][m - (k - j)] + x[i][j], i});
        }
	}

	for(int i = 0; i < n * k / 2; i++) {
        pii x = *--s.end(); s.erase(s.find(x));
        ans += x.f;
        --LF[x.s];
	}
	for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            if(j < LF[i] || j >= m - (k - LF[i]))
            v.push_back({x[i][j], i});
            b[i].push_back({x[i][j], j});
        }
        sort(b[i].begin(), b[i].end());
        r[i] = m;
	}


	sort(v.begin(), v.end());
	vector<int> cn(n);

	for(int i = 0; i < v.size(); i++) {
        if(i < v.size() / 2) cn[v[i].s]--;
        else cn[v[i].s]++;
    }
    vector<vector<int> > u;
    u.resize(n, vector<int> (m));
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) u[i][j] = -1;
    }
    while(k--) {

        vector<pii> x;
        for(int i = 0; i < n; i++) x.push_back({cn[i], i});
        sort(x.begin(), x.end());

        for(int i = 0; i < x.size(); i++) {
            int id = x[i].s;
            if(i < x.size() / 2) {
                u[id][b[id][l[id]++].s] = k;
                cn[id]++;
            } else u[id][b[id][--r[id]].s] = k, cn[id]--;
        }

    }
    allocate_tickets(u);
    return ans;

}

Compilation message

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:45: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]
   45 |  for(int i = 0; i < v.size(); i++) {
      |                 ~~^~~~~~~~~~
tickets.cpp:46:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |         if(i < v.size() / 2) cn[v[i].s]--;
      |            ~~^~~~~~~~~~~~~~
tickets.cpp:60:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |         for(int i = 0; i < x.size(); i++) {
      |                        ~~^~~~~~~~~~
tickets.cpp:62:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |             if(i < x.size() / 2) {
      |                ~~^~~~~~~~~~~~~~

Subtask #1
11.0 / 11.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 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 852 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 0 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 21 ms 3596 KB Output is correct
6 Correct 549 ms 75076 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 0 ms 212 KB Output is correct
4 Correct 3 ms 596 KB Output is correct
5 Correct 32 ms 4952 KB Output is correct
6 Correct 822 ms 109640 KB Output is correct
7 Correct 975 ms 124624 KB Output is correct
8 Correct 5 ms 1028 KB Output is correct
9 Correct 1 ms 296 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 9 ms 1528 KB Output is correct
13 Correct 28 ms 4664 KB Output is correct
14 Correct 30 ms 4508 KB Output is correct
15 Correct 1035 ms 132448 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 296 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 4 ms 852 KB Output is correct
5 Correct 60 ms 6908 KB Output is correct
6 Correct 9 ms 1440 KB Output is correct
7 Correct 12 ms 1684 KB Output is correct
8 Correct 2957 ms 158208 KB Output is correct
9 Correct 2606 ms 149444 KB Output is correct
10 Correct 2708 ms 149228 KB Output is correct
11 Correct 2915 ms 158252 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 596 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 3 ms 596 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 3 ms 724 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 3 ms 672 KB Output is correct
10 Correct 3 ms 724 KB Output is correct
11 Correct 4 ms 724 KB Output is correct
12 Correct 4 ms 792 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 596 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 3 ms 596 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 3 ms 724 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 3 ms 672 KB Output is correct
10 Correct 3 ms 724 KB Output is correct
11 Correct 4 ms 724 KB Output is correct
12 Correct 4 ms 792 KB Output is correct
13 Correct 21 ms 4484 KB Output is correct
14 Correct 23 ms 4548 KB Output is correct
15 Correct 39 ms 5696 KB Output is correct
16 Correct 56 ms 7244 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 3 ms 700 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 42 ms 5540 KB Output is correct
21 Correct 42 ms 5880 KB Output is correct
22 Correct 57 ms 6416 KB Output is correct
23 Correct 51 ms 6692 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 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 852 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 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 21 ms 3596 KB Output is correct
12 Correct 549 ms 75076 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 3 ms 596 KB Output is correct
17 Correct 32 ms 4952 KB Output is correct
18 Correct 822 ms 109640 KB Output is correct
19 Correct 975 ms 124624 KB Output is correct
20 Correct 5 ms 1028 KB Output is correct
21 Correct 1 ms 296 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 9 ms 1528 KB Output is correct
25 Correct 28 ms 4664 KB Output is correct
26 Correct 30 ms 4508 KB Output is correct
27 Correct 1035 ms 132448 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 296 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 4 ms 852 KB Output is correct
32 Correct 60 ms 6908 KB Output is correct
33 Correct 9 ms 1440 KB Output is correct
34 Correct 12 ms 1684 KB Output is correct
35 Correct 2957 ms 158208 KB Output is correct
36 Correct 2606 ms 149444 KB Output is correct
37 Correct 2708 ms 149228 KB Output is correct
38 Correct 2915 ms 158252 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 2 ms 596 KB Output is correct
41 Correct 2 ms 596 KB Output is correct
42 Correct 3 ms 596 KB Output is correct
43 Correct 3 ms 596 KB Output is correct
44 Correct 3 ms 724 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 300 KB Output is correct
47 Correct 3 ms 672 KB Output is correct
48 Correct 3 ms 724 KB Output is correct
49 Correct 4 ms 724 KB Output is correct
50 Correct 4 ms 792 KB Output is correct
51 Correct 21 ms 4484 KB Output is correct
52 Correct 23 ms 4548 KB Output is correct
53 Correct 39 ms 5696 KB Output is correct
54 Correct 56 ms 7244 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 3 ms 700 KB Output is correct
57 Correct 2 ms 468 KB Output is correct
58 Correct 42 ms 5540 KB Output is correct
59 Correct 42 ms 5880 KB Output is correct
60 Correct 57 ms 6416 KB Output is correct
61 Correct 51 ms 6692 KB Output is correct
62 Correct 56 ms 10460 KB Output is correct
63 Correct 58 ms 10956 KB Output is correct
64 Correct 195 ms 18616 KB Output is correct
65 Correct 556 ms 55840 KB Output is correct
66 Correct 1012 ms 73160 KB Output is correct
67 Correct 10 ms 1628 KB Output is correct
68 Correct 8 ms 1460 KB Output is correct
69 Correct 507 ms 97388 KB Output is correct
70 Correct 1521 ms 127976 KB Output is correct
71 Correct 2750 ms 178268 KB Output is correct
72 Correct 1588 ms 157552 KB Output is correct
73 Correct 2406 ms 136568 KB Output is correct
74 Correct 1074 ms 114628 KB Output is correct
75 Correct 1489 ms 106984 KB Output is correct