oj.uz

Submission #527647

# Submission time Handle Problem Language Result Execution time Memory
527647 2022-02-17T21:50:23 Z Deepesson Carnival Tickets (IOI20_tickets) C++17
100 / 100
 765 ms 93252 KB 
#include <bits/stdc++.h>
#include "tickets.h"
void allocate_tickets( std::vector<std::vector<int>> _d);

typedef std::pair<int,int> pii;
long long find_maximum(int k, std::vector<std::vector<int>> x) {
    int N=x.size(),M=x[0].size();
    int lado=(k*N)/2;
	int pegou[N]={};
    std::priority_queue<pii> queue;
    std::vector<std::deque<int>> copia;
    for(int i=0;i!=N;++i){
        std::deque<int> k;
        for(auto&z:x[i])k.push_back(z);
        copia.push_back(k);
    }
    long long res=0;
    std::deque<int> remove[N];
    for(int i=0;i!=N;++i){
        for(int j=0;j!=k;++j){
            remove[i].push_back(x[i][j]);
            res-=x[i][j];
        }
    }
    for(int i=0;i!=N;++i){
        if(remove[i].size()){
            queue.push({remove[i].back()+copia[i].back(),i});
        }
    }
    std::vector<int> pega[N]={};
    for(int i=0;i!=lado;++i){
        auto __ = queue.top();
        queue.pop();
        res+=__.first;
        copia[__.second].pop_back();
        pega[__.second].push_back(copia[__.second].size());
        remove[__.second].pop_back();
        if(remove[__.second].size()){
            queue.push({remove[__.second].back()+copia[__.second].back(),__.second});
        }
    }
    std::vector<std::vector<int>> ordem;
    for(int i=0;i!=N;++i){
        std::vector<int> p;
        for(int j=0;j!=M;++j)p.push_back(-1);
        ordem.push_back(p);
    }
    int adds[k]={},subs[k]={};
    for(int i=0;i!=N;++i){
        int rem = remove[i].size();
        int cur=0;
        std::vector<int> falta;
        std::vector<pii> tem;
        for(int i=0;i!=k;++i){
            tem.push_back({subs[i],i});
        }
        std::sort(tem.begin(),tem.end());
        bool foi[k]={};
        ///Remove
        for(int j=0;j!=rem;++j){
            if(subs[tem[cur].second]<(N/2)){
                //std::cout<<"Adder "<<cur<<"\n";
                foi[tem[cur].second]=1;
                subs[tem[cur].second]++;
                ordem[i][j]=tem[cur].second;
            }else {falta.push_back(tem[cur].second);--j;}
            ++cur;
        }
        while(cur<k){falta.push_back(tem[cur].second);++cur;}
        cur=0;
        ///Adiciona
        for(int j=copia[i].size();j!=x[i].size();++j){
            //std::cout<<"Add "<<falta[cur]<<"\n";
            ordem[i][j]=falta[cur];
            ++cur;
        }
       // std::cout<<"\n";
    }
    allocate_tickets(ordem);
	return res;
}

