oj.uz

Submission #304878

# Submission time Handle Problem Language Result Execution time Memory
304878 2020-09-22T05:32:46 Z daniel920712 Carnival Tickets (IOI20_tickets) C++14
100 / 100
 2881 ms 216368 KB 
#include "tickets.h"
#include <vector>
#include <algorithm>
#include <set>
#include <utility>
#include <queue>
using namespace std;
struct A
{
    int where;
    int con1,con2;
}tt[1505];
priority_queue < pair < pair < long long ,int > , pair < int , int > > , vector < pair < pair < long long ,int > , pair < int , int > > > , less < pair < pair < long long ,int > , pair < int , int > > > > xx,yy;
vector < vector < int > > answer;
vector < int > row;
vector< vector<int> >  all;
vector < pair < int , pair < int , int > > > how;
vector < int > uu2[1505];
set < int > uu[1505];
bool have[1505][1505];
bool have2[305][90005];
bool use[1505]={0};
long long DP[1505][1505];
long long DP2[305][90005];
long long con[1505][1505];
int a[1505];
int b[1505];
int N,M;


long long find_maximum(int k,vector< vector<int> > x)
{
    long long ans=0;
    int i,j,ll,rr;
    pair < pair < long long ,int > , pair < int , int > > aa,bb;
    N=x.size();
    M=x[0].size();
    for(i=0;i<N/2;i++)
    {
        for(j=0;j<k;j++)
        {
            ans-=x[i][j];
            uu[i].insert(j);
        }
        xx.push(make_pair(make_pair(x[i][k-1]+x[i][M-1],i),make_pair(k-1,M-1)));
    }
    for(i=N/2;i<N;i++)
    {
        for(j=0;j<k;j++)
        {
            ans+=x[i][M-j-1];
            uu[i].insert(M-j-1);
        }
        yy.push(make_pair(make_pair(0-x[i][M-k]-x[i][0],i),make_pair(M-k,0)));
    }
    for(i=0;i<M;i++) row.push_back(-1);
    for(i=0;i<N;i++) answer.push_back(row);
    //printf("%lld\n",ans);
    while(1)
    {
        if(xx.empty()||yy.empty()) break;
        aa=xx.top();
        bb=yy.top();
        xx.pop();
        yy.pop();
        if(aa.first.first+bb.first.first>0)
        {
            ans+=aa.first.first+bb.first.first;
            //printf("%lld\n",ans);
            uu[aa.first.second].erase(aa.second.first);
            uu[aa.first.second].insert(aa.second.second);
            aa.second.first--;
            aa.second.second--;
            if(aa.second.first>=0)
            {
                aa.first.first=x[aa.first.second][aa.second.first]+x[aa.first.second][aa.second.second];
                xx.push(aa);
            }

            uu[bb.first.second].erase(bb.second.first);
            uu[bb.first.second].insert(bb.second.second);
            bb.second.first++;
            bb.second.second++;
            if(bb.second.first<M)
            {
                bb.first.first=0-x[bb.first.second][bb.second.first]-x[bb.first.second][bb.second.second];
                yy.push(bb);
            }

        }
        else break;

    }
    for(i=0;i<N;i++)
    {
        for(auto j:uu[i])
        {
            how.push_back(make_pair(x[i][j],make_pair(i,j)));
            uu2[i].push_back(j);
        }
    }
    sort(how.begin(),how.end());
    for(i=0;i<N*k;i++) con[how[i].second.first][how[i].second.second]=i;
    for(i=0;i<N;i++)
    {
        a[i]=0;
        b[i]=k-1;
    }
    for(i=0;i<k;i++)
    {
        ll=0;
        rr=0;
        for(j=0;j<N;j++) use[j]=0;
        for(j=0;j<N;j++)
        {
            if(a[j]<k&&con[j][uu2[j][a[j]]]>=N*k/2)
            {
                use[j]=1;
                rr++;
                answer[j][uu2[j][b[j]]]=i;
                b[j]--;
            }
            if(b[j]>=0&&con[j][uu2[j][b[j]]]<N*k/2)
            {
                use[j]=1;
                ll++;
                answer[j][uu2[j][a[j]]]=i;
                a[j]++;
            }
        }

        for(j=0;j<N;j++)
        {
            if(use[j]) continue;
            if(ll<N/2)
            {
                use[j]=1;
                ll++;
                answer[j][uu2[j][a[j]]]=i;
                a[j]++;
            }
            else
            {
                use[j]=1;
                rr++;
                answer[j][uu2[j][b[j]]]=i;
                b[j]--;
            }
        }
    }
	allocate_tickets(answer);
	return ans;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 3 ms 896 KB Output is correct
5 Correct 32 ms 3840 KB Output is correct
6 Correct 753 ms 56440 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 3 ms 1152 KB Output is correct
5 Correct 36 ms 7208 KB Output is correct
6 Correct 993 ms 139492 KB Output is correct
7 Correct 1212 ms 164944 KB Output is correct
8 Correct 7 ms 1900 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 13 ms 2668 KB Output is correct
13 Correct 39 ms 7964 KB Output is correct
14 Correct 40 ms 7196 KB Output is correct
15 Correct 1370 ms 189160 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 384 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 5 ms 1408 KB Output is correct
5 Correct 76 ms 10408 KB Output is correct
6 Correct 12 ms 1904 KB Output is correct
7 Correct 16 ms 8188 KB Output is correct
8 Correct 2877 ms 216356 KB Output is correct
9 Correct 2606 ms 203956 KB Output is correct
10 Correct 2387 ms 202160 KB Output is correct
11 Correct 2680 ms 216368 KB Output is correct

Subtask #5
12.0 / 12.0

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

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 3 ms 896 KB Output is correct
3 Correct 3 ms 1024 KB Output is correct
4 Correct 4 ms 1024 KB Output is correct
5 Correct 4 ms 1152 KB Output is correct
6 Correct 5 ms 1280 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 4 ms 1152 KB Output is correct
10 Correct 4 ms 1152 KB Output is correct
11 Correct 5 ms 1280 KB Output is correct
12 Correct 7 ms 1280 KB Output is correct
13 Correct 32 ms 4216 KB Output is correct
14 Correct 33 ms 4604 KB Output is correct
15 Correct 54 ms 7464 KB Output is correct
16 Correct 75 ms 10408 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 4 ms 2048 KB Output is correct
19 Correct 3 ms 1792 KB Output is correct
20 Correct 54 ms 8224 KB Output is correct
21 Correct 62 ms 8092 KB Output is correct
22 Correct 69 ms 9896 KB Output is correct
23 Correct 69 ms 9768 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 1 ms 768 KB Output is correct
5 Correct 1 ms 1792 KB Output is correct
6 Correct 5 ms 7040 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 3 ms 896 KB Output is correct
11 Correct 32 ms 3840 KB Output is correct
12 Correct 753 ms 56440 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 512 KB Output is correct
16 Correct 3 ms 1152 KB Output is correct
17 Correct 36 ms 7208 KB Output is correct
18 Correct 993 ms 139492 KB Output is correct
19 Correct 1212 ms 164944 KB Output is correct
20 Correct 7 ms 1900 KB Output is correct
21 Correct 1 ms 512 KB Output is correct
22 Correct 1 ms 512 KB Output is correct
23 Correct 1 ms 512 KB Output is correct
24 Correct 13 ms 2668 KB Output is correct
25 Correct 39 ms 7964 KB Output is correct
26 Correct 40 ms 7196 KB Output is correct
27 Correct 1370 ms 189160 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 1 ms 512 KB Output is correct
31 Correct 5 ms 1408 KB Output is correct
32 Correct 76 ms 10408 KB Output is correct
33 Correct 12 ms 1904 KB Output is correct
34 Correct 16 ms 8188 KB Output is correct
35 Correct 2877 ms 216356 KB Output is correct
36 Correct 2606 ms 203956 KB Output is correct
37 Correct 2387 ms 202160 KB Output is correct
38 Correct 2680 ms 216368 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 3 ms 896 KB Output is correct
41 Correct 3 ms 1024 KB Output is correct
42 Correct 4 ms 1024 KB Output is correct
43 Correct 4 ms 1152 KB Output is correct
44 Correct 5 ms 1280 KB Output is correct
45 Correct 1 ms 512 KB Output is correct
46 Correct 1 ms 768 KB Output is correct
47 Correct 4 ms 1152 KB Output is correct
48 Correct 4 ms 1152 KB Output is correct
49 Correct 5 ms 1280 KB Output is correct
50 Correct 7 ms 1280 KB Output is correct
51 Correct 32 ms 4216 KB Output is correct
52 Correct 33 ms 4604 KB Output is correct
53 Correct 54 ms 7464 KB Output is correct
54 Correct 75 ms 10408 KB Output is correct
55 Correct 1 ms 512 KB Output is correct
56 Correct 4 ms 2048 KB Output is correct
57 Correct 3 ms 1792 KB Output is correct
58 Correct 54 ms 8224 KB Output is correct
59 Correct 62 ms 8092 KB Output is correct
60 Correct 69 ms 9896 KB Output is correct
61 Correct 69 ms 9768 KB Output is correct
62 Correct 88 ms 9208 KB Output is correct
63 Correct 88 ms 10488 KB Output is correct
64 Correct 230 ms 26120 KB Output is correct
65 Correct 671 ms 66940 KB Output is correct
66 Correct 1083 ms 98740 KB Output is correct
67 Correct 16 ms 8188 KB Output is correct
68 Correct 12 ms 1904 KB Output is correct
69 Correct 757 ms 58872 KB Output is correct
70 Correct 1733 ms 139576 KB Output is correct
71 Correct 2881 ms 216360 KB Output is correct
72 Correct 2170 ms 205488 KB Output is correct
73 Correct 2479 ms 200292 KB Output is correct
74 Correct 1447 ms 143468 KB Output is correct
75 Correct 1659 ms 139868 KB Output is correct