| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 127109 |
2019-07-08T22:36:37 Z |
liwi |
Ceste (COCI17_ceste) |
C++11 |
|
5 ms |
508 KB |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
#define scan(x) do{while((x=getchar())<'0'); for(x-='0'; '0'<=(_=getchar()); x=(x<<3)+(x<<1)+_-'0');}while(0)
char _;
#define complete_unique(a) a.erase(unique(a.begin(),a.end()),a.end())
#define all(a) a.begin(),a.end()
#define println printf("\n");
#define readln(x) getline(cin,x);
#define pb push_back
#define endl "\n"
#define INT_INF 0x3f3f3f3f
#define LL_INF 0x3f3f3f3f3f3f3f3f
#define MOD 1000000007
#define mp make_pair
#define fastio cin.tie(0); cin.sync_with_stdio(0);
#define MAXN 2005
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef unordered_map<int,int> umii;
typedef pair<int,int> pii;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef pair<int,pii> triple;
typedef int8_t byte;
mt19937 g1(time(0));
int randint(int a, int b){return uniform_int_distribution<int>(a, b)(g1);}
ll randlong(ll a,ll b){return uniform_int_distribution<long long>(a, b)(g1);}
ll gcd(ll a, ll b){return b == 0 ? a : gcd(b, a % b);}
ll lcm(ll a, ll b){return a*b/gcd(a,b);}
ll fpow(ll b, ll exp, ll mod){if(exp == 0) return 1;ll t = fpow(b,exp/2,mod);if(exp&1) return t*t%mod*b%mod;return t*t%mod;}
ll divmod(ll i, ll j, ll mod){i%=mod,j%=mod;return i*fpow(j,mod-2,mod)%mod;}
int num_nodes,num_edges;
pii dis[MAXN][2]; //first is minimize time, second is cost
vector<pair<int,pii>> connections[MAXN];
int main(){
scanf("%d %d",&num_nodes,&num_edges);
for(int i=1; i<=num_edges; i++){
int a,b,t,c; scanf(" %d %d %d %d",&a,&b,&t,&c);
connections[a].pb(mp(b,mp(t,c)));
connections[b].pb(mp(a,mp(t,c)));
}
memset(dis,0x3f,sizeof dis);
dis[1][0] = dis[1][1] = mp(0,0);
queue<pair<int,pii>> q;
q.push(mp(1,dis[1][0]));
while(q.size()){
int node = q.front().first, tt = q.front().second.first, tc = q.front().second.second; q.pop();
if(tt > dis[node][0].first && tc > dis[node][1].second) continue;
for(pair<int,pii> check:connections[node]){
int nt = tt+check.second.first, nc = tc+check.second.second;
if(nt < dis[check.first][0].first || (nt == dis[check.first][0].first && nc < dis[check.first][0].second)){
dis[check.first][0] = mp(nt,nc);
q.push(mp(check.first,dis[check.first][0]));
}
if(nc < dis[check.first][1].second || (nc == dis[check.first][1].second && nt < dis[check.first][1].first)){
dis[check.first][1] = mp(nt,nc);
q.push(mp(check.first,dis[check.first][1]));
}
}
}
for(int i=2; i<=num_nodes; i++){
if(dis[i][0].first == 0x3f3f3f3f) printf("-1\n");
else printf("%lld\n",min(1LL*dis[i][0].first*dis[i][0].second,1LL*dis[i][1].first*dis[i][1].second));
}
}
Compilation message
ceste.cpp: In function 'int main()':
ceste.cpp:50:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d",&num_nodes,&num_edges);
~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ceste.cpp:52:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
int a,b,t,c; scanf(" %d %d %d %d",&a,&b,&t,&c);
~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
3 ms |
504 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
4 ms |
504 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
4 ms |
504 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
5 ms |
504 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
4 ms |
508 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
