Submission #751262

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
751262	2023-05-31 10:04:26	dsyz	Discharging (NOI20_discharging)	C++17	100 / 100	138 ms	33596 KiB

Discharging

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 <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MAXN (1000005)
struct ConvexHull {
  deque<pair<ll,ll> > dq;
  ll f(pair<ll,ll> line,ll x){
    return line.first * x + line.second;
  }
  ll query(ll x){
    while(dq.size() > 1){
      if(f(dq[0],x) < f(dq[1],x)){
        dq.pop_front();
      }else{
        break;
      }
    }
    return f(dq[0],x);
  }
  long double Intersect(ll a,ll b,ll c,ll d){
    return (long double)(d - b) / (a - c);
  }
  long double intersect(pair<ll,ll> p1,pair<ll,ll> p2){
    return Intersect(p1.first,p1.second,p2.first,p2.second);
  }
  void ins(ll m,ll c){
    pair<ll,ll> line = make_pair(m,c);
    while(dq.size() > 1){
      ll s = dq.size();
      if(intersect(dq[s - 1],line) <= intersect(dq[s - 2],line)){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 9 / 9
• Subtask 2: 13 / 13
• Subtask 3: 25 / 25
• Subtask 4: 11 / 11
• Subtask 5: 14 / 14
• Subtask 6: 28 / 28