oj.uz

Submission #632871

# Submission time Handle Problem Language Result Execution time Memory
632871 2022-08-21T05:15:23 Z Karliver Olympic Bus (JOI20_ho_t4) C++17
100 / 100
 126 ms 3660 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>

#define FIXED_FLOAT(x)  std::fixed <<std::setprecision(20) << (x)
#define all(v) (v).begin(), (v).end()
using namespace  std;
#define forn(i,n) for (int i = 0; i < (n); ++i)
#define rforn(i, n) for(int i = (n) - 1;i >= 0;--i)
#define sz(x) (int)x.size()
#define ff first
#define se second
#define mp make_pair
using ll = long long;
int mod = (ll)1e9 + 7;
const int INF = 1e9 + 1;
const int N = 205;
const double eps = 1e-7;

template <class T> using V = vector<T>;  
template <class T> using VV = V<V<T>>;  
template<class T, size_t SZ> using AR = array<T, SZ>;
template<class T> using PR = pair<T, T>;
template <typename XPAX>
bool ckma(XPAX &x, XPAX y) {
    return (x < y ? x = y, 1 : 0);
}
template <typename XPAX>
bool ckmi(XPAX &x, XPAX y) {
    return (x > y ? x = y, 1 : 0);
}



void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
const int  MX = 5e5 + 10;
const ll inf = 1e17;
int A[MX], B[MX], C[MX], D[MX];
int n, m;
vector<array<int, 2>> g[N][2];
void dij(int fr, int tr, int tp, vector<ll>& d, vector<bool> &vis) {
	d.resize(n + 1, inf);
	vis.resize(m + 1, false);
	vector<bool> seen(n + 1, false);
	vector<int> par(n + 1, -1);
	d[fr] = 0;
	while(1) {
		int v = n;
		forn(i, n) if(!seen[i]&& d[i]<d[v])v = i;
		if(v == n)break;
		seen[v] = true;
		for(auto [y, i] : g[v][tp]) {
			if(ckmi(d[y], d[v]+C[i])) {
				par[y] = i;
			}
		}
	}
	if(tp)return;
	int y = tr;
	while(par[y] != -1) {
		vis[par[y]] = true;
		y = A[par[y]];
	}
}

ll without(int fr, int tr, int  cant) {
	
	vector<ll> d(n + 1, inf);
	vector<bool> vis(n + 1, false);
	d[fr] = 0;
	
	while(1) {
		int v = n;
		forn(i, n) if(!vis[i]&&d[i]<d[v])v = i;
		if(v == n)break;
		vis[v] = true;
		for(auto [y, i] : g[v][0]) if(i != cant) {
			ckmi(d[y], d[v]+C[i]);
		}
		if(B[cant] == v) {
			ckmi(d[A[cant]], d[v]+C[cant]);
		}
	}
	return d[tr];
}
		
