oj.uz

Submission #793054

# Submission time Handle Problem Language Result Execution time Memory
793054 2023-07-25T13:07:19 Z Khizri Carnival Tickets (IOI20_tickets) C++17
55 / 100
 643 ms 88804 KB 
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
const int mxn=1500+5;
ll n,m,l[mxn],mid[mxn],r[mxn],sz[mxn],pre[mxn][mxn];
vector<vector<int>>vt;
bool cmp(int a,int b){
    ll x=pre[a][mid[a]],y=pre[b][mid[b]];
    if(l[a]-1>=0){
        x-=pre[a][l[a]-1];
    }
    if(l[b]-1>=0){
        y-=pre[b][l[b]-1];
    }
    return vt[a][r[a]]+x>vt[b][r[b]]+y;
}
bool cmp2(int i,int j){
    return sz[i]>sz[j];
}
long long find_maximum(int k, vector<vector<int>> x) {
    vt=x;
    n = x.size();
	m = x[0].size();
	for(int i=0;i<n;i++){
        pre[i][0]=vt[i][0];
        for(int j=1;j<m;j++){
            pre[i][j]=pre[i][j-1]+vt[i][j];
        }
    }
	vector<std::vector<int>> ans(n,vector<int>(m,-1));
	ll sum=0;
	vector<int>idx;
	for(int i=0;i<n;i++){
        l[i]=0;
        r[i]=m-1;
        mid[i]=k-1;
        idx.pb(i);
	}
	if(k==m){
        vector<pii>v;
        for(int i=0;i<n;i++){
            for(int j=0;j<m;j++){
                v.pb({vt[i][j],i});
            }
        }
        sort(all(v));
        for(int i=0;i<v.size()/2;i++){
            sz[v[i].S]++;
        }
        for(int id=1;id<=k;id++){
            sort(all(idx),cmp2);
            ll a=0,b=0;
            for(int i=0;i<n/2;i++){
                a+=vt[idx[i]][l[idx[i]]];
                ans[idx[i]][l[idx[i]]]=id-1;
                sz[idx[i]]--;
                l[idx[i]]++;
            }
            for(int i=n/2;i<n;i++){
                b+=vt[idx[i]][r[idx[i]]];
                ans[idx[i]][r[idx[i]]]=id-1;
                r[idx[i]]--;
            }
            sum+=b-a;
        }
        allocate_tickets(ans);
        return sum;
	}
	for(int id=1;id<=k;id++){
        sort(all(idx),cmp);
        ll a=0,b=0;
        for(int i=0;i<n/2;i++){
            b+=vt[idx[i]][r[idx[i]]];
            ans[idx[i]][r[idx[i]]]=id-1;
            r[idx[i]]--;
            mid[idx[i]]--;
        }
        for(int i=n/2;i<n;i++){
            a+=vt[idx[i]][l[idx[i]]];
            ans[idx[i]][l[idx[i]]]=id-1;
            l[idx[i]]++;
        }
        sum+=b-a;
	}
	allocate_tickets(ans);
	return sum;
}
/*
4 4 3
0 0 1 1
0 1 1 1
0 0 1 1
0 1 1 1
*/

Compilation message

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:58:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |         for(int i=0;i<v.size()/2;i++){
      |                     ~^~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 292 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 1620 KB Output is correct
6 Correct 3 ms 6868 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 0 ms 340 KB Output is correct
4 Correct 2 ms 852 KB Output is correct
5 Correct 17 ms 4576 KB Output is correct
6 Correct 415 ms 77952 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 1 ms 340 KB Output is correct
4 Correct 2 ms 852 KB Output is correct
5 Correct 17 ms 4820 KB Output is correct
6 Correct 454 ms 78988 KB Output is correct
7 Correct 582 ms 83592 KB Output is correct
8 Correct 3 ms 1108 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 308 KB Output is correct
12 Correct 5 ms 1724 KB Output is correct
13 Correct 15 ms 5236 KB Output is correct
14 Correct 14 ms 3640 KB Output is correct
15 Correct 560 ms 84404 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 852 KB Output is correct
5 Correct 24 ms 5020 KB Output is correct
6 Correct 4 ms 960 KB Output is correct
7 Correct 7 ms 7252 KB Output is correct
8 Correct 643 ms 88780 KB Output is correct
9 Correct 591 ms 84112 KB Output is correct
10 Correct 603 ms 82892 KB Output is correct
11 Correct 640 ms 88804 KB Output is correct

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 852 KB Output is correct
3 Incorrect 2 ms 852 KB Contestant returned 191884647169 while correct return value is 191909121109.
4 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 852 KB Output is correct
3 Incorrect 2 ms 852 KB Contestant returned 191884647169 while correct return value is 191909121109.
4 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 292 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 1620 KB Output is correct
6 Correct 3 ms 6868 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 2 ms 852 KB Output is correct
11 Correct 17 ms 4576 KB Output is correct
12 Correct 415 ms 77952 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 852 KB Output is correct
17 Correct 17 ms 4820 KB Output is correct
18 Correct 454 ms 78988 KB Output is correct
19 Correct 582 ms 83592 KB Output is correct
20 Correct 3 ms 1108 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 1 ms 308 KB Output is correct
24 Correct 5 ms 1724 KB Output is correct
25 Correct 15 ms 5236 KB Output is correct
26 Correct 14 ms 3640 KB Output is correct
27 Correct 560 ms 84404 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 2 ms 852 KB Output is correct
32 Correct 24 ms 5020 KB Output is correct
33 Correct 4 ms 960 KB Output is correct
34 Correct 7 ms 7252 KB Output is correct
35 Correct 643 ms 88780 KB Output is correct
36 Correct 591 ms 84112 KB Output is correct
37 Correct 603 ms 82892 KB Output is correct
38 Correct 640 ms 88804 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 2 ms 852 KB Output is correct
41 Incorrect 2 ms 852 KB Contestant returned 191884647169 while correct return value is 191909121109.
42 Halted 0 ms 0 KB -