Submission #300364

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
300364	2020-09-17 05:53:34	guangxuan	Carnival Tickets (IOI20_tickets)	C++14	11 / 100	2 ms	896 KiB

tickets

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#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-7, en =1e9+7;
  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);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 11 / 11
• Subtask 2: 0 / 16
• Subtask 3: 0 / 14
• Subtask 4: 0 / 14
• Subtask 5: 0 / 12
• Subtask 6: 0 / 23
• Subtask 7: 0 / 10