This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +2005
#define MaxS N * N
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
//#define re return
#define oo ll(1e18)
#define el '\n'
#define pii pair <int, int>
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;
int f[N][N * N / 100];
int i, j, n, m, u, v, t, c;
vector <pair <int, pair <int, int> > > g[N];
bool mrk[N];
void dfs(int v)
{
if (mrk[v]) return;
mrk[v] = 1;
for (auto re : g[v])
{
int u = re.F;
int t = re.S.F;
int c = re.S.S;
if (mrk[u]) continue;
for (j = 0; j < N * N / 100; j++)
if (j + t < N * N / 100 && f[u][j + t] > f[v][j] + c)
f[u][t + j] = f[v][j] + c;
dfs(u);
}
mrk[v] = 0;
}
int main()
{
srand(time(0));
ios_base::sync_with_stdio(0);
iostream::sync_with_stdio(0);
ios::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
// in("input.txt");
// out("output.txt");
cin >> n >> m;
for (i = 1; i <= n; i++)
{
cin >> u >> v >> t >> c;
g[v].pb({u, {t, c}});
g[u].pb({v, {t, c}});
}
for (i = 1; i <= n; i++)
for (j = 0; j < N * N / 100; j++) f[i][j] = 1e9;
f[1][0] = 0;
dfs(1);
for (i = 2; i <= n; i++)
{
ll mn = 1e18;
for (j = 1; j < N * N / 100; j++)
if (f[i][j] * 1ll * j < mn)
{
mn = f[i][j] * 1ll * j;
}
if (mn == 1e18) cout << "-1" << el;
else cout << mn << el;
}
}
// x ^ 2 + y ^ 2 = 1
// x * a_i + y * b_i
// a_i = -b_i * tan(alpha)
// a_i / -b_i = tan(alpha)
// alpha = atan(a_i / (-b_i))
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |