Submission #148491

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
148491	2019-09-01 04:32:41	강력한 한방 필살기 (#200)	Crosses on the Grid (FXCUP4_cross)	C++17	63 / 100	118 ms	5740 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>
#define sz(v) ((int)(v).size())
using namespace std;
using pi = pair<int, int>;
using lint = long long;
const int MAXN = 200005;
int N;
lint X[MAXN], Y[MAXN];
lint dp[21][MAXN];
lint func(lint X, lint Y){
  return 2 * X * Y - X * X;
}
long long SelectCross(int K, std::vector<int> I, std::vector<int> O) {
  if(K > 20) return 69;
  N = I.size();
  vector<pi> v, A;
  for(int i=0; i<N; i++) v.emplace_back(I[i], O[i]);
  sort(v.begin(), v.end());
  reverse(v.begin(), v.end());
  priority_queue<int, vector<int>, greater<int> > pq;
  lint ret = 0;
  for(int i=0; i<sz(v); ){
    int e = i;
    while(e < sz(v) && v[i].first == v[e].first) e++;
    for(int j=i; j<e; j++) pq.push(v[j].second);
    while(sz(pq) > K) pq.pop();
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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