QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#696702#9528. New Energy Vehiclejnmrtnz111WA 0ms3596kbC++202.7kb2024-11-01 00:35:472024-11-01 00:35:48

Judging History

This is the latest submission verdict.

  • [2024-11-01 00:35:48]
  • Judged
  • Verdict: WA
  • Time: 0ms
  • Memory: 3596kb
  • [2024-11-01 00:35:47]
  • Submitted

answer

#include<bits/stdc++.h>
#define forn(u,n) for(int u=0;u<n;++u)
#define forns(u,i,n) for(int u=i;u<n;++u)
#define reverso
#define pb push_back
#define all(a) a.begin(), a.end()
#define snd second
#define fst first

using namespace std;

typedef long long ll;
int main(){
    #ifdef LOCAL
        freopen("entra.in","r",stdin);
    #endif // LOCAL
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    int t;
    cin>>t;
    while(t--){
        int n,m;
        cin>>n>>m;
        queue<ll>place[n+2];//PARA CADA BATERIA TIENE ORDENADO DISTANCIA DE LA MAS CERCANA
        vector<ll>battery(n+1,0);//ACTUALMENTE PARA DEL TIPO I HAY battery_i
        vector<ll>tope(n+1,0);//ACTUALMENTE PARA DEL TIPO I HAY battery_i
        forns(i,1,n+1){
            cin>>battery[i];
            tope[i]=battery[i];
        }
        vector<pair<ll,ll>>charge;//ORDENA LA GASOLINERAS
        priority_queue<pair<ll,ll>, vector<pair<ll,ll>>, greater<pair<ll,ll>>>prioridad; // DE CUAL BATERIA TOMAR
        forn(i,m){
            ll x;
            int type;
            cin>>x>>type;
            charge.pb({x,type});
        }
        sort(all(charge));
        for(auto it:charge){
            place[it.snd].push(it.fst);
        }
        forns(i,1,n+1){
            if(place[i].size()){
                prioridad.push({place[i].front(),i});
                place[i].pop();
            }
            else{
                prioridad.push({INT_MAX,i});
            }
        }
        ll cur=0;//POSICIÓN ACTUAL
        int indx=0;//posición gasolinera
        charge.pb({LLONG_MAX,1});
        for(auto it:charge){
        }
        for(int i=0;i<charge.size();i++){
            pair<ll , ll >gasAct=charge[i];
            while(cur<gasAct.first and prioridad.size()){
                ll batAct=prioridad.top().second;
                if(cur+battery[batAct]>gasAct.first){
                    ll dif=gasAct.first-cur;
//                    cout<<dif<<" -"<<"\n";
                    battery[batAct]-=dif;
                    cur=gasAct.first;
                    break;
                }
                else{
                    cur+=battery[batAct];
                    battery[batAct]=0;
                    prioridad.pop();
                }
            }
            battery[gasAct.second]=tope[gasAct.second];
            int indx=gasAct.second;
            if(place[indx].size())place[indx].pop();
            if(place[indx].size()){
                prioridad.push({place[indx].front(),indx});
            }
            else{
                prioridad.push({INT_MAX,indx});
            }
            while(prioridad.size() and prioridad.top().first<=cur)prioridad.pop();
        }
        cout<<cur<<"\n";
    }
}

詳細信息

Test #1:

score: 100
Accepted
time: 0ms
memory: 3564kb

input:

2
3 1
3 3 3
8 1
2 2
5 2
1 2
2 1

output:

12
9

result:

ok 2 lines

Test #2:

score: -100
Wrong Answer
time: 0ms
memory: 3596kb

input:

6
3 2
2 2 2
6 1
7 1
2 2
3 3
2 1
6 2
2 3
2 2
5 1
7 2
9 1
2 2
3 3
2 1
6 2
1 1
999999999
1000000000 1
1 1
1000000000
1000000000 1

output:

9
11
10
11
1999999998
2000000000

result:

wrong answer 3rd lines differ - expected: '4', found: '10'