oj.uz

Submission #603585

# Submission time Handle Problem Language Result Execution time Memory
603585 2022-07-24T08:30:55 Z rrrr10000 Carnival Tickets (IOI20_tickets) C++14
100 / 100
 946 ms 166556 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<bool> vb;
typedef vector<vb> vvb;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define REP(i,k,n) for(ll i=(ll)(k);i<(ll)(n);i++)
#define pb emplace_back
#define fi first
#define se second
#define all(a) a.begin(),a.end()
template<class T> void out(T a){cout<<a<<endl;}
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<endl;}
const ll inf=1001001001001001001;
#include "tickets.h"

ll find_maximum(int K_,vector<vector<int>> v_){
    ll K=K_;
    ll n=v_.size(),m=v_[0].size();
    vvi v(n,vi(m));rep(i,n)rep(j,m)v[i][j]=v_[i][j];
    vi num(n);
    vp srt;
    rep(i,n)rep(j,K)srt.pb(v[i][j]+v[i][j+m-K],i);
    sort(all(srt));
    rep(i,K*n/2)num[srt[i].se]++;
    vector<vvp> al(n,vvp(2));
    rep(i,n){
        rep(j,num[i])al[i][0].pb(i,j);
        rep(j,K-num[i])al[i][1].pb(i,m-j-1);
    }
    ll sum=0;
    rep(i,n){
        for(auto x:al[i][0])sum-=v[x.fi][x.se];
        for(auto x:al[i][1])sum+=v[x.fi][x.se];
    }
    vector<vector<int>> res(n,vector<int>(m,-1));
    rep(i,K){
        vi cnt(2,n/2),tmp(n,-1);
        // rep(j,n)cout<<al[j][0].size()<<' '<<al[j][1].size()<<endl;
        rep(j,n){
            if(al[j][0].size()==0){
                cnt[1]--;
                tmp[j]=1;
            }
            if(al[j][1].size()==0){
                cnt[0]--;
                tmp[j]=0;
            }
        }
        rep(j,n)if(tmp[j]==-1){
            if(cnt[0]==0){
                cnt[1]--;tmp[j]=1;
            }
            else{
                cnt[0]--;tmp[j]=0;
            }
        }
        // outv(tmp);
        rep(j,n){
            res[j][al[j][tmp[j]].back().se]=i;
            al[j][tmp[j]].pop_back();
        }
    }
    allocate_tickets(res);
    return sum;
}

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 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 21 ms 3884 KB Output is correct
6 Correct 484 ms 71252 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 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 564 KB Output is correct
5 Correct 22 ms 4944 KB Output is correct
6 Correct 589 ms 108152 KB Output is correct
7 Correct 603 ms 125804 KB Output is correct
8 Correct 3 ms 976 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 6 ms 1496 KB Output is correct
13 Correct 17 ms 4600 KB Output is correct
14 Correct 20 ms 4808 KB Output is correct
15 Correct 607 ms 130192 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 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 3 ms 824 KB Output is correct
5 Correct 31 ms 7460 KB Output is correct
6 Correct 5 ms 1372 KB Output is correct
7 Correct 7 ms 1872 KB Output is correct
8 Correct 854 ms 166552 KB Output is correct
9 Correct 834 ms 155152 KB Output is correct
10 Correct 801 ms 152840 KB Output is correct
11 Correct 874 ms 163572 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 496 KB Output is correct
3 Correct 2 ms 564 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 2 ms 724 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 688 KB Output is correct
10 Correct 2 ms 732 KB Output is correct
11 Correct 2 ms 700 KB Output is correct
12 Correct 3 ms 696 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 496 KB Output is correct
3 Correct 2 ms 564 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 2 ms 724 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 688 KB Output is correct
10 Correct 2 ms 732 KB Output is correct
11 Correct 2 ms 700 KB Output is correct
12 Correct 3 ms 696 KB Output is correct
13 Correct 21 ms 3996 KB Output is correct
14 Correct 20 ms 4020 KB Output is correct
15 Correct 28 ms 5584 KB Output is correct
16 Correct 36 ms 7496 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 3 ms 724 KB Output is correct
19 Correct 1 ms 440 KB Output is correct
20 Correct 29 ms 5456 KB Output is correct
21 Correct 25 ms 5624 KB Output is correct
22 Correct 27 ms 6340 KB Output is correct
23 Correct 27 ms 6700 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 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 21 ms 3884 KB Output is correct
12 Correct 484 ms 71252 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 2 ms 564 KB Output is correct
17 Correct 22 ms 4944 KB Output is correct
18 Correct 589 ms 108152 KB Output is correct
19 Correct 603 ms 125804 KB Output is correct
20 Correct 3 ms 976 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 6 ms 1496 KB Output is correct
25 Correct 17 ms 4600 KB Output is correct
26 Correct 20 ms 4808 KB Output is correct
27 Correct 607 ms 130192 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 3 ms 824 KB Output is correct
32 Correct 31 ms 7460 KB Output is correct
33 Correct 5 ms 1372 KB Output is correct
34 Correct 7 ms 1872 KB Output is correct
35 Correct 854 ms 166552 KB Output is correct
36 Correct 834 ms 155152 KB Output is correct
37 Correct 801 ms 152840 KB Output is correct
38 Correct 874 ms 163572 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 2 ms 496 KB Output is correct
41 Correct 2 ms 564 KB Output is correct
42 Correct 2 ms 596 KB Output is correct
43 Correct 2 ms 596 KB Output is correct
44 Correct 2 ms 724 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 688 KB Output is correct
48 Correct 2 ms 732 KB Output is correct
49 Correct 2 ms 700 KB Output is correct
50 Correct 3 ms 696 KB Output is correct
51 Correct 21 ms 3996 KB Output is correct
52 Correct 20 ms 4020 KB Output is correct
53 Correct 28 ms 5584 KB Output is correct
54 Correct 36 ms 7496 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 3 ms 724 KB Output is correct
57 Correct 1 ms 440 KB Output is correct
58 Correct 29 ms 5456 KB Output is correct
59 Correct 25 ms 5624 KB Output is correct
60 Correct 27 ms 6340 KB Output is correct
61 Correct 27 ms 6700 KB Output is correct
62 Correct 54 ms 10444 KB Output is correct
63 Correct 58 ms 10468 KB Output is correct
64 Correct 85 ms 18792 KB Output is correct
65 Correct 279 ms 55768 KB Output is correct
66 Correct 365 ms 70972 KB Output is correct
67 Correct 6 ms 1872 KB Output is correct
68 Correct 6 ms 1340 KB Output is correct
69 Correct 476 ms 91312 KB Output is correct
70 Correct 670 ms 125856 KB Output is correct
71 Correct 946 ms 166556 KB Output is correct
72 Correct 833 ms 144260 KB Output is correct
73 Correct 783 ms 155032 KB Output is correct
74 Correct 621 ms 111848 KB Output is correct
75 Correct 669 ms 123212 KB Output is correct