Submission #149184

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
149184	2019-09-01 05:54:57	Little Piplup (#200)	Crosses on the Grid (FXCUP4_cross)	C++17	100 / 100	127 ms	8808 KiB

cross

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 "cross.h"
#include<bits/stdc++.h>
//using namespace std;
long long SelectCross(int K, std::vector<int> I, std::vector<int> O) {
  int N = I.size();
  std::pair<long long, long long> soo[N];
  for ( int i = 0 ; i < N ; ++i ) {
    soo[i] = {O[i], I[i]};
  }
  sort(soo, soo + N, std::greater< std::pair<long long, long long> >());
  std::priority_queue<long long, std::vector<long long>, std::greater<long long>> puts;
  for ( int i = 0 ; i < K ; ++i ) {
    puts.push(soo[i].second);
  }
  long long out = soo[K-1].first;
  long long in = puts.top();
  long long ret = out * out - (out-in) * (out-in);
  for ( int i = K ; i < N ; ++i ) {
    out = soo[i].first;
    puts.pop();
    puts.push(soo[i].second);
    in = puts.top();
    ret = std::max(ret, out * out - (out-in) * (out-in) );
  }
  return ret;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 8 / 8
• Subtask 2: 55 / 55
• Subtask 3: 37 / 37