oj.uz

답안 #346436

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
346436 2021-01-09T16:46:17 Z alishahali1382 Wild Boar (JOI18_wild_boar) C++14
100 / 100
 6150 ms 478448 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;

const int inf=1000000010;
const ll INF=1000000000000001000LL;
const int mod=1000000007;
const int MAXN=100010, N=2005, M=4005;
typedef array<pair<ll, pii>, 5> DATA;

int n, m, T, L, k, u, v, x, y, t, a, b, ans;
int U[M], V[M], W[M], X[MAXN];
ll dist[M][M];
bool mark[M][M];
DATA F[N][N];
DATA seg[MAXN<<2];
pair<ll, pii> vec[25];
vector<int> G[N];
priority_queue<pll, vector<pll>, greater<pll>> pq;

DATA Merge(DATA X, DATA Y){
	int vs=0;
	for (int i=0; i<5; i++) for (int j=0; j<5; j++) if (X[i].first+Y[j].first<INF && X[i].second.second!=Y[j].second.first){
		int a=X[i].second.first, b=Y[j].second.second;
		ll w=X[i].first+Y[j].first;
		vec[vs++]={w, {a, b}};
	}
	DATA Z=F[0][0];
	if (!vs) return Z;
	sort(vec, vec+vs);
	Z[0]=vec[0];
	int sz=1, lastx=-1, lasty=-1, tedx=0, tedy=0;
	int x=Z[0].second.first, y=Z[0].second.second;
	for (int i=1; i<vs && sz<5; i++){
		int a=vec[i].second.first, b=vec[i].second.second;
		bool okx=(a!=x && b!=lastx && tedx<2);
		bool oky=(b!=y && a!=lasty && tedy<2);
		if (!okx && !oky) continue ;
		Z[sz++]=vec[i];
		if (okx){
			tedx++;
			lastx=b;
		}
		if (oky){
			tedy++;
			lasty=a;
		}
	}
	return Z;
}
void print(DATA X){
	for (int i=0; i<5 && X[i].first<INF; i++) cerr<<"{"<<X[i].first<<", ("<<X[i].second.first<<", "<<X[i].second.second<<")}  ";
	cerr<<"\n";
}
void Build(int id, int tl, int tr){
	if (tr-tl==1){
		seg[id]=F[X[tl]][X[tr]];
		return ;
	}
	int mid=(tl+tr)>>1;
	Build(id<<1, tl, mid);
	Build(id<<1 | 1, mid, tr);
	seg[id]=Merge(seg[id<<1], seg[id<<1 | 1]);
}
void Set(int id, int tl, int tr, int pos){
	if (pos<tl || tr<=pos) return ;
	if (tr-tl==1){
		seg[id]=F[X[tl]][X[tr]];
		return ;
	}
	int mid=(tl+tr)>>1;
	Set(id<<1, tl, mid, pos);
	Set(id<<1 | 1, mid, tr, pos);
	seg[id]=Merge(seg[id<<1], seg[id<<1 | 1]);
}

int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	cin>>n>>m>>T>>L;
	m<<=1;
//	assert(T==1); // 62 points
	for (int i=0; i<m; ){
		cin>>u>>v>>x;
		U[i]=u, V[i]=v, W[i]=x, G[u].pb(i++);
		U[i]=v, V[i]=u, W[i]=x, G[v].pb(i++);
	}
	memset(dist, 63, sizeof(dist));
	for (int i=0; i<m; i++){
		pq.push({dist[i][i]=0, i});
		while (pq.size()){
			int x=pq.top().second;
			pq.pop();
			if (mark[i][x]) continue ;
			mark[i][x]=1;
			for (int y:G[V[x]]) if (x^y^1 && dist[i][y]>dist[i][x]+W[y])
				pq.push({dist[i][y]=dist[i][x]+W[y], y});
		}
	}
	for (int i=0; i<5; i++) F[0][0][i]={INF, {-1, -1}};
	for (int i=1; i<=n; i++) for (int j=1; j<=n; j++) F[i][j]=F[0][0];
	for (int u=1; u<=n; u++) for (int v=u+1; v<=n; v++){
		for (int i:G[u]) for (int j:G[v]) F[u][v][0]=min(F[u][v][0], {W[i]+dist[i][j^1], {i>>1, j>>1}});
		int a=F[u][v][0].second.first, b=F[u][v][0].second.second;
		for (int i:G[u]) for (int j:G[v]){
			if ((i>>1)!=a) F[u][v][1]=min(F[u][v][1], {W[i]+dist[i][j^1], {i>>1, j>>1}});
			if ((j>>1)!=b) F[u][v][2]=min(F[u][v][2], {W[i]+dist[i][j^1], {i>>1, j>>1}});
		}
		int c=F[u][v][1].second.first, d=F[u][v][1].second.second;
		int e=F[u][v][2].second.first, f=F[u][v][2].second.second;
		for (int i:G[u]) for (int j:G[v]){
			if ((i>>1)!=a && (j>>1)!=d) F[u][v][3]=min(F[u][v][3], {W[i]+dist[i][j^1], {i>>1, j>>1}});
			if ((i>>1)!=e && (j>>1)!=b) F[u][v][4]=min(F[u][v][4], {W[i]+dist[i][j^1], {i>>1, j>>1}});
		}
		for (int i=0; i<5; i++) F[v][u][i]={F[u][v][i].first, {F[u][v][i].second.second, F[u][v][i].second.first}};
	}
