oj.uz

Submission #592708

# Submission time Handle Problem Language Result Execution time Memory
592708 2022-07-09T13:42:29 Z ogibogi2004 Carnival Tickets (IOI20_tickets) C++14
100 / 100
 1061 ms 189264 KB 
#include "tickets.h"
#include <vector>
#include<bits/stdc++.h>
using namespace std;
#define ll long long
long long find_maximum(int k, vector<vector<int>> x1) {
    //cout<<"?\n";
    vector<vector<ll> >x;
    for(int i=0;i<x1.size();i++)
    {
        vector<ll>row;
        for(int j=0;j<x1[i].size();j++)row.push_back(x1[i][j]);
        x.push_back(row);
    }
	ll n = x.size();
	ll m = x[0].size();
	vector<vector<int>> answer;
    vector<ll>smallest[n];
    for(ll i=0;i<n;i++)
    {
        smallest[i]=x[i];
        sort(smallest[i].begin(),smallest[i].end());
    }
    ll use[n][m];
    memset(use,-1,sizeof(use));
    vector<ll>small[n];
    vector<ll>large[n];
    ll ret=0;
    vector<pair<ll,pair<ll,ll> > >del;
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<k;j++)
        {
            ret-=smallest[i][j];
            del.push_back({smallest[i][k-j-1]+smallest[i][m-j-1],{i,j}});
        }
    }
    sort(del.rbegin(),del.rend());
    int cntsmall[n];
    for(int i=0;i<n;i++)cntsmall[i]=k;
    for(int i=0;i<n*k/2;i++)
    {
        ret+=del[i].first;
        cntsmall[del[i].second.first]--;
    }
    for(int i=0;i<n;i++)
    {
        vector<pair<ll,ll> >sm1;
        for(int j=0;j<m;j++)sm1.push_back({x[i][j],j});
        sort(sm1.begin(),sm1.end());
        for(int j=0;j<cntsmall[i];j++)
        {
            small[i].push_back(sm1[j].second);
        }
        for(int j=1;j<=k-cntsmall[i];j++)
        {
            large[i].push_back(sm1[m-j].second);
        }
    }
    //cout<<dp[n-1][n*k/2]<<endl;
    for(ll j=0;j<k;j++)
    {
        //cout<<j<<endl;
        vector<pair<ll,ll> >sizes;
        for(ll i=0;i<n;i++)
        {
            sizes.push_back({small[i].size(),i});
        }
        sort(sizes.rbegin(),sizes.rend());
        for(ll i=0;i<sizes.size();i++)
        {
            //cout<< " "<<i<<endl;
            if(i<n/2)
            {
                //cout<<"     "<<small[sizes[i].second].size()<<endl;
                use[sizes[i].second][small[sizes[i].second].back()]=j;
                small[sizes[i].second].pop_back();
            }
            else
            {
                use[sizes[i].second][large[sizes[i].second].back()]=j;
                large[sizes[i].second].pop_back();
            }
        }
    }
    for(ll i=0;i<n;i++)
    {
        vector<int>v;
        for(ll j=0;j<m;j++)
        {
            v.push_back(use[i][j]);
        }
        answer.push_back(v);
    }
    allocate_tickets(answer);
    return ret;
}
/*
2 3 2
0 2 5
1 1 3
*/

Compilation message

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:9:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |     for(int i=0;i<x1.size();i++)
      |                 ~^~~~~~~~~~
tickets.cpp:12:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |         for(int j=0;j<x1[i].size();j++)row.push_back(x1[i][j]);
      |                     ~^~~~~~~~~~~~~
