#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, int> pii;
const int maxn = 110;
const int maxv = 1e4+10;
const ll inf = 1e18+10;
int n, m;
ll ans[maxn];
bool mark[maxn][maxn];
vector<pair<pii, int>> grafo[maxn];
void dijkstra(void)
{
for (int i = 1; i <= n; i++)
dist[i] = inf;
priority_queue<pair<pii, pii>, vector<pair<pii, pii>>, greater<pair<pii, pii>>> fila;
fila.push({{0, 1}, {0, 0}});
while (!fila.empty())
{
int u = fila.top().first.second, sum_t = fila.top().second.first, sum_c = fila.top().second.second;
ll cost = fila.top().first.first;
fila.pop();
if (mark[u][sum_t]) continue;
if (!ans[u]) ans[u] = cost;
mark[u][sum_t] = 1;
for (auto pp: grafo[u])
{
int v = pp.second, t = pp.first.first, c = pp.first.second;
if (sum_t+t < maxv && sum_c+c < maxv)
fila.push({{1ll*(sum_t+t)*(sum_c+c), v}, {sum_t+t, sum_c+c}});
}
}
}
int main(void)
{
scanf("%d %d", &n, &m);
for (int i = 1; i <= m; i++)
{
int u, v, t, c;
scanf("%d %d %d %d", &u, &v, &t, &c);
grafo[u].push_back({{t, c}, v});
grafo[v].push_back({{t, c}, u});
}
dijkstra();
for (int i = 2; i <= n; i++)
{
if (ans[i] == 0) printf("-1\n");
else printf("%lld\n", ans[i]);
}
}
Compilation message
ceste.cpp: In function 'void dijkstra()':
ceste.cpp:23:3: error: 'dist' was not declared in this scope
dist[i] = inf;
^~~~
ceste.cpp:23:3: note: suggested alternative: 'div'
dist[i] = inf;
^~~~
div
ceste.cpp: In function 'int main()':
ceste.cpp:53:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d", &n, &m);
~~~~~^~~~~~~~~~~~~~~~~
ceste.cpp:58:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d %d %d", &u, &v, &t, &c);
~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
