oj.uz

Submission #300326

# Submission time Handle Problem Language Result Execution time Memory
300326 2020-09-17T05:20:16 Z guangxuan Carnival Tickets (IOI20_tickets) C++14
55 / 100
 1484 ms 75284 KB 
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;

long long find_maximum(int k, std::vector<std::vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	int all_x[n*m];
	for (int i = 0; i < n; i++) {
		for(int j=0;j<m;j++){
			all_x[i*m+j] = x[i][j];
		}
	}
	nth_element(all_x,all_x+n*m/2,all_x+n*m);
	int med = all_x[n*m/2];
	for (int i = 0; i < n; i++) {
		for(int j=0;j<m;j++){
			x[i][j] -= med;
            //printf("%d ",x[i][j]);
		}//puts("");
	}
	int st = -1e9, en =1e9;
	while(st<en){
        int mi = st+(en-st)/2;
        int pos=0,neg=0;
        for(int i=0;i<n;i++){
            int l = 0, r = m-1;
            for(int iter=0;iter<k;iter++){
                int lv = x[i][l], rv = x[i][r];
                lv=mi+abs(lv);
                rv=abs(rv);
                if(lv>rv && x[i][l]<=0){
                    neg++;
                    l++;
                }
                else{
                    pos++;
                    r--;
                }
            }
        }
        if(neg<n*k/2)st = mi+1;
        else en = mi;
	}
    long long ans = 0;
	int mi = st;    
    int pos=0,neg=0;
    int storel[n],storer[n];
    for(int i=0;i<n;i++){
        int l = 0, r = m-1;
        for(int iter=0;iter<k;iter++){
            int lv = x[i][l], rv = x[i][r];
            lv=mi+abs(lv);
            rv=abs(rv);
            if(lv>rv && x[i][l]<=0){
                ans+=abs(x[i][l]);
                neg++;
                l++;
            }
            else{
                ans+=abs(x[i][r]);
                pos++;
                r--;
            }
        }
        storel[i]=l;
        storer[i]=r;
    }
    //printf("pne: %d %d\n",pos,neg);
    //printf("mi: %d \n",mi);
    vector<int> low[n], high[n];
    for(int i=0;i<n;i++){
        while((storel[i]!=0) && neg>n*k/2){
            int l = storel[i]-1, r = storer[i];
            int lv = x[i][l], rv = x[i][r];
            lv=mi+abs(lv);
            rv=abs(rv);
            if(x[i][r]<0||lv-1!=rv)break;
            pos++;neg--;
            ans-=abs(x[i][l]);ans+=abs(x[i][r]);
            storel[i]--;storer[i]--;
        }
        for(int j=0;j<storel[i];j++){
            low[i].push_back(j);
        }
        for(int j=m-1;j>storer[i];j--){
            high[i].push_back(j);
        }
    }
	std::vector<std::vector<int>> answer(n,vector<int>(m,-1));
    pair<int,int> diff2id[n];
    /*for(int i=0;i<n;i++){
        printf("%d %d\n",storel[i],storer[i]);
        printf("lo: ");
        for(int j:low[i])printf("%d ",j);
        printf("high: ");
        for(int j:high[i])printf("%d ",j);
        puts("");
    }*/
    for(int r=0;r<k;r++){
        for(int i=0;i<n;i++)diff2id[i] = make_pair(high[i].size()-low[i].size(),i);
        sort(diff2id,diff2id+n);
        for(int i=0;i<n;i++){
            if(i<n/2){
                int x = diff2id[i].second;
                answer[x][low[x].back()] = r;
                low[x].pop_back();
            }
            else{
                int x = diff2id[i].second;
                answer[x][high[x].back()] = r;
                high[x].pop_back();
            }
        }
    }
    
	allocate_tickets(answer);
	return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 2 ms 896 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 32 ms 2808 KB Output is correct
6 Correct 785 ms 60384 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 30 ms 3072 KB Output is correct
6 Correct 883 ms 67444 KB Output is correct
7 Correct 842 ms 70836 KB Output is correct
8 Correct 6 ms 640 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 8 ms 1024 KB Output is correct
13 Correct 25 ms 2688 KB Output is correct
14 Correct 45 ms 2808 KB Output is correct
15 Correct 868 ms 72400 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 4 ms 512 KB Output is correct
5 Correct 62 ms 3484 KB Output is correct
6 Correct 12 ms 768 KB Output is correct
7 Correct 15 ms 1152 KB Output is correct
8 Correct 1484 ms 75216 KB Output is correct
9 Correct 1280 ms 71084 KB Output is correct
10 Correct 1239 ms 70272 KB Output is correct
11 Correct 1366 ms 75284 KB Output is correct

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 4 ms 512 KB Output is correct
4 Correct 4 ms 512 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Incorrect 1 ms 384 KB Contestant returned 160863412841 but the tickets gives a total value of 161016913413
9 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 4 ms 512 KB Output is correct
4 Correct 4 ms 512 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Incorrect 1 ms 384 KB Contestant returned 160863412841 but the tickets gives a total value of 161016913413
9 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 2 ms 896 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 32 ms 2808 KB Output is correct
12 Correct 785 ms 60384 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 3 ms 512 KB Output is correct
17 Correct 30 ms 3072 KB Output is correct
18 Correct 883 ms 67444 KB Output is correct
19 Correct 842 ms 70836 KB Output is correct
20 Correct 6 ms 640 KB Output is correct
21 Correct 0 ms 256 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 1 ms 256 KB Output is correct
24 Correct 8 ms 1024 KB Output is correct
25 Correct 25 ms 2688 KB Output is correct
26 Correct 45 ms 2808 KB Output is correct
27 Correct 868 ms 72400 KB Output is correct
28 Correct 0 ms 256 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 4 ms 512 KB Output is correct
32 Correct 62 ms 3484 KB Output is correct
33 Correct 12 ms 768 KB Output is correct
34 Correct 15 ms 1152 KB Output is correct
35 Correct 1484 ms 75216 KB Output is correct
36 Correct 1280 ms 71084 KB Output is correct
37 Correct 1239 ms 70272 KB Output is correct
38 Correct 1366 ms 75284 KB Output is correct
39 Correct 0 ms 256 KB Output is correct
40 Correct 3 ms 512 KB Output is correct
41 Correct 4 ms 512 KB Output is correct
42 Correct 4 ms 512 KB Output is correct
43 Correct 4 ms 512 KB Output is correct
44 Correct 4 ms 512 KB Output is correct
45 Correct 1 ms 384 KB Output is correct
46 Incorrect 1 ms 384 KB Contestant returned 160863412841 but the tickets gives a total value of 161016913413
47 Halted 0 ms 0 KB -