//	cerr<<"F[4][2]: ";print(F[4][2]);
//	cerr<<"F[2][4]: ";print(F[2][4]);
//	print(Merge(F[4][2], F[2][4]));
//	cerr<<"F[2][3]: ";print(F[2][3]);
	
	for (int i=1; i<=L; i++) cin>>X[i];
	Build(1, 1, L);
	while (T--){
		cin>>x>>y;
		X[x]=y;
		Set(1, 1, L, x-1);
		Set(1, 1, L, x);
		ll res=seg[1][0].first;
		if (res>=INF) res=-1;
		cout<<res<<"\n";
	}
	
	return 0;
}
/*
3 3 1 3
1 2 1
2 3 1
1 3 1
1
2
3
3 1


5 5 1 4
2 5 1
2 4 1
1 3 8
4 5 6
3 4 4
1 2 5 2
2 3

5 5 1 4
1 4 9
3 5 2
2 4 1
2 3 5
4 5 8
4 2 4 3
4 1

5 5 1 3
1 4 9
3 5 2
2 4 1
2 3 5
4 5 8
4 2 4
3 4

*/

Compilation message

wild_boar.cpp: In function 'int main()':
wild_boar.cpp:125:7: warning: unused variable 'c' [-Wunused-variable]
  125 |   int c=F[u][v][1].second.first, d=F[u][v][1].second.second;
      |       ^
wild_boar.cpp:126:34: warning: unused variable 'f' [-Wunused-variable]
  126 |   int e=F[u][v][2].second.first, f=F[u][v][2].second.second;
      |                                  ^

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 126060 KB Output is correct
2 Correct 71 ms 126060 KB Output is correct
3 Correct 69 ms 126088 KB Output is correct
4 Correct 69 ms 126060 KB Output is correct
5 Correct 70 ms 126060 KB Output is correct
6 Correct 70 ms 126060 KB Output is correct
7 Correct 69 ms 126060 KB Output is correct
8 Correct 69 ms 126060 KB Output is correct
9 Correct 68 ms 126060 KB Output is correct
10 Correct 70 ms 126060 KB Output is correct
11 Correct 70 ms 126188 KB Output is correct
12 Correct 69 ms 126060 KB Output is correct
13 Correct 69 ms 126060 KB Output is correct
14 Correct 68 ms 126060 KB Output is correct
15 Correct 68 ms 126060 KB Output is correct
16 Correct 69 ms 126060 KB Output is correct
17 Correct 69 ms 126060 KB Output is correct
18 Correct 69 ms 126060 KB Output is correct
19 Correct 69 ms 126060 KB Output is correct
20 Correct 69 ms 126060 KB Output is correct
21 Correct 71 ms 126060 KB Output is correct
22 Correct 69 ms 126060 KB Output is correct
23 Correct 69 ms 126188 KB Output is correct
24 Correct 70 ms 126060 KB Output is correct
25 Correct 69 ms 126060 KB Output is correct

