#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define sz(x) (int)x.size()
#define beg(x) x.begin()
#define en(x) x.end()
#define all(x) beg(x), en(x)
#define resz resize
const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const int MX = 2001;
const ld PI = 4*atan((ld)1);
template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }
template<class A, class B> A operator+=(A& l, const B& r) { return l = l+r; }
template<class A, class B> A operator-=(A& l, const B& r) { return l = l-r; }
template<class A, class B> A operator*=(A& l, const B& r) { return l = l*r; }
template<class A, class B> A operator/=(A& l, const B& r) { return l = l/r; }
namespace input {
template<class T> void re(complex<T>& x);
template<class T1, class T2> void re(pair<T1,T2>& p);
template<class T> void re(vector<T>& a);
template<class T, size_t SZ> void re(array<T,SZ>& a);
template<class T> void re(T& x) { cin >> x; }
void re(double& x) { string t; re(t); x = stod(t); }
void re(ld& x) { string t; re(t); x = stold(t); }
template<class Arg, class... Args> void re(Arg& first, Args&... rest) {
re(first); re(rest...);
}
template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
}
using namespace input;
namespace output {
template<class T1, class T2> void pr(const pair<T1,T2>& x);
template<class T, size_t SZ> void pr(const array<T,SZ>& x);
template<class T> void pr(const vector<T>& x);
template<class T> void pr(const set<T>& x);
template<class T1, class T2> void pr(const map<T1,T2>& x);
template<class T> void pr(const T& x) { cout << x; }
template<class Arg, class... Args> void pr(const Arg& first, const Args&... rest) {
pr(first); pr(rest...);
}
template<class T1, class T2> void pr(const pair<T1,T2>& x) {
pr("{",x.f,", ",x.s,"}");
}
template<class T> void prContain(const T& x) {
pr("{");
bool fst = 1; trav(a,x) pr(!fst?", ":"",a), fst = 0;
pr("}");
}
template<class T, size_t SZ> void pr(const array<T,SZ>& x) { prContain(x); }
template<class T> void pr(const vector<T>& x) { prContain(x); }
template<class T> void pr(const set<T>& x) { prContain(x); }
template<class T1, class T2> void pr(const map<T1,T2>& x) { prContain(x); }
void ps() { pr("\n"); }
template<class Arg, class... Args> void ps(const Arg& first, const Args&... rest) {
pr(first," "); ps(rest...); // print w/ spaces
}
}
using namespace output;
namespace io {
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
void setIO(string s = "") {
ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}
}
using namespace io;
ll ans[MX];
int N,M;
template<class T> using pqg = priority_queue<T,vector<T>,greater<T>>;
template<class T> T poll(pqg<T>& x) {
T y = x.top(); x.pop();
return y;
}
template<int SZ> struct Dijkstra {
vector<array<int,3>> adj[SZ];
pqg<pair<double,int>> q;
pair<double,pi> dist[SZ];
void addEdge(int A, int B, int T, int C) {
adj[A].pb({B,T,C});
adj[B].pb({A,T,C});
}
void init(int st, double r) {
F0R(i,SZ) dist[i].f = MOD;
q = pqg<pair<double,int>>(); q.push({dist[st].f = 0,st});
while (sz(q)) {
auto x = poll(q); if (dist[x.s].f < x.f) continue;
trav(y,adj[x.s]) {
if (x.f+r*y[1]+(1-r)*y[2] < dist[y[0]].f) {
dist[y[0]] = {x.f+r*y[1]+(1-r)*y[2],{dist[x.s].s.f+y[1],dist[x.s].s.s+y[2]}};
q.push({dist[y[0]].f,y[0]});
}
}
}
// FOR(i,1,N+1) ps(st,r,i,dist[i].f,dist[i].s.f,dist[i].s.s);
FOR(i,1,N+1) if (dist[i].f != MOD) ckmin(ans[i],(ll)dist[i].s.f*dist[i].s.s);
}
};
Dijkstra<MX> D;
int main() {
setIO(); re(N,M); FOR(i,1,N+1) ans[i] = INF;
F0R(i,M) {
int A,B,T,C; re(A,B,T,C);
D.addEdge(A,B,T,C);
}
double x = 0;
while (1) {
D.init(1,x);
double nex = 1;
FOR(i,1,N+1) if (D.dist[i].f != MOD) trav(j,D.adj[i]) {
auto a = D.dist[i].s, b = D.dist[j[0]].s;
a.f += j[1], a.s += j[2]; a.f -= b.f, a.s -= b.s;
if (a.f == a.s) continue;
auto t = -(double)a.s/(a.f-a.s);
if (t > x) ckmin(nex,t);
// -a.s/(a.f-a.s)
// x*a.f+(1-x)*a.s < 0, first x
// x*(a.f-a.s)+a.s < 0
}
if (nex == x) break;
x = nex;
}
FOR(i,2,N+1) {
if (ans[i] == INF) ps(-1);
else ps(ans[i]);
}
}
/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?), set tle
* do smth instead of nothing and stay organized
*/
Compilation message
ceste.cpp: In function 'void io::setIn(std::__cxx11::string)':
ceste.cpp:117:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
~~~~~~~^~~~~~~~~~~~~~~~~~~~~
ceste.cpp: In function 'void io::setOut(std::__cxx11::string)':
ceste.cpp:118:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
384 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
3 ms |
384 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
384 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
3 ms |
384 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
44 ms |
512 KB |
Output is correct |
| 2 |
Correct |
83 ms |
512 KB |
Output is correct |
| 3 |
Correct |
20 ms |
512 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
12 ms |
476 KB |
Output is correct |
| 2 |
Correct |
12 ms |
640 KB |
Output is correct |
| 3 |
Correct |
23 ms |
512 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
71 ms |
588 KB |
Output is correct |
| 2 |
Correct |
101 ms |
632 KB |
Output is correct |
| 3 |
Correct |
166 ms |
620 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
130 ms |
632 KB |
Output is correct |
| 2 |
Correct |
260 ms |
644 KB |
Output is correct |
| 3 |
Correct |
10 ms |
768 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
81 ms |
632 KB |
Output is correct |
| 2 |
Correct |
114 ms |
640 KB |
Output is correct |
| 3 |
Correct |
144 ms |
596 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
131 ms |
592 KB |
Output is correct |
| 2 |
Correct |
137 ms |
596 KB |
Output is correct |
| 3 |
Correct |
136 ms |
600 KB |
Output is correct |
