oj.uz

Submission #640135

# Submission time Handle Problem Language Result Execution time Memory
640135 2022-09-13T17:53:28 Z lis05st Carnival Tickets (IOI20_tickets) C++17
100 / 100
 713 ms 67212 KB 
#ifdef LIS05ST
    #define _GLIBCXX_DEBUG
    #define _GLIBCXX_DEBUG_PEDANTIC
#endif
#pragma GCC optimize("O3")
#pragma GCC target("avx2,popcnt,lzcnt")
#include"tickets.h"
#include"bits/stdc++.h"
using namespace std;

typedef long long ll;
typedef long double ld;
const int NMAX=1500;
int p1[NMAX+5],p2[NMAX+5];
int cnt2[NMAX+5];

vector<int>plusa[NMAX+5],minusa[NMAX+5];

long long find_maximum(signed k, std::vector<std::vector<signed>> d){
    int n=d.size();int m=d[0].size();
    vector<vector<signed>>ans(n,vector<signed>(m,-1));
    for(int i=0;i<n;i++)for(int ii=0;ii<m;ii++)ans[i][0]=-1;

    priority_queue<pair<int,int>>q;
    ll res=0;
    for(int i=0;i<n;i++){
        p1[i]=k-1;
        p2[i]=m-1;
        for(int ii=0;ii<k;ii++){
            res-=d[i][ii];
        }
        q.push({d[i][p2[i]]+d[i][p1[i]],i});
    }
    int cnt=n*k/2;
    while(cnt--){
        auto [a,b]=q.top();
        q.pop();
        res+=a;
        plusa[b].push_back(p2[b]);
        cnt2[b]++;
        p2[b]--;
        p1[b]--;
        if(p1[b]==-1)continue;
        q.push({d[b][p2[b]]+d[b][p1[b]],b});
    }
    for(int i=0;i<n;i++)for(int ii=0;ii<=p1[i];ii++)minusa[i].push_back(ii);
    //cout<<st1.size()<<" "<<st2.size()<<" "<<res<<"\n";
    //cout<<"pile -\n";
    //for(auto [a,b]:st1)cout<<"color: "<<a<<" value: "<<d[a][b]<<"\n";
    //cout<<"pile +\n";
    //for(auto [a,b]:st2)cout<<"color: "<<a<<" value: "<<d[a][b]<<"\n";
    vector<int>colors;for(int i=0;i<n;i++)colors.push_back(i);
    for(int step=0;step<k;step++){
        sort(colors.begin(),colors.end(),[](int a,int b){
            return cnt2[a]>cnt2[b];
        });
        for(int i=0;i<n/2;i++){
            int colorId=colors[i];
            int colorNum=plusa[colorId].back();
            plusa[colorId].pop_back();

            ans[colorId][colorNum]=step;
            cnt2[colorId]--;
        }

        for(int i=n/2;i<n;i++){
            int colorId=colors[i];
            int colorNum=minusa[colorId].back();
            minusa[colorId].pop_back();

            ans[colorId][colorNum]=step;
        }
    }
    allocate_tickets(ans);

    return res;
};


#define MULTITESTS false
void solve(int testCase){

}

