Task: | Ping |
Sender: | Häviö Life |
Submission time: | 2015-09-09 17:30:19 +0300 |
Language: | C++ |
Status: | READY |
Result: | ACCEPTED |
test | verdict | time | |
---|---|---|---|
#1 | ACCEPTED | 0.05 s | details |
#2 | ACCEPTED | 0.06 s | details |
#3 | ACCEPTED | 0.55 s | details |
#4 | ACCEPTED | 0.21 s | details |
#5 | ACCEPTED | 0.23 s | details |
#6 | ACCEPTED | 0.62 s | details |
#7 | ACCEPTED | 0.61 s | details |
#8 | ACCEPTED | 0.29 s | details |
#9 | ACCEPTED | 0.41 s | details |
#10 | ACCEPTED | 0.15 s | details |
#11 | ACCEPTED | 0.10 s | details |
#12 | ACCEPTED | 0.13 s | details |
#13 | ACCEPTED | 0.10 s | details |
#14 | ACCEPTED | 0.62 s | details |
#15 | ACCEPTED | 0.41 s | details |
#16 | ACCEPTED | 0.39 s | details |
#17 | ACCEPTED | 0.18 s | details |
Compiler report
input/code.cpp: In function 'bool dij(int)': input/code.cpp:55:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int i=0; i<vl[a.seur].size(); i++) ^
Code
#include <iostream> #include <vector> #include <stack> #include <queue> #include <algorithm> #include <cmath> #include <iomanip> #include <unordered_set> #include <stdio.h> #include <string.h> #include <unordered_map> #include <fstream> #include <set> #include <map> #define MOD 1000000007 #define ll long long #define N (1<<17) #define float double using namespace std; vector<ll> vl[100000]; vector<ll> w[100000]; vector<ll> numb[100000]; ll n,q,raja; struct pp{ ll seur, d; }; bool operator <(pp a, pp b){ return a.d>b.d; } bool dij(int kayt){ ll dist[100000]; for(int i=0; i<100000; i++) dist[i]=1000000000000000ll; dist[0]=0; priority_queue<pp> pq; pp alku; alku.seur=0; alku.d=0; pq.push(alku); while(pq.size()){ pp a=pq.top(); pq.pop(); if(a.d>dist[a.seur]) continue; for(int i=0; i<vl[a.seur].size(); i++) if(numb[a.seur][i]<=kayt) if(dist[a.seur]+w[a.seur][i]<=dist[vl[a.seur][i]]){ dist[vl[a.seur][i]]=dist[a.seur]+w[a.seur][i]; pp uus; uus.d=dist[vl[a.seur][i]]; uus.seur=vl[a.seur][i]; pq.push(uus); } } ///cout<<dist[n-1]<<" "<<raja<<endl; if(dist[n-1]<=raja) return true; return false; } int main(){ cin.sync_with_stdio(false); cin>>n>>q>>raja; for(int i=0; i<q; i++){ ll u,v,p; cin>>u>>v>>p; u--;v--; vl[u].push_back(v); w[u].push_back(p); numb[u].push_back(i+1); vl[v].push_back(u); w[v].push_back(p); numb[v].push_back(i+1); } int yla=200000, ala=1; while(ala<yla){ int k=(yla+ala)/2; if(dij(k)) yla=k; else ala=k+1; } if(ala!=200000) cout<<ala<<endl; else cout<<"QAQ"<<endl; return 0; }
Test details
Test 1
Verdict: ACCEPTED
input |
---|
4 5 4 1 4 5 2 1 1 4 3 2 1 3 2 ... |
correct output |
---|
4 |
user output |
---|
4 |
Test 2
Verdict: ACCEPTED
input |
---|
4 3 4 1 3 2 3 4 3 2 4 1 |
correct output |
---|
QAQ |
user output |
---|
QAQ |
Test 3
Verdict: ACCEPTED
input |
---|
79228 100000 609719088 71059 11143 686695 68230 2527 877907 53438 29888 202308 3549 78720 356072 ... |
correct output |
---|
95914 |
user output |
---|
95914 |
Test 4
Verdict: ACCEPTED
input |
---|
54105 100000 146069808 21034 33530 208067 31369 39373 438341 53601 30432 458004 44664 29661 964679 ... |
correct output |
---|
47249 |
user output |
---|
47249 |
Test 5
Verdict: ACCEPTED
input |
---|
27534 100000 630452185 4554 20869 156656 18125 16857 129766 7327 23355 162783 12208 19586 330973 ... |
correct output |
---|
37629 |
user output |
---|
37629 |
Test 6
Verdict: ACCEPTED
input |
---|
100000 100000 1896201 37633 24342 686408 21326 35599 18816 68870 92002 748527 87772 68354 816268 ... |
correct output |
---|
QAQ |
user output |
---|
QAQ |
Test 7
Verdict: ACCEPTED
input |
---|
100000 100000 2753856 28301 86840 226813 23531 88963 140812 81527 28867 31169 81346 50536 187421 ... |
correct output |
---|
QAQ |
user output |
---|
QAQ |
Test 8
Verdict: ACCEPTED
input |
---|
100000 100000 8894369 96437 89061 279201 93127 41538 16340 5646 70264 970395 96240 15676 526054 ... |
correct output |
---|
89568 |
user output |
---|
89568 |
Test 9
Verdict: ACCEPTED
input |
---|
100000 100000 8920310 51576 49748 441411 75379 58501 720057 77269 34775 380776 45446 74022 804975 ... |
correct output |
---|
94792 |
user output |
---|
94792 |
Test 10
Verdict: ACCEPTED
input |
---|
5000 100000 699655 4460 4283 850197 3421 2128 903580 3335 401 848289 4975 4482 241023 ... |
correct output |
---|
58358 |
user output |
---|
58358 |
Test 11
Verdict: ACCEPTED
input |
---|
5000 100000 2906768 4100 2619 553305 4947 1462 263251 1703 4236 286383 4228 4797 635722 ... |
correct output |
---|
12392 |
user output |
---|
12392 |
Test 12
Verdict: ACCEPTED
input |
---|
5000 100000 8525016 4452 4625 772169 4941 929 373626 2610 379 935441 3007 4 402654 ... |
correct output |
---|
16113 |
user output |
---|
16113 |
Test 13
Verdict: ACCEPTED
input |
---|
5000 100000 6672172 2548 393 274388 1269 4076 230068 24 3024 596999 4658 2589 401693 ... |
correct output |
---|
3674 |
user output |
---|
3674 |
Test 14
Verdict: ACCEPTED
input |
---|
100000 100000 1000000000 61435 73156 809653003 31805 69457 997174565 46138 4746 664487503 77749 57316 726729812 ... |
correct output |
---|
QAQ |
user output |
---|
QAQ |
Test 15
Verdict: ACCEPTED
input |
---|
70000 100000 389981 69496 42899 329 42449 25317 445 2446 37175 175 4791 27488 51 ... |
correct output |
---|
71694 |
user output |
---|
71694 |
Test 16
Verdict: ACCEPTED
input |
---|
70000 100000 7413515 66481 13331 14 34935 8021 953 66946 55602 904 49080 1580 157 ... |
correct output |
---|
82046 |
user output |
---|
82046 |
Test 17
Verdict: ACCEPTED
input |
---|
20000 100000 100000000 1 2 10000 2 3 10000 3 4 10000 4 5 10000 ... |
correct output |
---|
50001 |
user output |
---|
50001 |