Submission #618915

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
618915	2022-08-02 08:20:05	joelau	Road Construction (JOI21_road_construction)	C++14	7 / 100	10100 ms	39232 KiB

road_construction

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;
long long N,K,ft[250005];
pair<long long,long long> lst[250005];
vector< tuple<long long,long long,long long,long long> > A;
vector<long long> dis;
map<long long,long long> mp;
void update (long long x, long long v) {
  x++;
  while (x <= N) ft[x] += v, x += x & -x;
}
long long query (long long x) {
  x++;
  long long ans = 0;
  while (x) ans += ft[x], x -= x & -x;
  return ans;
}
long long f(long long x) {
  if (mp.find(x) != mp.end()) return mp[x];
  A.clear();
  for (long long i = 0; i < N; ++i) {
    long long a = lower_bound(dis.begin(),dis.end(),lst[i].second) - dis.begin();
    long long b = lower_bound(dis.begin(),dis.end(),lst[i].second-x) - dis.begin();
    long long c = upper_bound(dis.begin(),dis.end(),lst[i].second+x) - dis.begin() - 1;
    A.emplace_back(lst[i].first,0,a,0);
    A.emplace_back(lst[i].first-x,-1,b,c);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 5
• Subtask 2: 0 / 6
• Subtask 3: 7 / 7
• Subtask 4: 0 / 20
• Subtask 5: 0 / 27
• Subtask 6: 0 / 35