void precalc(){

}
/*
signed main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    precalc();
    int t=1;
    if(MULTITESTS)cin>>t;
    for(int i=1;i<=t;i++){
        auto t1=clock();
        solve(i);
        auto t2=clock();
        float delta=t2-t1;
        delta/=CLOCKS_PER_SEC;
        #ifdef LIS05ST
        cout<<"("<<i<<")------------"<<fixed<<setprecision(2)<<delta<<"s\n";
        #endif
    }
}*/

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 376 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 372 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 2 ms 852 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 368 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 19 ms 2544 KB Output is correct
6 Correct 512 ms 51528 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 516 KB Output is correct
5 Correct 19 ms 2900 KB Output is correct
6 Correct 483 ms 58632 KB Output is correct
7 Correct 534 ms 61108 KB Output is correct
8 Correct 3 ms 596 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 5 ms 980 KB Output is correct
13 Correct 19 ms 2516 KB Output is correct
14 Correct 23 ms 2644 KB Output is correct
15 Correct 582 ms 63124 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 340 KB Output is correct
3 Correct 1 ms 368 KB Output is correct
4 Correct 2 ms 644 KB Output is correct
5 Correct 25 ms 3272 KB Output is correct
6 Correct 4 ms 892 KB Output is correct
7 Correct 7 ms 1148 KB Output is correct
8 Correct 713 ms 67160 KB Output is correct
9 Correct 670 ms 63424 KB Output is correct
10 Correct 649 ms 62764 KB Output is correct
11 Correct 701 ms 67212 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 596 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 2 ms 616 KB Output is correct
5 Correct 2 ms 564 KB Output is correct
6 Correct 2 ms 596 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 2 ms 628 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 2 ms 564 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 596 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 2 ms 616 KB Output is correct
5 Correct 2 ms 564 KB Output is correct
6 Correct 2 ms 596 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 2 ms 628 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 2 ms 564 KB Output is correct
13 Correct 19 ms 2512 KB Output is correct
14 Correct 19 ms 2576 KB Output is correct
15 Correct 29 ms 2908 KB Output is correct
16 Correct 25 ms 3272 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 596 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 20 ms 2856 KB Output is correct
21 Correct 22 ms 2864 KB Output is correct
22 Correct 24 ms 2980 KB Output is correct
23 Correct 26 ms 3040 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 1 ms 376 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 372 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 2 ms 852 KB Output is correct
7 Correct 0 ms 368 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 19 ms 2544 KB Output is correct
12 Correct 512 ms 51528 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 516 KB Output is correct
17 Correct 19 ms 2900 KB Output is correct
18 Correct 483 ms 58632 KB Output is correct
19 Correct 534 ms 61108 KB Output is correct
20 Correct 3 ms 596 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 5 ms 980 KB Output is correct
25 Correct 19 ms 2516 KB Output is correct
26 Correct 23 ms 2644 KB Output is correct
27 Correct 582 ms 63124 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 368 KB Output is correct
31 Correct 2 ms 644 KB Output is correct
32 Correct 25 ms 3272 KB Output is correct
33 Correct 4 ms 892 KB Output is correct
34 Correct 7 ms 1148 KB Output is correct
35 Correct 713 ms 67160 KB Output is correct
36 Correct 670 ms 63424 KB Output is correct
37 Correct 649 ms 62764 KB Output is correct
38 Correct 701 ms 67212 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 2 ms 596 KB Output is correct
41 Correct 2 ms 596 KB Output is correct
42 Correct 2 ms 616 KB Output is correct
43 Correct 2 ms 564 KB Output is correct
44 Correct 2 ms 596 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 2 ms 512 KB Output is correct
48 Correct 2 ms 628 KB Output is correct
49 Correct 2 ms 596 KB Output is correct
50 Correct 2 ms 564 KB Output is correct
51 Correct 19 ms 2512 KB Output is correct
52 Correct 19 ms 2576 KB Output is correct
53 Correct 29 ms 2908 KB Output is correct
54 Correct 25 ms 3272 KB Output is correct
55 Correct 2 ms 384 KB Output is correct
56 Correct 2 ms 596 KB Output is correct
57 Correct 2 ms 468 KB Output is correct
58 Correct 20 ms 2856 KB Output is correct
59 Correct 22 ms 2864 KB Output is correct
60 Correct 24 ms 2980 KB Output is correct
61 Correct 26 ms 3040 KB Output is correct
62 Correct 53 ms 6316 KB Output is correct
63 Correct 57 ms 6352 KB Output is correct
64 Correct 77 ms 7860 KB Output is correct
65 Correct 245 ms 26452 KB Output is correct
66 Correct 302 ms 29252 KB Output is correct
67 Correct 8 ms 1236 KB Output is correct
68 Correct 4 ms 980 KB Output is correct
69 Correct 464 ms 51820 KB Output is correct
70 Correct 583 ms 59004 KB Output is correct
71 Correct 705 ms 67020 KB Output is correct
72 Correct 583 ms 64592 KB Output is correct
73 Correct 705 ms 64556 KB Output is correct
74 Correct 486 ms 57236 KB Output is correct
75 Correct 546 ms 57024 KB Output is correct