CodeForces 160E :Buses and People 线段树

传送门

题意

分析

先将人和车按照初始位置从小到大排序，这样就可以维护双指针缩小范围
然后将左端点小于等于当前乘客的车加入线段树，线段树上每一个节点表示当前时间到达的位置
然后线段树上二分即可

（线段树上二分需要时刻记住左子树是一个残缺区间，维护的区间值可能并不是出现在查询的残缺区间，需要去判断返回值再去判断是否要查询右子树）

代码

#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 10;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
    char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
    while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
VI nums;
struct bus
{
    int t,s,e;
    int id;
}a[N];;
struct People{
    int t,s,e;
    int id;
}b[N];
int n,m;
int ans[N];

bool cmp(bus A,bus B){
    return A.s < B.s;
}

bool cmp1(People A,People B){
    return A.s < B.s;
}

int find(int x){
    return lower_bound(all(nums),x) - nums.begin();
}

struct Node{
    int l,r;
    int val;
    int id;
}tr[N * 4];

void push(int u){
    tr[u].val = max(tr[u << 1].val,tr[u << 1 | 1].val);
}

void build(int u,int l,int r){
    tr[u] = {l,r,0,0};
    if(l == r) return;
    int mid = l + r >> 1;
    build(u << 1,l,mid),build(u << 1 | 1,mid + 1,r);
}

void modify(int u,int x,int val,int id){
    if(tr[u].l == tr[u].r){
        tr[u].val = val;
        tr[u].id = id;
        return;
    }
    int mid = tr[u].l + tr[u].r >> 1;
    if(x <= mid) modify(u << 1,x,val,id);
    else modify(u << 1 | 1,x,val,id);
    push(u);
}

int query(int u,int s,int x){
    if(tr[u].val < x) return -1;
    if(tr[u].l == tr[u].r) return tr[u].id;
    int mid = tr[u].l + tr[u].r >> 1;
    int ans = -1;
    if(s <= mid) ans = query(u << 1,s,x);
    if(ans == -1) ans = query(u << 1 | 1,s,x);
    return ans;
}

int main() {
    read(n),read(m);
    for(int i = 1;i <= n;i++) read(a[i].s),read(a[i].e),read(a[i].t),a[i].id = i,nums.pb(a[i].t);
    for(int i = 1;i <= m;i++) read(b[i].s),read(b[i].e),read(b[i].t),b[i].id = i,nums.pb(b[i].t);
    sort(a + 1,a + 1 + n,cmp);
    sort(b + 1,b + 1 + m,cmp1);
    sort(all(nums));
    nums.erase(unique(all(nums)),nums.end());
    for(int i = 1;i <= n;i++) a[i].t = find(a[i].t) + 1;
    for(int i = 1;i <= m;i++) b[i].t = find(b[i].t) + 1;
    int sz = SZ(nums);
    build(1,1,sz);
    int j = 1;
    for(int i = 1;i <= m;i++){
        while(j <= n && a[j].s <= b[i].s) {
            modify(1,a[j].t,a[j].e,a[j].id);
            j++;
        }
        ans[b[i].id] = query(1,b[i].t,b[i].e);
    }
    for(int i = 1;i <= m;i++) printf("%d ",ans[i]);
    return 0;
}