oj.uz

Submission #938826

# Submission time Handle Problem Language Result Execution time Memory
938826 2024-03-05T15:38:57 Z xjonwang Robot (JOI21_ho_t4) C++17
100 / 100
 332 ms 26216 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ld long double
#define ar array

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp> 
using namespace __gnu_pbds;

template <typename T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define vt vector
#define pb push_back
#define rsz resize
#define all(c) (c).begin(), (c).end()
#define sz(x) (int)(x).size()
#define pll pair<ll, ll>
#define pii pair<int, int>
#define f first
#define s second

#define F_OR(i, a, b, s) for (int i=(a); (s)>0?i<(b):i>(b); i+=(s))
#define F_OR1(e) F_OR(i, 0, e, 1)
#define F_OR2(i, e) F_OR(i, 0, e, 1)
#define F_OR3(i, b, e) F_OR(i, b, e, 1)
#define F_OR4(i, b, e, s) F_OR(i, b, e, s)
#define GET5(a, b, c, d, e, ...) e
#define F_ORC(...) GET5(__VA_ARGS__, F_OR4, F_OR3, F_OR2, F_OR1)
#define FOR(...) F_ORC(__VA_ARGS__)(__VA_ARGS__)
#define EACH(x, a) for (auto& x: a)

template<class T> bool umin(T& a, const T& b) {
	return b<a?a=b, 1:0;
}
template<class T> bool umax(T& a, const T& b) { 
	return a<b?a=b, 1:0;
} 

ll FIRSTTRUE(function<bool(ll)> f, ll lb, ll rb) {
	while(lb<rb) {
		ll mb=(lb+rb)/2;
		f(mb)?rb=mb:lb=mb+1; 
	} 
	return lb;
}
ll LASTTRUE(function<bool(ll)> f, ll lb, ll rb) {
	while(lb<rb) {
		ll mb=(lb+rb+1)/2;
		f(mb)?lb=mb:rb=mb-1; 
	} 
	return lb;
}

template<class A> void read(vt<A>& v);
template<class A, size_t S> void read(ar<A, S>& a);
template<class A, class B> void read(pair<A, B>& x);
template<class T> void read(T& x) {
	cin >> x;
}
void read(double& d) {
	string t;
	read(t);
	d=stod(t);
}
void read(long double& d) {
	string t;
	read(t);
	d=stold(t);
}
template<class H, class... T> void read(H& h, T&... t) {
	read(h);
	read(t...);
}
template<class A> void read(vt<A>& x) {
	EACH(a, x)
		read(a);
}
template<class A, size_t S> void read(array<A, S>& x) {
	EACH(a, x)
		read(a);
}
template<class A, class B> void read(pair<A, B>& x) {
	cin >> x.first >> x.second;
}


string to_string(char c) {
	return string(1, c);
}
string to_string(bool b) {
	return b?"true":"false";
}
string to_string(const char* s) {
	return string(s);
}
string to_string(string s) {
	return s;
}
string to_string(vt<bool> v) {
	string res;
	FOR(sz(v))
		res+=char('0'+v[i]);
	return res;
}

template<size_t S> string to_string(bitset<S> b) {
	string res;
	FOR(S)
		res+=char('0'+b[i]);
	return res;
}
template<class T> string to_string(T v) {
    bool f=1;
    string res;
    EACH(x, v) {
		if(!f)
			res+=' ';
		f=0;
		res+=to_string(x);
	}
    return res;
}
template<class A, class B> string to_string(pair<A, B>& x) {
	return to_string(x.first) + ' ' + to_string(x.second);
}

template<class A> void write(A x) {
	cout << to_string(x);
}
template<class H, class... T> void write(const H& h, const T&... t) { 
	write(h);
	write(t...);
}
void print() {
	write("\n");
}
template<class H, class... T> void print(const H& h, const T&... t) { 
	write(h);
	if(sizeof...(t))
		write(' ');
	print(t...);
}

struct edge {
	int u, c;
	ll p;
};

vt<vt<edge>> adj;

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n, m, u, v, c, p; read(n, m);
	adj.resize(n);
	FOR(m) {
		read(u, v, c, p); --u, --v;
		adj[u].pb({v, c, p});
		adj[v].pb({u, c, p});
	}
	vt<ll> dist(n, 1e18); dist[0]=0;
	priority_queue<pll, vt<pll>, greater<pll>> pq; pq.push({0, 0});
	while (sz(pq)) {
		auto [w, v]=pq.top(); pq.pop();
		if (w>dist[v]) continue;
		map<int, ll> par, color;
		for (auto [u, c, p] : adj[v]) {
			if (par.count(c)) umin(par[c], dist[u]);
			else par[c]=dist[u];
			color[c]+=p;
		}
		for (auto [u, c, p] : adj[v]) {
			ll ew=min(min(w+p, w+color[c]-p), par[c]+color[c]-p);
			if (umin(dist[u], ew)) pq.push({ew, u});
		}
	}
	print(dist[n-1]==1e18 ? -1 : dist[n-1]);
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 456 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 520 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 2 ms 596 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 7124 KB Output is correct
2 Correct 18 ms 3420 KB Output is correct
3 Correct 54 ms 10908 KB Output is correct
4 Correct 30 ms 5288 KB Output is correct
5 Correct 319 ms 23556 KB Output is correct
6 Correct 247 ms 21500 KB Output is correct
7 Correct 116 ms 18988 KB Output is correct
8 Correct 145 ms 17820 KB Output is correct
9 Correct 156 ms 17852 KB Output is correct
10 Correct 65 ms 11220 KB Output is correct
11 Correct 60 ms 9892 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 456 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 520 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 2 ms 596 KB Output is correct
21 Correct 41 ms 7124 KB Output is correct
22 Correct 18 ms 3420 KB Output is correct
23 Correct 54 ms 10908 KB Output is correct
24 Correct 30 ms 5288 KB Output is correct
25 Correct 319 ms 23556 KB Output is correct
26 Correct 247 ms 21500 KB Output is correct
27 Correct 116 ms 18988 KB Output is correct
28 Correct 145 ms 17820 KB Output is correct
29 Correct 156 ms 17852 KB Output is correct
30 Correct 65 ms 11220 KB Output is correct
31 Correct 60 ms 9892 KB Output is correct
32 Correct 69 ms 11472 KB Output is correct
33 Correct 57 ms 10216 KB Output is correct
34 Correct 89 ms 13768 KB Output is correct
35 Correct 77 ms 11792 KB Output is correct
36 Correct 76 ms 13084 KB Output is correct
37 Correct 96 ms 15796 KB Output is correct
38 Correct 95 ms 18548 KB Output is correct
39 Correct 80 ms 14932 KB Output is correct
40 Correct 121 ms 19284 KB Output is correct
41 Correct 149 ms 19372 KB Output is correct
42 Correct 144 ms 18336 KB Output is correct
43 Correct 54 ms 9168 KB Output is correct
44 Correct 101 ms 16840 KB Output is correct
45 Correct 122 ms 15376 KB Output is correct
46 Correct 108 ms 14776 KB Output is correct
47 Correct 85 ms 15164 KB Output is correct
48 Correct 332 ms 26216 KB Output is correct