oj.uz

Submission #720647

# Submission time Handle Problem Language Result Execution time Memory
720647 2023-04-08T18:37:48 Z bin9638 Carnival Tickets (IOI20_tickets) C++17
100 / 100
 791 ms 123572 KB 
#include <bits/stdc++.h>

#ifndef SKY
#include "tickets.h"
#endif // SKY

using namespace std;

#define N 1510
#define ll long long
#define fs first
#define sc second
#define ii pair<ll,int>
#define pb push_back

int ktr[N],times,n,m,l[N],r[N];
ll cost[N][N];
priority_queue<ii>s[2];
vector<int>lis[N][2];

#ifdef SKY
void allocate_tickets(vector<vector<int>>kq)
{
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<m;j++)
            cout<<kq[i][j]<<" ";
        cout<<endl;
    }
}
#endif // SKY

void build(int i)
{
    if(l[i]!=0)
    {
        s[1].push({cost[i][r[i]]+cost[i][l[i]-1],i});
    }
    if(r[i]!=m-1)
    {
        s[0].push({-cost[i][l[i]]-cost[i][r[i]+1],i});
    }
}

void chinh_0()
{
    while(!s[0].empty())
    {
        ii u=s[0].top();
        int i=u.sc;
        if(r[i]==m-1||u.fs!=-cost[i][l[i]]-cost[i][r[i]+1])
        {
            s[0].pop();
        }else
            return;
    }
}

void chinh_1()
{
    while(!s[1].empty())
    {
        ii u=s[1].top();
        int i=u.sc;
        if(l[i]==0||u.fs!=cost[i][r[i]]+cost[i][l[i]-1])
        {
            s[1].pop();
        }else
            return;
    }
}

ll find_maximum(int k, vector<vector<int>> xxx)
{
	n=xxx.size();
	m=xxx[0].size();
	for(int i=0;i<n;i++)
        for(int j=0;j<m;j++)
            cost[i][j]=xxx[i][j];
    vector<vector<int>>kq;
    kq.resize(n,vector<int>(m,-1));
    ll res=0;
    for(int i=0;i<n;i++)
        if(i&1)
        {
            l[i]=k;
            r[i]=m-1;
            for(int j=0;j<k;j++)
                res-=cost[i][j];
            s[1].push({cost[i][m-1]+cost[i][k-1],i});
        }else
        {
            l[i]=0;
            r[i]=m-1-k;
            for(int j=m-1-k+1;j<m;j++)
                res+=cost[i][j];
            s[0].push({-cost[i][0]-cost[i][m-1-k+1],i});
        }
    while(!s[0].empty()&&!s[1].empty()&&s[0].top().fs+s[1].top().fs>0)
    {
        ii u=s[0].top(),v=s[1].top();
        res+=u.fs+v.fs;
        s[0].pop();
        s[1].pop();
        l[u.sc]++;
        r[u.sc]++;
        l[v.sc]--;
        r[v.sc]--;
        build(u.sc);
        build(v.sc);
        chinh_0();
        chinh_1();
    }
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<l[i];j++)
            lis[i][0].pb(j);
        for(int j=m-1;j>r[i];j--)
            lis[i][1].pb(j);
    }
    for(int t=0;t<k;t++)
    {
        times++;
        vector<int>tmp(2,n/2);
        for(int i=0;i<n;i++)
            if(ktr[i]!=times&&lis[i][1].empty())
            {
                ktr[i]=times;
                tmp[0]--;
                kq[i][lis[i][0].back()]=t;
                lis[i][0].pop_back();
            }
        for(int i=0;i<n;i++)
            if(ktr[i]!=times&&lis[i][0].empty())
            {
                ktr[i]=times;
                tmp[1]--;
                kq[i][lis[i][1].back()]=t;
                lis[i][1].pop_back();
            }
        for(int i=0;i<n;i++)
            if(ktr[i]!=times&&tmp[0]>0&&!lis[i][0].empty())
            {
                ktr[i]=times;
                tmp[0]--;
                kq[i][lis[i][0].back()]=t;
                lis[i][0].pop_back();
            }
        for(int i=0;i<n;i++)
            if(ktr[i]!=times&&tmp[1]>0&&!lis[i][1].empty())
            {
                ktr[i]=times;
                tmp[1]--;
                kq[i][lis[i][1].back()]=t;
                lis[i][1].pop_back();
            }
        // cout<<t<<endl; for(int i=0;i<n;i++)cout<<lis[i][0].size()<<" "<<lis[i][1].size()<<endl;
    }
    allocate_tickets(kq);
    return res;
}

