codeforces 853B

B. Jury Meeting

time limit per test：1 second    memory limit per test：512 megabytes

https://codeforces.com/problemset/problem/853/B

 

分别处理到达和返回的航班，按天数排序后，以k为区间长度逐个框。

注意判断条件（样例1中8-3=5，但是不可取）和m的0的特殊情况。

 

#include <bits/stdc++.h>
using namespace std;

struct information{
    int day;
    int from;
    int to;
    long long cost;
};

vector<information> f,t;

bool cmpf(information a,information b){
        return a.day<b.day;
}

bool cmpt(information a,information b){
        return a.day>b.day;
}

int main()
{
    int n,m,k;
    cin>>n>>m>>k;
    for(int i=0;i<m;i++){
        information temp;
        cin>>temp.day>>temp.from>>temp.to>>temp.cost;
        if(temp.from==0){
            t.push_back(temp);
        }
        else{
            f.push_back(temp);
        }
    }
    if(f.size()==0 || t.size()==0){
        cout<<-1;
        return 0;
    }
    sort(f.begin(),f.end(),cmpf);
    sort(t.begin(),t.end(),cmpt);
    k++;

    vector<long long> judgef(n+1,-1),judget(n+1,-1);

    if(t[0].day-k-f[0].day<0){
        cout<<-1;
        return 0;
    }

    int workf=0,workt=0;
    int cf=0,ct=0;
    long long sum=0;
    vector<long long> moneyf(t[0].day-k-f[0].day+1),moneyt(t[0].day-k-f[0].day+1);

    for(int i=f[0].day;i<=t[0].day-k;i++){
        while(workf<f.size() && f[workf].day<=i){
            if(judgef[f[workf].from]==-1){
                judgef[f[workf].from]=f[workf].cost;
                cf++;
                sum+=judgef[f[workf].from];
            }
            else{
                sum-=judgef[f[workf].from];
                judgef[f[workf].from]=min(judgef[f[workf].from],f[workf].cost);
                sum+=judgef[f[workf].from];
            }
            workf++;
        }
        if(cf==n)
            moneyf[i-f[0].day]=sum;
        else
            moneyf[i-f[0].day]=-1;
        //cout<<moneyf[i-f[0].day]<<" ";
    }
    //cout<<endl;
    //cout<<"debug";
    sum=0;
    for(int i=t[0].day;i>=f[0].day+k;i--){
        while(workt<t.size() && t[workt].day>=i){
            if(judget[t[workt].to]==-1){
                judget[t[workt].to]=t[workt].cost;
                ct++;
                sum+=judget[t[workt].to];
            }
            else{
                sum-=judget[t[workt].to];
                judget[t[workt].to]=min(judget[t[workt].to],t[workt].cost);
                sum+=judget[t[workt].to];
            }
            workt++;
        }
        if(ct==n)
            moneyt[i-f[0].day-k]=sum;
        else
            moneyt[i-f[0].day-k]=-1;
        //cout<<moneyt[i-f[0].day-k]<<" ";
    }
    //cout<<endl;
    vector<long long>money;
    for(int i=0;i<=t[0].day-k-f[0].day;i++){
        //cout<<moneyf[i]<<" "<<moneyt[i]<<endl;
        if(moneyf[i]!=-1 && moneyt[i]!=-1){
            money.push_back(moneyf[i]+moneyt[i]);
        }
    }

    if(money.size()==0){
        cout<<-1;
        return 0;
    }
    sort(money.begin(),money.end());
    cout<<money[0];
    return 0;
}