oj.uz

답안 #231639

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
231639 2020-05-14T08:48:48 Z _7_7_ Olympic Bus (JOI20_ho_t4) C++14
100 / 100
 682 ms 3064 KB 
#include <bits/stdc++.h>                                           
 
//#define int long long
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
 
 
#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define forev(i, b, a) for(int i = (b); i >= (a); --i)
#define forn(i, a, b) for(int i = (a); i <= (b); ++i)
#define all(x) x.begin(), x.end()
#define sz(s) (int)s.size()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define s second
#define f first
 
 
using namespace std;
 
 
typedef pair < long long, long long > pll;    
typedef pair < int, int > pii;
typedef unsigned long long ull;         
typedef vector < pii > vpii;
typedef vector < int > vi;
typedef long double ldb;  
typedef long long ll;  
typedef double db;                             
 
 
const int inf = 1e9, maxn = 208, mod = 1e9 + 7, N = 5e4 + 11;
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 555;
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);
const db eps = 1e-12, pi = 3.14159265359;
const ll INF = 1e18;

int n, m, a[N], b[N], c[N], d[N], p[maxn], Bad, F[maxn][maxn], D[maxn]; 
priority_queue < pii, vpii, greater < pii > > q;
vpii g[2][maxn];
bool I[4][N];

 
 
void Floyd () {
	for (int i = 1; i <= n; ++i)
		for (int j = 1; j <= n; ++j)	
		    if (i != j)
				F[i][j] = inf;
 
	for (int i = 1; i <= m; ++i)
		F[a[i]][b[i]] = min(F[a[i]][b[i]], c[i]);
 
	for (int k = 1; k <= n; ++k)
		for (int i = 1; i <= n; ++i)
			for (int j = 1; j <= n; ++j)
				F[i][j] = min(F[i][j], F[i][k] + F[k][j]);
 
}
 
int Dijkstra (int s, int f, int j, int x = -1) {
	memset(p, -1, sizeof(p));

	for (int i = 1; i <= n; ++i)
		D[i] = inf;

	while (sz(q))
		q.pop();

	D[s] = 0;
	q.push(mp(0, s));
	while (sz(q)) {
		int v = q.top().s, w = q.top().f;
		if (Bad && v == f)
			return D[f];
		q.pop();

		if (w > D[v])
			continue;

		for (auto X : g[j][v]) {			
			int to = X.f, i = X.s;
			if (i != Bad && D[to] > D[v] + c[i]) {
				D[to] = D[v] + c[i];
				p[to] = i;
				q.push(mp(D[to], to));
			}
		}
	}

	if (x > -1) {
		for (int i = 1; i <= n; ++i)
			if (p[i] > -1)
				I[x][p[i]] = 1;
	}

	return inf;
}
 
 
main () {
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= m; ++i) {
		scanf("%d%d%d%d", &a[i], &b[i], &c[i], &d[i]);
		g[0][a[i]].pb({b[i], i});
		g[1][b[i]].pb({a[i], i});
	}
 
	Floyd();
	Dijkstra(1, n, 0, 0);
	Dijkstra(n, 1, 0, 1);
	Dijkstra(1, n, 1, 2);
	Dijkstra(n, 1, 1, 3);
 


	int ans = inf + inf;
	if (F[1][n] < inf && F[n][1] < inf)
		ans = F[1][n] + F[n][1];

	for (int i = 1; i <= m; ++i) {
		Bad = i;
		g[0][b[i]].pb({a[i], m + 1});
		c[m + 1] = c[i];
	
		int d1, d2;
		if (I[0][i] || I[3][i])
			d1 = Dijkstra(1, n, 0);
		else
			d1 = min(F[1][n], F[1][b[i]] + F[a[i]][n] + c[i]);
		
		if (I[1][i] || I[2][i])
			d2 = Dijkstra(n, 1, 0);
		else
			d2 = min(F[n][1], F[n][b[i]] + F[a[i]][1] + c[i]);
		
		g[0][b[i]].ppb();
		if (d1 < inf && d2 < inf)
			ans = min(ans, d1 + d2 + d[i]);		
	}
 
	if (ans == inf + inf)
		ans = -1;
	printf("%d\n", ans);			
}

Compilation message

ho_t4.cpp:103:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main () {
       ^
ho_t4.cpp: In function 'int main()':
ho_t4.cpp:104:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &m);
  ~~~~~^~~~~~~~~~~~~~~~
