Submission #255286

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
255286	2020-07-31 17:06:09	model_code	Discharging (NOI20_discharging)	C++17	100 / 100	137 ms	16120 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;
typedef tuple<long double, long long,long long>  tp;
bool cmp(tp T1, tp T2, long long grad, long long constant){
  long double m1, c1, m2, c2;
  long double temp;
  tie(temp,m1,c1) = T1;
  tie(temp,m2,c2) = T2;
  return (constant - c2)*(m1 - grad) < (constant - c1)*(m2 - grad);
}
long double intersect(tp T1, tp T2){
  long double m1, c1, m2, c2;
  long double temp;
  tie(temp,m1,c1) = T1;
  tie(temp,m2,c2) = T2;
  return (long double)(c1-c2)/(long double)(m2-m1);
}
long long solve(int n, vector<long long> T){
  deque<tp> convexHull; //intersect, gradient, constant
  long long curMax = 0, curDpVal = 0;
  for(int i = 1; i <= n; i++){
    long long curT = T[i];
    if(curT >= curMax){
      long long grad = -i+1, constant = curDpVal;
      while(convexHull.size() >= 2 && cmp(convexHull[convexHull.size()-2],convexHull.back(),grad,constant)){
        convexHull.pop_back();
      }
      tp newLine = make_tuple(2e9,grad,constant);
      if(i!=1)get<0>(convexHull.back()) = intersect(convexHull.back(),newLine);
      convexHull.push_back(newLine);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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