oj.uz

Submission #673746

# Submission time Handle Problem Language Result Execution time Memory
673746 2022-12-21T22:00:30 Z MilosMilutinovic Olympic Bus (JOI20_ho_t4) C++14
100 / 100
 957 ms 3676 KB 
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}());
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

const int N=202;
const int M=50500;
const ll inf=1e18;

int n,m,u[M],v[M],c[M],d[M],prv[2][N];
ll dis[2][N],f[N][N];
bool is[M];
vector<array<int,3>> e[N];

void dijkstra(int v,ll* d,int* pp) {
	rep(i,1,n+1) d[i]=inf;
	d[v]=0; pp[v]=-1;
	priority_queue<pair<ll,int>> pq;
	pq.push({0,v});
	while (SZ(pq)) {
		int i=pq.top().second;
		ll dd=-pq.top().first;
		pq.pop();
		if (dd>d[i]) continue;
		for (auto& p:e[i]) {
			int j=p[0],w=p[1];
			if (d[j]>d[i]+w) {
				d[j]=d[i]+w; pp[j]=p[2];
				pq.push({-d[j],j});
			}
		}
	}
}

ll solve(int id) {
	rep(i,1,n+1) e[i].clear();
	rep(i,0,m) {
		if (i==id) e[v[i]].pb({u[i],c[i],i});
		else e[u[i]].pb({v[i],c[i],i});
	}
	dijkstra(1,dis[0],prv[0]);
	dijkstra(n,dis[1],prv[1]);
	return dis[0][n]+dis[1][1]+d[id];
}

int main() {
	scanf("%d%d",&n,&m);
	rep(i,1,n+1) rep(j,1,n+1)
		f[i][j]=inf;
	rep(i,0,m) {
		scanf("%d%d%d%d",u+i,v+i,c+i,d+i);
		e[u[i]].pb({v[i],c[i],i});
		f[u[i]][v[i]]=min(f[u[i]][v[i]],(ll)c[i]);
	}
	rep(i,1,n+1) f[i][i]=0;
	rep(k,1,n+1) rep(i,1,n+1) rep(j,1,n+1)
		f[i][j]=min(f[i][j],f[i][k]+f[k][j]);
	dijkstra(1,dis[0],prv[0]);
	dijkstra(n,dis[1],prv[1]);
	rep(j,0,2) rep(i,1,n+1) if (prv[j][i]!=-1)
		is[prv[j][i]]=1;
	ll ans=dis[0][n]+dis[1][1];
	rep(i,0,m) {
		if (is[i]) {
			ans=min(ans,solve(i));
		} else {
			ll d1=min(f[1][n],f[1][v[i]]+c[i]+f[u[i]][n]);
			ll d2=min(f[n][1],f[n][v[i]]+c[i]+f[u[i]][1]);
			ans=min(ans,d1+d2+d[i]);
		}
	}
	if (ans>=inf) ans=-1;
	printf("%lld",ans);
}

Compilation message

ho_t4.cpp: In function 'int main()':
ho_t4.cpp:65:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |  scanf("%d%d",&n,&m);
      |  ~~~~~^~~~~~~~~~~~~~
ho_t4.cpp:69:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   69 |   scanf("%d%d%d%d",u+i,v+i,c+i,d+i);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 596 KB Output is correct
2 Correct 8 ms 596 KB Output is correct
3 Correct 23 ms 684 KB Output is correct
4 Correct 26 ms 684 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 8 ms 656 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 24 ms 596 KB Output is correct
11 Correct 34 ms 720 KB Output is correct
12 Correct 29 ms 692 KB Output is correct
13 Correct 13 ms 596 KB Output is correct
14 Correct 18 ms 596 KB Output is correct
15 Correct 21 ms 692 KB Output is correct
16 Correct 16 ms 688 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 242 ms 2512 KB Output is correct
2 Correct 253 ms 2772 KB Output is correct
3 Correct 249 ms 2448 KB Output is correct
4 Correct 24 ms 720 KB Output is correct
5 Correct 15 ms 688 KB Output is correct
6 Correct 9 ms 596 KB Output is correct
7 Correct 8 ms 596 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 117 ms 2388 KB Output is correct
10 Correct 116 ms 2432 KB Output is correct
11 Correct 192 ms 2468 KB Output is correct
12 Correct 180 ms 2504 KB Output is correct
13 Correct 181 ms 2516 KB Output is correct
14 Correct 172 ms 2532 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 596 KB Output is correct
2 Correct 8 ms 652 KB Output is correct
3 Correct 196 ms 2000 KB Output is correct
4 Correct 11 ms 656 KB Output is correct
5 Correct 228 ms 2504 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 121 ms 2440 KB Output is correct
9 Correct 144 ms 2404 KB Output is correct
10 Correct 202 ms 2452 KB Output is correct
11 Correct 181 ms 2496 KB Output is correct
12 Correct 205 ms 2420 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 201 ms 2640 KB Output is correct
20 Correct 179 ms 2360 KB Output is correct
21 Correct 189 ms 2480 KB Output is correct
22 Correct 199 ms 2440 KB Output is correct

