#include <bits/stdc++.h>
using namespace std;
/////////////////////// MACROS ////////////////////////////////////////////
using ll = long long;
using ld = long double;
using db = double;
using str = string;
using pi = pair<int,int>;
using pl = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<str>;
using vpi = vector<pi>;
#define tcT template<class T
#define tcTU tcT, class U
tcT> using V = vector<T>;
tcT, size_t SZ> using AR = array<T,SZ>;
tcTU> using P = pair<T,U>;
tcT> using PR = pair<T,T>;
tcTU> using omap = unordered_map<T, U>;
tcT> using oset = unordered_set<T>;
#define mp make_pair
#define fi first
#define se second
#define sz(x) int((x).size())
#define all(x) begin(x), end(x)
#define rall(x) x.rbegin(), x.rend()
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pb push_back
#define eb emplace_back
#define pf push_front
#define lb lower_bound
#define ub upper_bound
// LOOPS
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)
/////////////////////// IMPORANT VARS /////////////////////////////////////
const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5;
const ll INFL = 1e18+10;
const int INF = 1e9+10;
const int dx[4] = {1,0,-1,0}, dy[4] = {0,1,0,-1};
tcT> using pqg = priority_queue<T,vector<T>,greater<T>>;
tcT> using pql = priority_queue<T,vector<T>,less<T>>;
tcT> bool ckmin(T& a, const T& b) {
return b < a ? a = b, 1 : 0; }
tcT> bool ckmax(T& a, const T& b) {
return a < b ? a = b, 1 : 0; }
/////////////////////// TO_STRING /////////////////////////////////////////
#define ts to_string
str ts(char c) { return str(1,c); }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
str ts(bool b) {
#ifdef LOCAL
return b ? "true" : "false";
#else
return ts((int)b);
#endif
}
tcT> str ts(T v) {
#ifdef LOCAL
bool fst = 1; str res = "{";
for (const auto& x: v) {
if (!fst) res += ", ";
fst = 0; res += ts(x);
}
res += "}"; return res;
#else
bool fst = 1; str res = "";
for (const auto& x: v) {
if (!fst) res += " ";
fst = 0; res += ts(x);
}
return res;
#endif
}
tcTU> str ts(pair<T,U> p) {
#ifdef LOCAL
return "("+ts(p.fi)+", "+ts(p.se)+")";
#else
return ts(p.fi)+" "+ts(p.se);
#endif
}
///////////////////////// DEBUG ///////////////////////////////////////////
#define tcTUU tcT, class ...U
void DBG() { cerr << "]" << endl; }
tcTUU> void DBG(const T& t, const U&... u) {
cerr << ts(t); if (sizeof...(u)) cerr << ", ";
DBG(u...); }
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#define dbg(...) cerr << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#define chk(...) if (!(__VA_ARGS__)) cerr << "Line(" << __LINE__ << ") -> function(" \
<< __FUNCTION__ << ") -> CHK FAILED: (" << #__VA_ARGS__ << ")" << "\n", exit(0);
#else
#define dbg(...) 0
#define chk(...) 0
#endif
///////////////////////// FILE I/O ////////////////////////////////////////
void unsyncIO() { cin.tie(0)->sync_with_stdio(0); }
void setPrec() { cout << fixed << setprecision(15); }
void setIn(str s) { freopen(s.c_str(),"r",stdin); }
void setOut(str s) { freopen(s.c_str(),"w",stdout); }
void setIO(str s = "") {
unsyncIO(); setPrec();
#ifndef LOCAL
if (sz(s)) setIn(s+".in"), setOut(s+".out"); // for USACO
#endif
}
///////////////////////// TEMPLATE ABOVE //////////////////////////////////
// TODO
// - Don't focus on only one approach
// - Read Problem Fully
// - Think of Edges Cases
// - Implement carefully
const int nax = 1e5+10;
ll dst[nax];
V<tuple<int, int, int>> adj[nax];
omap<ll, ll> C[nax];
bool vis[nax];
int n, m;
void dijkstra() {
pqg<pl> q;
q.push(mp(0, 1));
while(!q.empty()) {
ll d; int u;
tie(d, u) = q.top();
q.pop();
if (vis[u]) continue;
vis[u] = 1;
dst[u] = d;
int v, c, w;
trav(e, adj[u]) {
tie(v, c, w) = e;
ll nd = d+w;
ckmin(nd, d+C[u][c]-w);
q.push(mp(nd, v));
}
}
}
int main() {
setIO();
fill(dst, dst+nax, INFL);
fill(vis, vis+nax, 0);
cin >> n >> m;
F0R(i, m) {
int u, v, c, p; cin >> u >> v >> c >> p;
adj[u].pb({v, c, p});
adj[v].pb({u, c, p});
C[u][c] += p;
C[v][c] += p;
}
dijkstra();
cout << (dst[n] == INFL ? -1 : dst[n]) << endl;
exit(0);
}
Compilation message
Main.cpp: In function 'void setIn(str)':
Main.cpp:125:28: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
125 | void setIn(str s) { freopen(s.c_str(),"r",stdin); }
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
Main.cpp: In function 'void setOut(str)':
Main.cpp:126:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
126 | void setOut(str s) { freopen(s.c_str(),"w",stdout); }
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
6 ms |
8908 KB |
Output is correct |
| 2 |
Correct |
6 ms |
8908 KB |
Output is correct |
| 3 |
Correct |
6 ms |
8908 KB |
Output is correct |
| 4 |
Correct |
6 ms |
8908 KB |
Output is correct |
| 5 |
Correct |
6 ms |
9036 KB |
Output is correct |
| 6 |
Correct |
6 ms |
8908 KB |
Output is correct |
| 7 |
Correct |
7 ms |
9160 KB |
Output is correct |
| 8 |
Correct |
6 ms |
9028 KB |
Output is correct |
| 9 |
Incorrect |
10 ms |
9280 KB |
Output isn't correct |
| 10 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
149 ms |
20484 KB |
Output is correct |
| 2 |
Correct |
50 ms |
14280 KB |
Output is correct |
| 3 |
Correct |
205 ms |
24448 KB |
Output is correct |
| 4 |
Correct |
93 ms |
17080 KB |
Output is correct |
| 5 |
Incorrect |
468 ms |
44192 KB |
Output isn't correct |
| 6 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
6 ms |
8908 KB |
Output is correct |
| 2 |
Correct |
6 ms |
8908 KB |
Output is correct |
| 3 |
Correct |
6 ms |
8908 KB |
Output is correct |
| 4 |
Correct |
6 ms |
8908 KB |
Output is correct |
| 5 |
Correct |
6 ms |
9036 KB |
Output is correct |
| 6 |
Correct |
6 ms |
8908 KB |
Output is correct |
| 7 |
Correct |
7 ms |
9160 KB |
Output is correct |
| 8 |
Correct |
6 ms |
9028 KB |
Output is correct |
| 9 |
Incorrect |
10 ms |
9280 KB |
Output isn't correct |
| 10 |
Halted |
0 ms |
0 KB |
- |