Subtask #2
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 126060 KB Output is correct
2 Correct 71 ms 126060 KB Output is correct
3 Correct 69 ms 126088 KB Output is correct
4 Correct 69 ms 126060 KB Output is correct
5 Correct 70 ms 126060 KB Output is correct
6 Correct 70 ms 126060 KB Output is correct
7 Correct 69 ms 126060 KB Output is correct
8 Correct 69 ms 126060 KB Output is correct
9 Correct 68 ms 126060 KB Output is correct
10 Correct 70 ms 126060 KB Output is correct
11 Correct 70 ms 126188 KB Output is correct
12 Correct 69 ms 126060 KB Output is correct
13 Correct 69 ms 126060 KB Output is correct
14 Correct 68 ms 126060 KB Output is correct
15 Correct 68 ms 126060 KB Output is correct
16 Correct 69 ms 126060 KB Output is correct
17 Correct 69 ms 126060 KB Output is correct
18 Correct 69 ms 126060 KB Output is correct
19 Correct 69 ms 126060 KB Output is correct
20 Correct 69 ms 126060 KB Output is correct
21 Correct 71 ms 126060 KB Output is correct
22 Correct 69 ms 126060 KB Output is correct
23 Correct 69 ms 126188 KB Output is correct
24 Correct 70 ms 126060 KB Output is correct
25 Correct 69 ms 126060 KB Output is correct
26 Correct 72 ms 126444 KB Output is correct
27 Correct 100 ms 148844 KB Output is correct
28 Correct 98 ms 148844 KB Output is correct
29 Correct 198 ms 150528 KB Output is correct
30 Correct 204 ms 150508 KB Output is correct
31 Correct 185 ms 150508 KB Output is correct
32 Correct 180 ms 150508 KB Output is correct
33 Correct 198 ms 151788 KB Output is correct
34 Correct 201 ms 151788 KB Output is correct
35 Correct 164 ms 151656 KB Output is correct
36 Correct 182 ms 151660 KB Output is correct
37 Correct 199 ms 151916 KB Output is correct
38 Correct 186 ms 153324 KB Output is correct
39 Correct 175 ms 153196 KB Output is correct
40 Correct 193 ms 153452 KB Output is correct
41 Correct 188 ms 153272 KB Output is correct
42 Correct 157 ms 154388 KB Output is correct
43 Correct 179 ms 155372 KB Output is correct
44 Correct 181 ms 155244 KB Output is correct
45 Correct 133 ms 157676 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 126060 KB Output is correct
2 Correct 71 ms 126060 KB Output is correct
3 Correct 69 ms 126088 KB Output is correct
4 Correct 69 ms 126060 KB Output is correct
5 Correct 70 ms 126060 KB Output is correct
6 Correct 70 ms 126060 KB Output is correct
7 Correct 69 ms 126060 KB Output is correct
8 Correct 69 ms 126060 KB Output is correct
9 Correct 68 ms 126060 KB Output is correct
10 Correct 70 ms 126060 KB Output is correct
11 Correct 70 ms 126188 KB Output is correct
12 Correct 69 ms 126060 KB Output is correct
13 Correct 69 ms 126060 KB Output is correct
14 Correct 68 ms 126060 KB Output is correct
15 Correct 68 ms 126060 KB Output is correct
16 Correct 69 ms 126060 KB Output is correct
17 Correct 69 ms 126060 KB Output is correct
18 Correct 69 ms 126060 KB Output is correct
19 Correct 69 ms 126060 KB Output is correct
20 Correct 69 ms 126060 KB Output is correct
21 Correct 71 ms 126060 KB Output is correct
22 Correct 69 ms 126060 KB Output is correct
23 Correct 69 ms 126188 KB Output is correct
24 Correct 70 ms 126060 KB Output is correct
25 Correct 69 ms 126060 KB Output is correct
26 Correct 72 ms 126444 KB Output is correct
27 Correct 100 ms 148844 KB Output is correct
28 Correct 98 ms 148844 KB Output is correct
29 Correct 198 ms 150528 KB Output is correct
30 Correct 204 ms 150508 KB Output is correct
31 Correct 185 ms 150508 KB Output is correct
32 Correct 180 ms 150508 KB Output is correct
33 Correct 198 ms 151788 KB Output is correct
34 Correct 201 ms 151788 KB Output is correct
35 Correct 164 ms 151656 KB Output is correct
36 Correct 182 ms 151660 KB Output is correct
37 Correct 199 ms 151916 KB Output is correct
38 Correct 186 ms 153324 KB Output is correct
39 Correct 175 ms 153196 KB Output is correct
40 Correct 193 ms 153452 KB Output is correct
41 Correct 188 ms 153272 KB Output is correct
42 Correct 157 ms 154388 KB Output is correct
43 Correct 179 ms 155372 KB Output is correct
44 Correct 181 ms 155244 KB Output is correct
45 Correct 133 ms 157676 KB Output is correct
46 Correct 247 ms 133996 KB Output is correct
47 Correct 4962 ms 184548 KB Output is correct
48 Correct 4414 ms 216396 KB Output is correct
49 Correct 3696 ms 245316 KB Output is correct
50 Correct 3951 ms 245484 KB Output is correct
51 Correct 4213 ms 245352 KB Output is correct
52 Correct 2954 ms 245388 KB Output is correct
53 Correct 2952 ms 245460 KB Output is correct
54 Correct 2971 ms 245432 KB Output is correct
55 Correct 2946 ms 245540 KB Output is correct
56 Correct 2931 ms 262252 KB Output is correct
57 Correct 2886 ms 280752 KB Output is correct
58 Correct 2830 ms 300540 KB Output is correct
59 Correct 2750 ms 322300 KB Output is correct
60 Correct 2704 ms 345452 KB Output is correct
61 Correct 2618 ms 369876 KB Output is correct
62 Correct 2507 ms 396352 KB Output is correct
63 Correct 2388 ms 423928 KB Output is correct
64 Correct 865 ms 476908 KB Output is correct
65 Correct 866 ms 476780 KB Output is correct