Subtask #4
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 596 KB Output is correct
2 Correct 8 ms 596 KB Output is correct
3 Correct 23 ms 684 KB Output is correct
4 Correct 26 ms 684 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 8 ms 656 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 24 ms 596 KB Output is correct
11 Correct 34 ms 720 KB Output is correct
12 Correct 29 ms 692 KB Output is correct
13 Correct 13 ms 596 KB Output is correct
14 Correct 18 ms 596 KB Output is correct
15 Correct 21 ms 692 KB Output is correct
16 Correct 16 ms 688 KB Output is correct
17 Correct 242 ms 2512 KB Output is correct
18 Correct 253 ms 2772 KB Output is correct
19 Correct 249 ms 2448 KB Output is correct
20 Correct 24 ms 720 KB Output is correct
21 Correct 15 ms 688 KB Output is correct
22 Correct 9 ms 596 KB Output is correct
23 Correct 8 ms 596 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 117 ms 2388 KB Output is correct
26 Correct 116 ms 2432 KB Output is correct
27 Correct 192 ms 2468 KB Output is correct
28 Correct 180 ms 2504 KB Output is correct
29 Correct 181 ms 2516 KB Output is correct
30 Correct 172 ms 2532 KB Output is correct
31 Correct 17 ms 596 KB Output is correct
32 Correct 8 ms 652 KB Output is correct
33 Correct 196 ms 2000 KB Output is correct
34 Correct 11 ms 656 KB Output is correct
35 Correct 228 ms 2504 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 121 ms 2440 KB Output is correct
39 Correct 144 ms 2404 KB Output is correct
40 Correct 202 ms 2452 KB Output is correct
41 Correct 181 ms 2496 KB Output is correct
42 Correct 205 ms 2420 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 0 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 0 ms 340 KB Output is correct
47 Correct 0 ms 340 KB Output is correct
48 Correct 0 ms 340 KB Output is correct
49 Correct 201 ms 2640 KB Output is correct
50 Correct 179 ms 2360 KB Output is correct
51 Correct 189 ms 2480 KB Output is correct
52 Correct 199 ms 2440 KB Output is correct
53 Correct 234 ms 2440 KB Output is correct
54 Correct 265 ms 2496 KB Output is correct
55 Correct 246 ms 2480 KB Output is correct
56 Correct 25 ms 596 KB Output is correct
57 Correct 23 ms 692 KB Output is correct
58 Correct 153 ms 1988 KB Output is correct
59 Correct 184 ms 2044 KB Output is correct
60 Correct 243 ms 1996 KB Output is correct
61 Correct 144 ms 2040 KB Output is correct
62 Correct 184 ms 2048 KB Output is correct
63 Correct 231 ms 2032 KB Output is correct
64 Correct 675 ms 2560 KB Output is correct
65 Correct 744 ms 2788 KB Output is correct
66 Correct 957 ms 2696 KB Output is correct
67 Correct 15 ms 2512 KB Output is correct
68 Correct 113 ms 3652 KB Output is correct
69 Correct 115 ms 3620 KB Output is correct
70 Correct 197 ms 3656 KB Output is correct
71 Correct 212 ms 3660 KB Output is correct
72 Correct 212 ms 3656 KB Output is correct
73 Correct 220 ms 3660 KB Output is correct
74 Correct 193 ms 3676 KB Output is correct