tickets.cpp:70:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |         for(ll i=0;i<sizes.size();i++)
      |                    ~^~~~~~~~~~~~~

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 0 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 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 572 KB Output is correct
5 Correct 24 ms 5344 KB Output is correct
6 Correct 573 ms 109388 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 0 ms 212 KB Output is correct
4 Correct 3 ms 724 KB Output is correct
5 Correct 30 ms 6052 KB Output is correct
6 Correct 702 ms 136256 KB Output is correct
7 Correct 812 ms 150952 KB Output is correct
8 Correct 4 ms 1104 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 312 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 8 ms 1776 KB Output is correct
13 Correct 28 ms 5448 KB Output is correct
14 Correct 27 ms 5672 KB Output is correct
15 Correct 869 ms 160220 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 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 4 ms 788 KB Output is correct
5 Correct 38 ms 7484 KB Output is correct
6 Correct 7 ms 1360 KB Output is correct
7 Correct 10 ms 1936 KB Output is correct
8 Correct 1048 ms 174576 KB Output is correct
9 Correct 993 ms 164932 KB Output is correct
10 Correct 972 ms 164920 KB Output is correct
11 Correct 1040 ms 174512 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 3 ms 596 KB Output is correct
4 Correct 3 ms 724 KB Output is correct
5 Correct 3 ms 724 KB Output is correct
6 Correct 3 ms 852 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 724 KB Output is correct
10 Correct 3 ms 724 KB Output is correct
11 Correct 3 ms 788 KB Output is correct
12 Correct 3 ms 824 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 3 ms 596 KB Output is correct
4 Correct 3 ms 724 KB Output is correct
5 Correct 3 ms 724 KB Output is correct
6 Correct 3 ms 852 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 724 KB Output is correct
10 Correct 3 ms 724 KB Output is correct
11 Correct 3 ms 788 KB Output is correct
12 Correct 3 ms 824 KB Output is correct
13 Correct 28 ms 5052 KB Output is correct
14 Correct 25 ms 5128 KB Output is correct
15 Correct 31 ms 6348 KB Output is correct
16 Correct 41 ms 8004 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 3 ms 824 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 32 ms 6468 KB Output is correct
21 Correct 32 ms 6884 KB Output is correct
22 Correct 37 ms 7340 KB Output is correct
23 Correct 35 ms 7872 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 0 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 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 572 KB Output is correct
11 Correct 24 ms 5344 KB Output is correct
12 Correct 573 ms 109388 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 3 ms 724 KB Output is correct
17 Correct 30 ms 6052 KB Output is correct
18 Correct 702 ms 136256 KB Output is correct
19 Correct 812 ms 150952 KB Output is correct
20 Correct 4 ms 1104 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 312 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 8 ms 1776 KB Output is correct
25 Correct 28 ms 5448 KB Output is correct
26 Correct 27 ms 5672 KB Output is correct
27 Correct 869 ms 160220 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 4 ms 788 KB Output is correct
32 Correct 38 ms 7484 KB Output is correct
33 Correct 7 ms 1360 KB Output is correct
34 Correct 10 ms 1936 KB Output is correct
35 Correct 1048 ms 174576 KB Output is correct
36 Correct 993 ms 164932 KB Output is correct
37 Correct 972 ms 164920 KB Output is correct
38 Correct 1040 ms 174512 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 2 ms 596 KB Output is correct
41 Correct 3 ms 596 KB Output is correct
42 Correct 3 ms 724 KB Output is correct
43 Correct 3 ms 724 KB Output is correct
44 Correct 3 ms 852 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 724 KB Output is correct
48 Correct 3 ms 724 KB Output is correct
49 Correct 3 ms 788 KB Output is correct
50 Correct 3 ms 824 KB Output is correct
51 Correct 28 ms 5052 KB Output is correct
52 Correct 25 ms 5128 KB Output is correct
53 Correct 31 ms 6348 KB Output is correct
54 Correct 41 ms 8004 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 3 ms 824 KB Output is correct
57 Correct 2 ms 468 KB Output is correct
58 Correct 32 ms 6468 KB Output is correct
59 Correct 32 ms 6884 KB Output is correct
60 Correct 37 ms 7340 KB Output is correct
61 Correct 35 ms 7872 KB Output is correct
62 Correct 64 ms 14340 KB Output is correct
63 Correct 63 ms 14420 KB Output is correct
64 Correct 106 ms 22124 KB Output is correct
65 Correct 347 ms 70184 KB Output is correct
66 Correct 445 ms 86424 KB Output is correct
67 Correct 9 ms 2004 KB Output is correct
68 Correct 8 ms 1616 KB Output is correct
69 Correct 611 ms 119472 KB Output is correct
70 Correct 804 ms 151048 KB Output is correct
71 Correct 1061 ms 189264 KB Output is correct
72 Correct 997 ms 175928 KB Output is correct
73 Correct 977 ms 185716 KB Output is correct
74 Correct 783 ms 143128 KB Output is correct
75 Correct 787 ms 154724 KB Output is correct