Subtask #4
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 126060 KB Output is correct
2 Correct 71 ms 126060 KB Output is correct
3 Correct 69 ms 126088 KB Output is correct
4 Correct 69 ms 126060 KB Output is correct
5 Correct 70 ms 126060 KB Output is correct
6 Correct 70 ms 126060 KB Output is correct
7 Correct 69 ms 126060 KB Output is correct
8 Correct 69 ms 126060 KB Output is correct
9 Correct 68 ms 126060 KB Output is correct
10 Correct 70 ms 126060 KB Output is correct
11 Correct 70 ms 126188 KB Output is correct
12 Correct 69 ms 126060 KB Output is correct
13 Correct 69 ms 126060 KB Output is correct
14 Correct 68 ms 126060 KB Output is correct
15 Correct 68 ms 126060 KB Output is correct
16 Correct 69 ms 126060 KB Output is correct
17 Correct 69 ms 126060 KB Output is correct
18 Correct 69 ms 126060 KB Output is correct
19 Correct 69 ms 126060 KB Output is correct
20 Correct 69 ms 126060 KB Output is correct
21 Correct 71 ms 126060 KB Output is correct
22 Correct 69 ms 126060 KB Output is correct
23 Correct 69 ms 126188 KB Output is correct
24 Correct 70 ms 126060 KB Output is correct
25 Correct 69 ms 126060 KB Output is correct
26 Correct 72 ms 126444 KB Output is correct
27 Correct 100 ms 148844 KB Output is correct
28 Correct 98 ms 148844 KB Output is correct
29 Correct 198 ms 150528 KB Output is correct
30 Correct 204 ms 150508 KB Output is correct
31 Correct 185 ms 150508 KB Output is correct
32 Correct 180 ms 150508 KB Output is correct
33 Correct 198 ms 151788 KB Output is correct
34 Correct 201 ms 151788 KB Output is correct
35 Correct 164 ms 151656 KB Output is correct
36 Correct 182 ms 151660 KB Output is correct
37 Correct 199 ms 151916 KB Output is correct
38 Correct 186 ms 153324 KB Output is correct
39 Correct 175 ms 153196 KB Output is correct
40 Correct 193 ms 153452 KB Output is correct
41 Correct 188 ms 153272 KB Output is correct
42 Correct 157 ms 154388 KB Output is correct
43 Correct 179 ms 155372 KB Output is correct
44 Correct 181 ms 155244 KB Output is correct
45 Correct 133 ms 157676 KB Output is correct
46 Correct 247 ms 133996 KB Output is correct
47 Correct 4962 ms 184548 KB Output is correct
48 Correct 4414 ms 216396 KB Output is correct
49 Correct 3696 ms 245316 KB Output is correct
50 Correct 3951 ms 245484 KB Output is correct
51 Correct 4213 ms 245352 KB Output is correct
52 Correct 2954 ms 245388 KB Output is correct
53 Correct 2952 ms 245460 KB Output is correct
54 Correct 2971 ms 245432 KB Output is correct
55 Correct 2946 ms 245540 KB Output is correct
56 Correct 2931 ms 262252 KB Output is correct
57 Correct 2886 ms 280752 KB Output is correct
58 Correct 2830 ms 300540 KB Output is correct
59 Correct 2750 ms 322300 KB Output is correct
60 Correct 2704 ms 345452 KB Output is correct
61 Correct 2618 ms 369876 KB Output is correct
62 Correct 2507 ms 396352 KB Output is correct
63 Correct 2388 ms 423928 KB Output is correct
64 Correct 865 ms 476908 KB Output is correct
65 Correct 866 ms 476780 KB Output is correct
66 Correct 140 ms 147308 KB Output is correct
67 Correct 417 ms 216752 KB Output is correct
68 Correct 934 ms 455660 KB Output is correct
69 Correct 1096 ms 456044 KB Output is correct
70 Correct 1329 ms 477516 KB Output is correct
71 Correct 6150 ms 186608 KB Output is correct
72 Correct 5640 ms 218360 KB Output is correct
73 Correct 3990 ms 247628 KB Output is correct
74 Correct 4017 ms 247356 KB Output is correct
75 Correct 3994 ms 247704 KB Output is correct
76 Correct 4842 ms 247532 KB Output is correct
77 Correct 5319 ms 247452 KB Output is correct
78 Correct 5779 ms 247248 KB Output is correct
79 Correct 3890 ms 282632 KB Output is correct
80 Correct 3827 ms 302748 KB Output is correct
81 Correct 4202 ms 324240 KB Output is correct
82 Correct 3617 ms 347244 KB Output is correct
83 Correct 3883 ms 371948 KB Output is correct
84 Correct 3271 ms 425904 KB Output is correct
85 Correct 1356 ms 478448 KB Output is correct