#ifdef SKY
int main()
{
    freopen("A.inp","r",stdin);
    freopen("A.out","w",stdout);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
    int n,m,k;
    cin>>n>>m>>k;
    vector<vector<int>>x;
    x.resize(n,vector<int>(m,0));
    for(int i=0;i<n;i++)
        for(int j=0;j<m;j++)
            cin>>x[i][j];
    cout<<find_maximum(k,x);
    return 0;
}
#endif

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 1 ms 1620 KB Output is correct
6 Correct 5 ms 6868 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 2 ms 852 KB Output is correct
5 Correct 19 ms 4376 KB Output is correct
6 Correct 455 ms 69180 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 380 KB Output is correct
4 Correct 2 ms 904 KB Output is correct
5 Correct 18 ms 4900 KB Output is correct
6 Correct 425 ms 80944 KB Output is correct
7 Correct 494 ms 89516 KB Output is correct
8 Correct 3 ms 1236 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 6 ms 1876 KB Output is correct
13 Correct 19 ms 5408 KB Output is correct
14 Correct 17 ms 4112 KB Output is correct
15 Correct 543 ms 95092 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 456 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 3 ms 980 KB Output is correct
5 Correct 29 ms 5648 KB Output is correct
6 Correct 5 ms 968 KB Output is correct
7 Correct 8 ms 7332 KB Output is correct
8 Correct 753 ms 101672 KB Output is correct
9 Correct 707 ms 97076 KB Output is correct
10 Correct 728 ms 95080 KB Output is correct
11 Correct 767 ms 102028 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 2 ms 852 KB Output is correct
3 Correct 2 ms 980 KB Output is correct
4 Correct 2 ms 980 KB Output is correct
5 Correct 3 ms 980 KB Output is correct
6 Correct 3 ms 980 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 644 KB Output is correct
9 Correct 2 ms 980 KB Output is correct
10 Correct 4 ms 980 KB Output is correct
11 Correct 2 ms 980 KB Output is correct
12 Correct 3 ms 1032 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 2 ms 852 KB Output is correct
3 Correct 2 ms 980 KB Output is correct
4 Correct 2 ms 980 KB Output is correct
5 Correct 3 ms 980 KB Output is correct
6 Correct 3 ms 980 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 644 KB Output is correct
9 Correct 2 ms 980 KB Output is correct
10 Correct 4 ms 980 KB Output is correct
11 Correct 2 ms 980 KB Output is correct
12 Correct 3 ms 1032 KB Output is correct
13 Correct 20 ms 5248 KB Output is correct
14 Correct 20 ms 5272 KB Output is correct
15 Correct 26 ms 5820 KB Output is correct
16 Correct 30 ms 6568 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 3 ms 1936 KB Output is correct
19 Correct 2 ms 1748 KB Output is correct
20 Correct 24 ms 5376 KB Output is correct
21 Correct 26 ms 5880 KB Output is correct
22 Correct 27 ms 5824 KB Output is correct
23 Correct 28 ms 6128 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 1 ms 1620 KB Output is correct
6 Correct 5 ms 6868 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 2 ms 852 KB Output is correct
11 Correct 19 ms 4376 KB Output is correct
12 Correct 455 ms 69180 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 380 KB Output is correct
16 Correct 2 ms 904 KB Output is correct
17 Correct 18 ms 4900 KB Output is correct
18 Correct 425 ms 80944 KB Output is correct
19 Correct 494 ms 89516 KB Output is correct
20 Correct 3 ms 1236 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 6 ms 1876 KB Output is correct
25 Correct 19 ms 5408 KB Output is correct
26 Correct 17 ms 4112 KB Output is correct
27 Correct 543 ms 95092 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 456 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 3 ms 980 KB Output is correct
32 Correct 29 ms 5648 KB Output is correct
33 Correct 5 ms 968 KB Output is correct
34 Correct 8 ms 7332 KB Output is correct
35 Correct 753 ms 101672 KB Output is correct
36 Correct 707 ms 97076 KB Output is correct
37 Correct 728 ms 95080 KB Output is correct
38 Correct 767 ms 102028 KB Output is correct
39 Correct 0 ms 340 KB Output is correct
40 Correct 2 ms 852 KB Output is correct
41 Correct 2 ms 980 KB Output is correct
42 Correct 2 ms 980 KB Output is correct
43 Correct 3 ms 980 KB Output is correct
44 Correct 3 ms 980 KB Output is correct
45 Correct 1 ms 468 KB Output is correct
46 Correct 1 ms 644 KB Output is correct
47 Correct 2 ms 980 KB Output is correct
48 Correct 4 ms 980 KB Output is correct
49 Correct 2 ms 980 KB Output is correct
50 Correct 3 ms 1032 KB Output is correct
51 Correct 20 ms 5248 KB Output is correct
52 Correct 20 ms 5272 KB Output is correct
53 Correct 26 ms 5820 KB Output is correct
54 Correct 30 ms 6568 KB Output is correct
55 Correct 1 ms 468 KB Output is correct
56 Correct 3 ms 1936 KB Output is correct
57 Correct 2 ms 1748 KB Output is correct
58 Correct 24 ms 5376 KB Output is correct
59 Correct 26 ms 5880 KB Output is correct
60 Correct 27 ms 5824 KB Output is correct
61 Correct 28 ms 6128 KB Output is correct
62 Correct 57 ms 12524 KB Output is correct
63 Correct 60 ms 12560 KB Output is correct
64 Correct 80 ms 15888 KB Output is correct
65 Correct 305 ms 51420 KB Output is correct
66 Correct 346 ms 58216 KB Output is correct
67 Correct 8 ms 7396 KB Output is correct
68 Correct 5 ms 1108 KB Output is correct
69 Correct 476 ms 91208 KB Output is correct
70 Correct 609 ms 106812 KB Output is correct
71 Correct 791 ms 123572 KB Output is correct
72 Correct 688 ms 106824 KB Output is correct
73 Correct 719 ms 117992 KB Output is correct
74 Correct 552 ms 92388 KB Output is correct
75 Correct 639 ms 104032 KB Output is correct