ho_t4.cpp:106:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d%d", &a[i], &b[i], &c[i], &d[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 512 KB Output is correct
2 Correct 13 ms 512 KB Output is correct
3 Correct 27 ms 640 KB Output is correct
4 Correct 31 ms 640 KB Output is correct
5 Correct 6 ms 512 KB Output is correct
6 Correct 13 ms 512 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 29 ms 640 KB Output is correct
11 Correct 28 ms 640 KB Output is correct
12 Correct 29 ms 640 KB Output is correct
13 Correct 18 ms 640 KB Output is correct
14 Correct 21 ms 640 KB Output is correct
15 Correct 20 ms 512 KB Output is correct
16 Correct 24 ms 640 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 111 ms 2936 KB Output is correct
2 Correct 125 ms 2936 KB Output is correct
3 Correct 103 ms 2808 KB Output is correct
4 Correct 18 ms 640 KB Output is correct
5 Correct 18 ms 512 KB Output is correct
6 Correct 13 ms 512 KB Output is correct
7 Correct 13 ms 640 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 67 ms 2680 KB Output is correct
10 Correct 63 ms 2744 KB Output is correct
11 Correct 102 ms 2808 KB Output is correct
12 Correct 96 ms 2808 KB Output is correct
13 Correct 109 ms 2808 KB Output is correct
14 Correct 104 ms 3064 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 640 KB Output is correct
2 Correct 14 ms 512 KB Output is correct
3 Correct 70 ms 2176 KB Output is correct
4 Correct 13 ms 512 KB Output is correct
5 Correct 82 ms 2680 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 52 ms 2680 KB Output is correct
9 Correct 58 ms 2680 KB Output is correct
10 Correct 88 ms 2680 KB Output is correct
11 Correct 60 ms 2680 KB Output is correct
12 Correct 56 ms 2808 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 4 ms 384 KB Output is correct
19 Correct 88 ms 2808 KB Output is correct
20 Correct 61 ms 2808 KB Output is correct
21 Correct 57 ms 2808 KB Output is correct
22 Correct 62 ms 2688 KB Output is correct

Subtask #4
63.0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 512 KB Output is correct
2 Correct 13 ms 512 KB Output is correct
3 Correct 27 ms 640 KB Output is correct
4 Correct 31 ms 640 KB Output is correct
5 Correct 6 ms 512 KB Output is correct
6 Correct 13 ms 512 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 29 ms 640 KB Output is correct
11 Correct 28 ms 640 KB Output is correct
12 Correct 29 ms 640 KB Output is correct
13 Correct 18 ms 640 KB Output is correct
14 Correct 21 ms 640 KB Output is correct
15 Correct 20 ms 512 KB Output is correct
16 Correct 24 ms 640 KB Output is correct
17 Correct 111 ms 2936 KB Output is correct
18 Correct 125 ms 2936 KB Output is correct
19 Correct 103 ms 2808 KB Output is correct
20 Correct 18 ms 640 KB Output is correct
21 Correct 18 ms 512 KB Output is correct
22 Correct 13 ms 512 KB Output is correct
23 Correct 13 ms 640 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 67 ms 2680 KB Output is correct
26 Correct 63 ms 2744 KB Output is correct
27 Correct 102 ms 2808 KB Output is correct
28 Correct 96 ms 2808 KB Output is correct
29 Correct 109 ms 2808 KB Output is correct
30 Correct 104 ms 3064 KB Output is correct
31 Correct 27 ms 640 KB Output is correct
32 Correct 14 ms 512 KB Output is correct
33 Correct 70 ms 2176 KB Output is correct
34 Correct 13 ms 512 KB Output is correct
35 Correct 82 ms 2680 KB Output is correct
36 Correct 4 ms 384 KB Output is correct
37 Correct 4 ms 384 KB Output is correct
38 Correct 52 ms 2680 KB Output is correct
39 Correct 58 ms 2680 KB Output is correct
40 Correct 88 ms 2680 KB Output is correct
41 Correct 60 ms 2680 KB Output is correct
42 Correct 56 ms 2808 KB Output is correct
43 Correct 5 ms 384 KB Output is correct
44 Correct 4 ms 384 KB Output is correct
45 Correct 5 ms 384 KB Output is correct
46 Correct 4 ms 384 KB Output is correct
47 Correct 4 ms 384 KB Output is correct
48 Correct 4 ms 384 KB Output is correct
49 Correct 88 ms 2808 KB Output is correct
50 Correct 61 ms 2808 KB Output is correct
51 Correct 57 ms 2808 KB Output is correct
52 Correct 62 ms 2688 KB Output is correct
53 Correct 137 ms 2936 KB Output is correct
54 Correct 137 ms 2680 KB Output is correct
55 Correct 109 ms 2808 KB Output is correct
56 Correct 28 ms 640 KB Output is correct
57 Correct 23 ms 640 KB Output is correct
58 Correct 102 ms 2168 KB Output is correct
59 Correct 106 ms 2176 KB Output is correct
60 Correct 109 ms 2176 KB Output is correct
61 Correct 98 ms 2172 KB Output is correct
62 Correct 103 ms 2296 KB Output is correct
63 Correct 109 ms 2176 KB Output is correct
64 Correct 682 ms 2552 KB Output is correct
65 Correct 631 ms 2552 KB Output is correct
66 Correct 595 ms 2552 KB Output is correct
67 Correct 26 ms 1916 KB Output is correct
68 Correct 68 ms 2808 KB Output is correct
69 Correct 66 ms 2680 KB Output is correct
70 Correct 121 ms 2812 KB Output is correct
71 Correct 120 ms 2680 KB Output is correct
72 Correct 105 ms 2680 KB Output is correct
73 Correct 121 ms 2808 KB Output is correct
74 Correct 123 ms 2808 KB Output is correct