| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1050634 | NotLinux | Sky Walking (IOI19_walk) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "walk.h"
using namespace std;
#define sz(x) (long long)x.size()
#define all(x) x.begin() , x.end()
const long long N = 1e18 + 7;
const long long inf = 2e18 + 7;
struct Segt{// range add update , range min query , polong long set update
struct Node{
long long left , right;
long long val , lzt;
Node():left(-1) , right(-1) , val(inf) , lzt(0ll){}
} dummy;
vector < Node > tree;
long long create_node(){
tree.push_back(dummy);
return sz(tree) - 1;
}
Segt(){
tree.resize(1);
}
void push(long long ind , long long l , long long r){
if(tree[ind].lzt){
tree[ind].val += tree[ind].lzt;
if(tree[ind].left == -1)tree[ind].left = create_node();
tree[tree[ind].left].lzt += tree[ind].lzt;
if(tree[ind].right == -1)tree[ind].right = create_node();
tree[tree[ind].right].lzt += tree[ind].lzt;
tree[ind].lzt = 0;
}
}
void set(long long ind , long long l , long long r , long long p , long long v){
push(ind,l,r);
if(l == r){
tree[ind].val = v;
return;
}
long long mid = (l + r) / 2;
if(tree[ind].left == -1)tree[ind].left = create_node();
if(tree[ind].right == -1)tree[ind].right = create_node();
if(mid >= p){
set(tree[ind].left , l , mid , p , v);
}
else{
set(tree[ind].right , mid+1 , r , p , v);
}
push(tree[ind].left , l , mid);
push(tree[ind].right , mid+1 , r);
tree[ind].val = min(tree[tree[ind].left].val , tree[tree[ind].right].val);
}
void set(long long p , long long v){
set(0 , 0 , N , p , v);
}
void add(long long ind , long long l , long long r , long long ql , long long qr , long long qv){
push(ind,l,r);
if(l >= ql and r <= qr){
tree[ind].lzt += qv;
push(ind,l,r);
return;
}
else if(l > qr or r < ql){
return;
}
long long mid = (l + r) / 2;
if(tree[ind].left == -1)tree[ind].left = create_node();
if(tree[ind].right == -1)tree[ind].right = create_node();
add(tree[ind].left , l , mid , ql , qr , qv);
add(tree[ind].right , mid+1 , r , ql , qr , qv);
tree[ind].val = min(tree[tree[ind].left].val , tree[tree[ind].right].val);
}
void add(long long l , long long r , long long v){
add(0 , 0 , N , l , r , v);
}
long long query(long long ind , long long l , long long r , long long ql , long long qr){
if(ind == -1)return inf;
push(ind,l,r);
if(l >= ql and r <= qr){
return tree[ind].val;
}
else if(l > qr or r < ql)return inf;
else{
long long mid = (l + r) / 2;
return min(query(tree[ind].left , l , mid , ql , qr) , query(tree[ind].right , mid+1 , r , ql , qr));
}
}
long long query(long long l , long long r){
return query(0 , 0 , N , l , r);
}
};
long long min_distance(vector<int> X, vector<int> H, vector<int> L, vector<int> R, vector<int> Y, int S, int G) {
vector < long long > range_start[sz(X)] , range_end[sz(X)];
for(long long i = 0;i<sz(L);i++){
range_start[L[i]].push_back(i);
range_end[R[i]].push_back(i);
}
Segt segt_top , segt_down;
segt_top.set(0 , 0);
segt_down.set(0 , 0);
for(long long i = 0;i<sz(X);i++){
set < long long > fuck;
vector < long long > make_updates;
for(auto itr : range_start[i]){
fuck.insert(Y[itr]);
long long min_distance = min(segt_top.query(Y[itr] , H[i]) - Y[itr], segt_down.query(0 , Y[itr]) + Y[itr]);
make_updates.push_back(min_distance);
}
for(long long j = 0;j<sz(range_start[i]);j++){
segt_top.set(Y[range_start[i][j]] , make_updates[j] + Y[range_start[i][j]]);
segt_down.set(Y[range_start[i][j]] , make_updates[j] - Y[range_start[i][j]]);
}
if(i != (sz(X)-1)){
for(auto itr : range_end[i]){
if(fuck.count(Y[itr]) == 0){
segt_top.set(Y[itr] , inf);
segt_down.set(Y[itr] , inf);
}
}
}
if(i == 0 and fuck.count(0) == 0){
segt_top.set(0 , inf);
segt_down.set(0 , inf);
}
if(i != (sz(X)-1)){
segt_top.add(0 , N , X[i+1] - X[i]);
segt_down.add(0 , N , X[i+1] - X[i]);
}
}
long long ret = segt_top.query(0 , H[sz(H) - 1]);
if(ret < inf)return ret;
else return -1;
}
signed main() {
int n, m;
cin >> n >> m;
vector<int> x(n), h(n);
for (int i = 0; i < n; i++)
cin >> x[i] >> h[i];
vector<int> l(m), r(m), y(m);
for (int i = 0; i < m; i++)
cin >> l[i] >> r[i] >> y[i];
int s, g;
cin >> s >> g;
int result = min_distance(x, h, l, r, y, s, g);
cout << "result : " << result << endl;
}