洛谷 P5661 公交换乘(队列)

题目传送门

解题思路:

暴力模拟.

AC代码:

#include<iostream>
#include<cstdio>
#include<queue>

using namespace std;

long long n,ans,tot;
bool vis;
struct kkk {
    long long ti,v;
}e[100001];
queue<kkk> q,q1;

int main() {
    scanf("%lld",&n);
    for(int i = 1;i <= n; i++) {
        long long x,y,z;
        scanf("%lld%lld%lld",&x,&y,&z);
        if(x == 0) {
            ans += y;
            e[++tot].ti = z + 45;e[tot].v = y;
            q.push(e[tot]);
        }
        if(x == 1) {
            vis = 0;
            while(!q.empty()) {
                kkk o = q.front();
                if(o.ti < z)
                    q.pop();
                else    
                    break; 
            }
            while(!q.empty()) {
                kkk o = q.front();
                if(o.v < y) {
                    q1.push(o);
                    q.pop();
                    continue;
                }
                vis = 1;
                q.pop();
                break;
            }
            if(!vis) ans += y;
            while(!q.empty()) {
                q1.push(q.front());
                q.pop();
            }
            while(!q1.empty()) {
                q.push(q1.front());
                q1.pop();
            }
        }
    }
    printf("%lld",ans);
    return 0;
} 

//CSP-J 2019 T2