void solve() {	
	cin >> n >> m;
	
	for(int i = 0;i < m;++i) {
		cin >> A[i] >> B[i] >> C[i] >> D[i];
		--A[i];
		--B[i];
		g[A[i]][0].push_back({B[i], i});
		g[B[i]][1].push_back({A[i], i});
	}
	vector<bool> vis1, vis2, tmp;
	vector<ll> d1, d2, d3, d4;
	
	dij(0, n - 1,0, d1, vis1);
	dij(n - 1, 0, 0, d2, vis2);
	dij(0, n - 1, 1, d3, tmp);
	dij(n - 1, 0,1,  d4, tmp);
	ll res = inf;
	ckmi(res, d1[n - 1] + d2[0]);
	
	for(int i = 0;i < m;++i) {
		ll cost = D[i];
		
		if(vis1[i])cost += without(0, n - 1, i);
		else cost += min(d1[n - 1], d1[B[i]]+C[i]+d4[A[i]]);
		
		if(vis2[i]) cost += without(n - 1, 0, i);
		else cost += min(d2[0], d2[B[i]]+C[i]+d3[A[i]]);
		//debug(i, cost);
		ckmi(res, cost);
	}
	
		
	cout << (res == inf ? -1 : res) << '\n';
}
void test_case() {
    int t;
    cin >> t;
    forn(p, t) {

        //cout << "Case #" << p + 1 << ": ";
        solve();
    }
}
int main() {

    ios::sync_with_stdio(false);
    cin.tie(0);

    solve();

}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 400 KB Output is correct
4 Correct 3 ms 452 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 47 ms 424 KB Output is correct
11 Correct 40 ms 436 KB Output is correct
12 Correct 39 ms 352 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 3412 KB Output is correct
2 Correct 20 ms 3412 KB Output is correct
3 Correct 20 ms 3552 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 2 ms 356 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 19 ms 3592 KB Output is correct
10 Correct 21 ms 3572 KB Output is correct
11 Correct 21 ms 3632 KB Output is correct
12 Correct 20 ms 3652 KB Output is correct
13 Correct 25 ms 3600 KB Output is correct
14 Correct 20 ms 3660 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 17 ms 2588 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 17 ms 3384 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 17 ms 3284 KB Output is correct
9 Correct 22 ms 3368 KB Output is correct
10 Correct 17 ms 3284 KB Output is correct
11 Correct 16 ms 3348 KB Output is correct
12 Correct 20 ms 3388 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 17 ms 3340 KB Output is correct
20 Correct 16 ms 3308 KB Output is correct
21 Correct 18 ms 3344 KB Output is correct
22 Correct 17 ms 3344 KB Output is correct

Subtask #4
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 400 KB Output is correct
4 Correct 3 ms 452 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 47 ms 424 KB Output is correct
11 Correct 40 ms 436 KB Output is correct
12 Correct 39 ms 352 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 20 ms 3412 KB Output is correct
18 Correct 20 ms 3412 KB Output is correct
19 Correct 20 ms 3552 KB Output is correct
20 Correct 3 ms 468 KB Output is correct
21 Correct 2 ms 356 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 19 ms 3592 KB Output is correct
26 Correct 21 ms 3572 KB Output is correct
27 Correct 21 ms 3632 KB Output is correct
28 Correct 20 ms 3652 KB Output is correct
29 Correct 25 ms 3600 KB Output is correct
30 Correct 20 ms 3660 KB Output is correct
31 Correct 2 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 17 ms 2588 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 17 ms 3384 KB Output is correct
36 Correct 1 ms 336 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 17 ms 3284 KB Output is correct
39 Correct 22 ms 3368 KB Output is correct
40 Correct 17 ms 3284 KB Output is correct
41 Correct 16 ms 3348 KB Output is correct
42 Correct 20 ms 3388 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 336 KB Output is correct
45 Correct 0 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 336 KB Output is correct
48 Correct 0 ms 340 KB Output is correct
49 Correct 17 ms 3340 KB Output is correct
50 Correct 16 ms 3308 KB Output is correct
51 Correct 18 ms 3344 KB Output is correct
52 Correct 17 ms 3344 KB Output is correct
53 Correct 18 ms 3360 KB Output is correct
54 Correct 21 ms 3364 KB Output is correct
55 Correct 20 ms 3404 KB Output is correct
56 Correct 3 ms 340 KB Output is correct
57 Correct 2 ms 340 KB Output is correct
58 Correct 77 ms 2732 KB Output is correct
59 Correct 74 ms 2716 KB Output is correct
60 Correct 79 ms 2612 KB Output is correct
61 Correct 65 ms 2652 KB Output is correct
62 Correct 77 ms 2756 KB Output is correct
63 Correct 76 ms 2644 KB Output is correct
64 Correct 126 ms 2772 KB Output is correct
65 Correct 114 ms 2916 KB Output is correct
66 Correct 109 ms 2900 KB Output is correct
67 Correct 17 ms 2676 KB Output is correct
68 Correct 25 ms 3588 KB Output is correct
69 Correct 19 ms 3488 KB Output is correct
70 Correct 21 ms 3540 KB Output is correct
71 Correct 21 ms 3532 KB Output is correct
72 Correct 20 ms 3612 KB Output is correct
73 Correct 19 ms 3612 KB Output is correct
74 Correct 21 ms 3556 KB Output is correct