oj.uz

Submission #309312

# Submission time Handle Problem Language Result Execution time Memory
309312 2020-10-03T07:47:37 Z tjdgus4384 Carnival Tickets (IOI20_tickets) C++14
100 / 100
 1250 ms 54604 KB 
#include<bits/stdc++.h>
#include "tickets.h"
using namespace std;
int cnt1[1501], cnt2[1501];

long long find_maximum(int k, vector<vector<int> > x){
    vector<vector<int> > s(x.size());
    for(int i = 0;i < s.size();i++) s[i].resize(x[0].size(), -1);
    vector<pair<int, int> > v;
    long long ret = 0;

    priority_queue<pair<pair<long long, int>, pair<int, int> > > pq;
    for(int i = 0;i < x.size();i++){
        for(int j = 0;j < k;j++){
            ret -= x[i][j];
            cnt1[i]++;
        }
        pq.push({{x[i].back() + x[i][k - 1], i}, {x[i].size() - 1, k - 1}});
    }
    for(int i = 0;i < k*x.size()/2;i++){
        ret += pq.top().first.first;
        int a = pq.top().second.first;
        int b = pq.top().second.second;
        int c = pq.top().first.second;
        cnt1[c]--; cnt2[c]++;
        pq.pop();
        if(a == 0 || b == 0) continue;
        pq.push({{x[c][a-1] + x[c][b-1], c}, {a-1, b-1}});
    }

    for(int i = 0;i < x.size();i++) v.push_back({cnt1[i], cnt2[i]});

    priority_queue<pair<pair<int, int>, int> > q;
    for(int i = 0;i < k;i++){
        for(int j = 0;j < x.size();j++) q.push({{v[j].first, v[j].second}, j});
        for(int j = 0;j < x.size()/2;j++){
            s[q.top().second][q.top().first.first-1] = i;
            v[q.top().second].first--;
            q.pop();
        }
        for(int j = 0;j < x.size()/2;j++){
            s[q.top().second][x[0].size()-q.top().first.second] = i;
            v[q.top().second].second--;
            q.pop();
        }
    }
    allocate_tickets(s);
    return ret;
}

Compilation message

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:8:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 |     for(int i = 0;i < s.size();i++) s[i].resize(x[0].size(), -1);
      |                   ~~^~~~~~~~~~
tickets.cpp:13:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |     for(int i = 0;i < x.size();i++){
      |                   ~~^~~~~~~~~~
tickets.cpp:20:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |     for(int i = 0;i < k*x.size()/2;i++){
      |                   ~~^~~~~~~~~~~~~~
tickets.cpp:31:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |     for(int i = 0;i < x.size();i++) v.push_back({cnt1[i], cnt2[i]});
      |                   ~~^~~~~~~~~~
tickets.cpp:35:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |         for(int j = 0;j < x.size();j++) q.push({{v[j].first, v[j].second}, j});
      |                       ~~^~~~~~~~~~
tickets.cpp:36:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |         for(int j = 0;j < x.size()/2;j++){
      |                       ~~^~~~~~~~~~~~
tickets.cpp:41:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |         for(int j = 0;j < x.size()/2;j++){
      |                       ~~^~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 768 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 34 ms 2424 KB Output is correct
6 Correct 751 ms 51688 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 3 ms 524 KB Output is correct
5 Correct 29 ms 2424 KB Output is correct
6 Correct 760 ms 52600 KB Output is correct
7 Correct 833 ms 52856 KB Output is correct
8 Correct 4 ms 512 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 8 ms 800 KB Output is correct
13 Correct 27 ms 2040 KB Output is correct
14 Correct 27 ms 2048 KB Output is correct
15 Correct 876 ms 53496 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 46 ms 2424 KB Output is correct
6 Correct 7 ms 640 KB Output is correct
7 Correct 11 ms 896 KB Output is correct
8 Correct 1223 ms 54524 KB Output is correct
9 Correct 1169 ms 50912 KB Output is correct
10 Correct 1158 ms 50816 KB Output is correct
11 Correct 1250 ms 54604 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 3 ms 640 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 4 ms 512 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 3 ms 640 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 4 ms 512 KB Output is correct
13 Correct 32 ms 2424 KB Output is correct
14 Correct 33 ms 2424 KB Output is correct
15 Correct 42 ms 2424 KB Output is correct
16 Correct 45 ms 2424 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 3 ms 512 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 35 ms 2384 KB Output is correct
21 Correct 40 ms 2424 KB Output is correct
22 Correct 39 ms 2424 KB Output is correct
23 Correct 44 ms 2424 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 768 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 34 ms 2424 KB Output is correct
12 Correct 751 ms 51688 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 3 ms 524 KB Output is correct
17 Correct 29 ms 2424 KB Output is correct
18 Correct 760 ms 52600 KB Output is correct
19 Correct 833 ms 52856 KB Output is correct
20 Correct 4 ms 512 KB Output is correct
21 Correct 0 ms 384 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 1 ms 256 KB Output is correct
24 Correct 8 ms 800 KB Output is correct
25 Correct 27 ms 2040 KB Output is correct
26 Correct 27 ms 2048 KB Output is correct
27 Correct 876 ms 53496 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 3 ms 512 KB Output is correct
32 Correct 46 ms 2424 KB Output is correct
33 Correct 7 ms 640 KB Output is correct
34 Correct 11 ms 896 KB Output is correct
35 Correct 1223 ms 54524 KB Output is correct
36 Correct 1169 ms 50912 KB Output is correct
37 Correct 1158 ms 50816 KB Output is correct
38 Correct 1250 ms 54604 KB Output is correct
39 Correct 0 ms 256 KB Output is correct
40 Correct 3 ms 512 KB Output is correct
41 Correct 3 ms 640 KB Output is correct
42 Correct 3 ms 512 KB Output is correct
43 Correct 4 ms 512 KB Output is correct
44 Correct 3 ms 512 KB Output is correct
45 Correct 1 ms 384 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 3 ms 512 KB Output is correct
48 Correct 3 ms 512 KB Output is correct
49 Correct 3 ms 512 KB Output is correct
50 Correct 4 ms 512 KB Output is correct
51 Correct 32 ms 2424 KB Output is correct
52 Correct 33 ms 2424 KB Output is correct
53 Correct 42 ms 2424 KB Output is correct
54 Correct 45 ms 2424 KB Output is correct
55 Correct 2 ms 384 KB Output is correct
56 Correct 3 ms 512 KB Output is correct
57 Correct 2 ms 384 KB Output is correct
58 Correct 35 ms 2384 KB Output is correct
59 Correct 40 ms 2424 KB Output is correct
60 Correct 39 ms 2424 KB Output is correct
61 Correct 44 ms 2424 KB Output is correct
62 Correct 85 ms 6136 KB Output is correct
63 Correct 88 ms 6136 KB Output is correct
64 Correct 126 ms 6264 KB Output is correct
65 Correct 434 ms 23672 KB Output is correct
66 Correct 530 ms 24312 KB Output is correct
67 Correct 10 ms 896 KB Output is correct
68 Correct 7 ms 640 KB Output is correct
69 Correct 757 ms 51656 KB Output is correct
70 Correct 1002 ms 52708 KB Output is correct
71 Correct 1221 ms 54520 KB Output is correct
72 Correct 1006 ms 52304 KB Output is correct
73 Correct 1184 ms 52344 KB Output is correct
74 Correct 825 ms 50808 KB Output is correct
75 Correct 1006 ms 50936 KB Output is correct