Compilation message

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:72:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |         for(int j=copia[i].size();j!=x[i].size();++j){
      |                                   ~^~~~~~~~~~~~~
tickets.cpp:9:6: warning: unused variable 'pegou' [-Wunused-variable]
    9 |  int pegou[N]={};
      |      ^~~~~
tickets.cpp:48:9: warning: unused variable 'adds' [-Wunused-variable]
   48 |     int adds[k]={},subs[k]={};
      |         ^~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 716 KB Output is correct
6 Correct 2 ms 2764 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 232 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 20 ms 3104 KB Output is correct
6 Correct 460 ms 61872 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 280 KB Output is correct
4 Correct 2 ms 556 KB Output is correct
5 Correct 20 ms 3496 KB Output is correct
6 Correct 495 ms 74352 KB Output is correct
7 Correct 535 ms 76912 KB Output is correct
8 Correct 3 ms 692 KB Output is correct
9 Correct 1 ms 276 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 6 ms 1100 KB Output is correct
13 Correct 18 ms 3116 KB Output is correct
14 Correct 19 ms 2892 KB Output is correct
15 Correct 547 ms 80032 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 2 ms 556 KB Output is correct
5 Correct 28 ms 4668 KB Output is correct
6 Correct 5 ms 932 KB Output is correct
7 Correct 7 ms 3100 KB Output is correct
8 Correct 765 ms 84824 KB Output is correct
9 Correct 685 ms 92624 KB Output is correct
10 Correct 676 ms 93252 KB Output is correct
11 Correct 740 ms 83644 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 2 ms 556 KB Output is correct
5 Correct 3 ms 588 KB Output is correct
6 Correct 2 ms 588 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 2 ms 544 KB Output is correct
10 Correct 2 ms 588 KB Output is correct
11 Correct 2 ms 588 KB Output is correct
12 Correct 2 ms 588 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 2 ms 556 KB Output is correct
5 Correct 3 ms 588 KB Output is correct
6 Correct 2 ms 588 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 2 ms 544 KB Output is correct
10 Correct 2 ms 588 KB Output is correct
11 Correct 2 ms 588 KB Output is correct
12 Correct 2 ms 588 KB Output is correct
13 Correct 21 ms 3888 KB Output is correct
14 Correct 20 ms 4012 KB Output is correct
15 Correct 23 ms 3948 KB Output is correct
16 Correct 28 ms 4548 KB Output is correct
17 Correct 1 ms 304 KB Output is correct
18 Correct 2 ms 972 KB Output is correct
19 Correct 2 ms 848 KB Output is correct
20 Correct 23 ms 3488 KB Output is correct
21 Correct 35 ms 4036 KB Output is correct
22 Correct 25 ms 3744 KB Output is correct
23 Correct 27 ms 4264 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 716 KB Output is correct
6 Correct 2 ms 2764 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 232 KB Output is correct
10 Correct 2 ms 460 KB Output is correct
11 Correct 20 ms 3104 KB Output is correct
12 Correct 460 ms 61872 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 280 KB Output is correct
16 Correct 2 ms 556 KB Output is correct
17 Correct 20 ms 3496 KB Output is correct
18 Correct 495 ms 74352 KB Output is correct
19 Correct 535 ms 76912 KB Output is correct
20 Correct 3 ms 692 KB Output is correct
21 Correct 1 ms 276 KB Output is correct
22 Correct 1 ms 208 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 6 ms 1100 KB Output is correct
25 Correct 18 ms 3116 KB Output is correct
26 Correct 19 ms 2892 KB Output is correct
27 Correct 547 ms 80032 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 2 ms 556 KB Output is correct
32 Correct 28 ms 4668 KB Output is correct
33 Correct 5 ms 932 KB Output is correct
34 Correct 7 ms 3100 KB Output is correct
35 Correct 765 ms 84824 KB Output is correct
36 Correct 685 ms 92624 KB Output is correct
37 Correct 676 ms 93252 KB Output is correct
38 Correct 740 ms 83644 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 2 ms 460 KB Output is correct
41 Correct 2 ms 460 KB Output is correct
42 Correct 2 ms 556 KB Output is correct
43 Correct 3 ms 588 KB Output is correct
44 Correct 2 ms 588 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 2 ms 544 KB Output is correct
48 Correct 2 ms 588 KB Output is correct
49 Correct 2 ms 588 KB Output is correct
50 Correct 2 ms 588 KB Output is correct
51 Correct 21 ms 3888 KB Output is correct
52 Correct 20 ms 4012 KB Output is correct
53 Correct 23 ms 3948 KB Output is correct
54 Correct 28 ms 4548 KB Output is correct
55 Correct 1 ms 304 KB Output is correct
56 Correct 2 ms 972 KB Output is correct
57 Correct 2 ms 848 KB Output is correct
58 Correct 23 ms 3488 KB Output is correct
59 Correct 35 ms 4036 KB Output is correct
60 Correct 25 ms 3744 KB Output is correct
61 Correct 27 ms 4264 KB Output is correct
62 Correct 54 ms 9860 KB Output is correct
63 Correct 54 ms 9844 KB Output is correct
64 Correct 79 ms 11556 KB Output is correct
65 Correct 259 ms 41088 KB Output is correct
66 Correct 314 ms 45252 KB Output is correct
67 Correct 7 ms 3028 KB Output is correct
68 Correct 5 ms 972 KB Output is correct
69 Correct 485 ms 71788 KB Output is correct
70 Correct 592 ms 78868 KB Output is correct
71 Correct 744 ms 84868 KB Output is correct
72 Correct 619 ms 84448 KB Output is correct
73 Correct 675 ms 79956 KB Output is correct
74 Correct 524 ms 77256 KB Output is correct
75 Correct 585 ms 72884 KB Output is correct