oj.uz

Submission #62207

# Submission time Handle Problem Language Result Execution time Memory
62207 2018-07-27T20:43:58 Z cki86201 Wild Boar (JOI18_wild_boar) C++11
62 / 100
 18000 ms 823860 KB 
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <memory.h>
#include <math.h>
#include <assert.h>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <algorithm>
#include <iostream>
#include <functional>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <bitset>

using namespace std;
typedef long long ll;
#define Fi first
#define Se second
#define pb(x) push_back(x)
#define szz(x) ((int)(x).size())
#define rep(i, n) for(int i=0;i<n;i++)
#define all(x) (x).begin(), (x).end()
typedef tuple<int, int, int> t3;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef long double ldouble;

typedef pair<ll, int> pli;

int N, M, T, L;
t3 edgen[4040];
int edgec[2020][2020];
vector <pii> IE[2020];
vector <int> nume[2020];
vector <int> numl[2020], numr[2020];
vector <pii> E[20020];
int cs;
void addedge(int x, int y, int c) {
	E[x].pb(pii(c, y));
}

ll dis[4040][4040], dtemp[12020];
int X[100010];
pii query[100010];

typedef pair<ll, pii> plp;

void updplp(plp &a, plp &b) {
	if(a.Fi > b.Fi) a = b;
	else if(a.Fi == b.Fi) {
		a.Se.Fi = min(a.Se.Fi, b.Se.Fi);
		a.Se.Se = min(a.Se.Se, b.Se.Se);
	}
}

ll Val[2020][2020][4][4];
int Idx_l[2020][2020][4];
int Idx_r[2020][2020][4];

struct node {
	node(){}
	node(int s, int e) {
		rep(a, 4) rep(b, 4) V[a][b] = Val[s][e][a][b];
		rep(a, 4) ir[a] = Idx_r[s][e][a];
		rep(a, 4) il[a] = Idx_l[s][e][a];
	}
	ll V[4][4];
	int ir[4], il[4];
	void init() {
		rep(i, 4) ir[i] = il[i] = -1;
		rep(i, 4) rep(j, 4) V[i][j] = 1e18;
	}
	ll Get() {
		ll res = 1e18;
		rep(i, 4) rep(j, 4) res = min(res, V[i][j]);
		return res;
	}
};

node merge(const node &lhs, const node &rhs) {
	node res; res.init();
	rep(i, 4) res.il[i] = lhs.il[i];
	rep(i, 4) res.ir[i] = rhs.ir[i];
	rep(i, 4) if(lhs.il[i] != -1) {
		rep(j, 4) if(lhs.ir[j] != -1) {
			ll v1 = lhs.V[i][j];
			if(v1 == 1e18) continue;
			rep(k, 4) if(rhs.il[k] != -1 && rhs.il[k] != lhs.ir[j]) {
				rep(l, 4) if(rhs.ir[l] != -1) {
					if(res.V[i][l] > rhs.V[k][l] + v1) {
						res.V[i][l] = rhs.V[k][l] + v1;
					}
				}
			}
		}
	}
	return res;
}

node Tr[1<<18];

void Init(int rt, int l, int r) {
	if(l == r) {
		Tr[rt] = node(X[l], X[l+1]);
		return;
	}
	int m = (l + r) >> 1;
	Init(rt<<1, l, m);
	Init(rt<<1|1, m+1, r);
	Tr[rt] = merge(Tr[rt<<1], Tr[rt<<1|1]);
}

void update(int rt, int l, int r, int x) {
	if(l == r) {
		Tr[rt] = node(X[l], X[l+1]);
		return;
	}
	int m = (l + r) >> 1;
	if(x <= m) update(rt<<1, l, m, x);
	else update(rt<<1|1, m+1, r, x);
	Tr[rt] = merge(Tr[rt<<1], Tr[rt<<1|1]);
}

int main() {
	memset(edgec, -1, sizeof edgec);
	memset(Idx_l, -1, sizeof Idx_l);
	memset(Idx_r, -1, sizeof Idx_r);
	scanf("%d%d%d%d", &N, &M, &T, &L);
	rep(i, M) {
		int x, y, z;
		scanf("%d%d%d", &x, &y, &z);
		edgen[i<<1] = t3(x, y, z);
		edgec[x][y] = i<<1;
		edgen[i<<1|1] = t3(y, x, z);
		edgec[y][x] = i<<1|1;
		nume[x].pb(cs++);
		nume[y].pb(cs++);
		IE[x].pb(pii(z, y));
		IE[y].pb(pii(z, x));
	}
	for(int i=1;i<=N;i++) {
		int l = szz(IE[i]);
		numl[i].resize(l);
		numr[i].resize(l);
		rep(j, l) numl[i][j] = cs++;
		rep(j, l) numr[i][j] = cs++;
		for(int j=1;j<l;j++) {
			int x = numl[i][j-1], y = numl[i][j];
			addedge(y, x, 0);
			x = numr[i][j-1], y = numr[i][j];
			addedge(x, y, 0);
		}
		rep(j, l) {
			addedge(numl[i][j], nume[i][j], 0);
			addedge(numr[i][j], nume[i][j], 0);
		}
		rep(j, l) {
			int x = nume[i][j] ^ 1, len = get<2>(edgen[x]);
			if(j) addedge(x, numl[i][j-1], len);
			if(j < l-1) addedge(x, numr[i][j+1], len);
		}
	}
	rep(st, 2*M) {
		rep(i, cs) dtemp[i] = 1e18;
		dtemp[st] = 0;
		priority_queue <pli, vector<pli>, greater<pli> > pq;
		pq.push(pli(0, st));
		while(!pq.empty()) {
			pli t = pq.top(); pq.pop();
			if(dtemp[t.Se] != t.Fi) continue;
			for(pii e : E[t.Se]) {
				if(t.Fi + e.Fi < dtemp[e.Se]) {
					dtemp[e.Se] = t.Fi + e.Fi;
					pq.push(pli(dtemp[e.Se], e.Se));
				}
			}
		}
		rep(i, 2*M) dis[st][i] = dtemp[i];
	}
	
	for(int i=1;i<=N;i++) for(int j=1;j<=N;j++) rep(a, 4) rep(b, 4) Val[i][j][a][b] = 1e18;
	
	for(int i=1;i<=N;i++) for(int j=1;j<=N;j++) {
		int si = szz(IE[i]);
		int sj = szz(IE[j]);
		vector <vector <plp> > mn[4];
		vector <vector <ll> > val;
		rep(a, 4) {
			mn[a].resize(si);
			val.resize(si);
			rep(b, si) mn[a][b].resize(sj), val[b].resize(sj);
		}
		
		rep(k, si) {
			int eidx = nume[i][k];
			rep(l, sj) {
				int fidx = nume[j][l] ^ 1;
				plp pp = plp(dis[eidx][fidx] + get<2>(edgen[fidx]), pii(k, l));
				rep(t, 4) mn[t][k][l] = pp;
				val[k][l] = pp.Fi;
			}
		}
		rep(k, si) for(int l=1;l<sj;l++) for(int a : {0, 2}) updplp(mn[a][k][l], mn[a][k][l-1]);
		rep(k, si) for(int l=sj-2;l>=0;l--) for(int a : {1, 3}) updplp(mn[a][k][l], mn[a][k][l+1]);
		rep(l, sj) for(int k=1;k<si;k++) for(int a : {0, 1}) updplp(mn[a][k][l], mn[a][k-1][l]);
		rep(l, sj) for(int k=si-2;k>=0;k--) for(int a : {2, 3}) updplp(mn[a][k][l], mn[a][k+1][l]);
		set <int> idx_i, idx_j;
		rep(k, si) rep(l, sj) {
			plp r = plp(1e18, pii(-1, -1));
			if(k > 0 && l > 0) updplp(r, mn[0][k-1][l-1]);
			if(k > 0 && l < sj - 1) updplp(r, mn[1][k-1][l+1]);
			if(k < si - 1 && l > 0) updplp(r, mn[2][k+1][l-1]);
			if(k < si - 1 && l < sj - 1) updplp(r, mn[3][k+1][l+1]);
			if(r.Se.Fi != -1) idx_i.insert(r.Se.Fi);
			if(r.Se.Se != -1) idx_j.insert(r.Se.Se);
		}
		rep(k, si) {
			plp r = plp(1e18, pii(-1, -1));
			if(k > 0) updplp(r, mn[0][k-1][sj-1]);
			if(k < si - 1) updplp(r, mn[2][k+1][sj-1]);
			if(r.Se.Fi != -1) idx_i.insert(r.Se.Fi);
			if(r.Se.Se != -1) idx_j.insert(r.Se.Se);
		}
		rep(l, sj) {
			plp r = plp(1e18, pii(-1, -1));
			if(l > 0) updplp(r, mn[0][si-1][l-1]);
			if(l < sj - 1) updplp(r, mn[1][si-1][l+1]);
			if(r.Se.Fi != -1) idx_i.insert(r.Se.Fi);
			if(r.Se.Se != -1) idx_j.insert(r.Se.Se);
		}
		plp r = plp(1e18, pii(-1, -1));
		updplp(r, mn[0][si-1][sj-1]);
		if(r.Se.Fi != -1) idx_i.insert(r.Se.Fi);
		if(r.Se.Se != -1) idx_j.insert(r.Se.Se);
		vector <int> vi, vj;
		for(int e : idx_i) vi.pb(e);
		for(int e : idx_j) vj.pb(e);
		rep(a, szz(vi)) Idx_l[i][j][a] = IE[i][vi[a]].Se;
		rep(a, szz(vj)) Idx_r[i][j][a] = IE[j][vj[a]].Se;
		rep(a, szz(vi)) rep(b, szz(vj)) {
			Val[i][j][a][b] = val[vi[a]][vj[b]];
		}
	}
	
	for(int i=1;i<=L;i++) scanf("%d", X+i);
	for(int i=1;i<=T;i++) {
		int x, y; scanf("%d%d", &x, &y);
		query[i] = pii(x, y);
	}
	
	Init(1, 1, L - 1);
	for(int i=1;i<=T;i++) {
		int x = query[i].Fi;
		int y = query[i].Se;
		X[x] = y;
		if(x > 1) update(1, 1, L - 1, x - 1);
		if(x < L) update(1, 1, L - 1, x);
		ll val = Tr[1].Get();
		if(val >= 1e18) puts("-1");
		else printf("%lld\n", val);
	}
	return 0;
}

Compilation message

wild_boar.cpp: In function 'int main()':
wild_boar.cpp:132:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d%d", &N, &M, &T, &L);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
wild_boar.cpp:135:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d", &x, &y, &z);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~
wild_boar.cpp:249:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1;i<=L;i++) scanf("%d", X+i);
                        ~~~~~^~~~~~~~~~~
wild_boar.cpp:251:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int x, y; scanf("%d%d", &x, &y);
             ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 144760 KB Output is correct
2 Correct 117 ms 145044 KB Output is correct
3 Correct 131 ms 145044 KB Output is correct
4 Correct 122 ms 145080 KB Output is correct
5 Correct 140 ms 145092 KB Output is correct
6 Correct 126 ms 145092 KB Output is correct
7 Correct 137 ms 145092 KB Output is correct
8 Correct 132 ms 145092 KB Output is correct
9 Correct 115 ms 145092 KB Output is correct
10 Correct 119 ms 145092 KB Output is correct
11 Correct 144 ms 145104 KB Output is correct
12 Correct 132 ms 145104 KB Output is correct
13 Correct 143 ms 145116 KB Output is correct
14 Correct 121 ms 145144 KB Output is correct
15 Correct 126 ms 145144 KB Output is correct
16 Correct 141 ms 145180 KB Output is correct
17 Correct 113 ms 145180 KB Output is correct
18 Correct 151 ms 145180 KB Output is correct
19 Correct 110 ms 145188 KB Output is correct
20 Correct 115 ms 145188 KB Output is correct
21 Correct 145 ms 145188 KB Output is correct
22 Correct 131 ms 145188 KB Output is correct
23 Correct 148 ms 145188 KB Output is correct
24 Correct 122 ms 145188 KB Output is correct
25 Correct 144 ms 145192 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 144760 KB Output is correct
2 Correct 117 ms 145044 KB Output is correct
3 Correct 131 ms 145044 KB Output is correct
4 Correct 122 ms 145080 KB Output is correct
5 Correct 140 ms 145092 KB Output is correct
6 Correct 126 ms 145092 KB Output is correct
7 Correct 137 ms 145092 KB Output is correct
8 Correct 132 ms 145092 KB Output is correct
9 Correct 115 ms 145092 KB Output is correct
10 Correct 119 ms 145092 KB Output is correct
11 Correct 144 ms 145104 KB Output is correct
12 Correct 132 ms 145104 KB Output is correct
13 Correct 143 ms 145116 KB Output is correct
14 Correct 121 ms 145144 KB Output is correct
15 Correct 126 ms 145144 KB Output is correct
16 Correct 141 ms 145180 KB Output is correct
17 Correct 113 ms 145180 KB Output is correct
18 Correct 151 ms 145180 KB Output is correct
19 Correct 110 ms 145188 KB Output is correct
20 Correct 115 ms 145188 KB Output is correct
21 Correct 145 ms 145188 KB Output is correct
22 Correct 131 ms 145188 KB Output is correct
23 Correct 148 ms 145188 KB Output is correct
24 Correct 122 ms 145188 KB Output is correct
25 Correct 144 ms 145192 KB Output is correct
26 Correct 135 ms 145572 KB Output is correct
27 Correct 200 ms 189372 KB Output is correct
28 Correct 197 ms 189372 KB Output is correct
29 Correct 426 ms 193552 KB Output is correct
30 Correct 455 ms 193844 KB Output is correct
31 Correct 490 ms 193844 KB Output is correct
32 Correct 396 ms 193844 KB Output is correct
33 Correct 471 ms 195380 KB Output is correct
34 Correct 437 ms 195412 KB Output is correct
35 Correct 420 ms 195416 KB Output is correct
36 Correct 471 ms 195528 KB Output is correct
37 Correct 507 ms 195528 KB Output is correct
38 Correct 467 ms 197828 KB Output is correct
39 Correct 395 ms 197860 KB Output is correct
40 Correct 480 ms 197860 KB Output is correct
41 Correct 455 ms 197924 KB Output is correct
42 Correct 412 ms 199860 KB Output is correct
43 Correct 477 ms 200916 KB Output is correct
44 Correct 473 ms 200916 KB Output is correct
45 Correct 348 ms 204524 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 144760 KB Output is correct
2 Correct 117 ms 145044 KB Output is correct
3 Correct 131 ms 145044 KB Output is correct
4 Correct 122 ms 145080 KB Output is correct
5 Correct 140 ms 145092 KB Output is correct
6 Correct 126 ms 145092 KB Output is correct
7 Correct 137 ms 145092 KB Output is correct
8 Correct 132 ms 145092 KB Output is correct
9 Correct 115 ms 145092 KB Output is correct
10 Correct 119 ms 145092 KB Output is correct
11 Correct 144 ms 145104 KB Output is correct
12 Correct 132 ms 145104 KB Output is correct
13 Correct 143 ms 145116 KB Output is correct
14 Correct 121 ms 145144 KB Output is correct
15 Correct 126 ms 145144 KB Output is correct
16 Correct 141 ms 145180 KB Output is correct
17 Correct 113 ms 145180 KB Output is correct
18 Correct 151 ms 145180 KB Output is correct
19 Correct 110 ms 145188 KB Output is correct
20 Correct 115 ms 145188 KB Output is correct
21 Correct 145 ms 145188 KB Output is correct
22 Correct 131 ms 145188 KB Output is correct
23 Correct 148 ms 145188 KB Output is correct
24 Correct 122 ms 145188 KB Output is correct
25 Correct 144 ms 145192 KB Output is correct
26 Correct 135 ms 145572 KB Output is correct
27 Correct 200 ms 189372 KB Output is correct
28 Correct 197 ms 189372 KB Output is correct
29 Correct 426 ms 193552 KB Output is correct
30 Correct 455 ms 193844 KB Output is correct
31 Correct 490 ms 193844 KB Output is correct
32 Correct 396 ms 193844 KB Output is correct
33 Correct 471 ms 195380 KB Output is correct
34 Correct 437 ms 195412 KB Output is correct
35 Correct 420 ms 195416 KB Output is correct
36 Correct 471 ms 195528 KB Output is correct
37 Correct 507 ms 195528 KB Output is correct
38 Correct 467 ms 197828 KB Output is correct
39 Correct 395 ms 197860 KB Output is correct
40 Correct 480 ms 197860 KB Output is correct
41 Correct 455 ms 197924 KB Output is correct
42 Correct 412 ms 199860 KB Output is correct
43 Correct 477 ms 200916 KB Output is correct
44 Correct 473 ms 200916 KB Output is correct
45 Correct 348 ms 204524 KB Output is correct
46 Correct 928 ms 204524 KB Output is correct
47 Correct 13039 ms 347316 KB Output is correct
48 Correct 13210 ms 397532 KB Output is correct
49 Correct 12538 ms 443468 KB Output is correct
50 Correct 13474 ms 443576 KB Output is correct
51 Correct 11596 ms 443576 KB Output is correct
52 Correct 15778 ms 443576 KB Output is correct
53 Correct 14022 ms 443576 KB Output is correct
54 Correct 14621 ms 443576 KB Output is correct
55 Correct 14370 ms 443576 KB Output is correct
56 Correct 14569 ms 470076 KB Output is correct
57 Correct 14606 ms 499248 KB Output is correct
58 Correct 15096 ms 530872 KB Output is correct
59 Correct 13422 ms 565004 KB Output is correct
60 Correct 14797 ms 601788 KB Output is correct
61 Correct 12889 ms 640984 KB Output is correct
62 Correct 12771 ms 682748 KB Output is correct
63 Correct 12864 ms 727032 KB Output is correct
64 Correct 9653 ms 819788 KB Output is correct
65 Correct 9829 ms 819968 KB Output is correct

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 144760 KB Output is correct
2 Correct 117 ms 145044 KB Output is correct
3 Correct 131 ms 145044 KB Output is correct
4 Correct 122 ms 145080 KB Output is correct
5 Correct 140 ms 145092 KB Output is correct
6 Correct 126 ms 145092 KB Output is correct
7 Correct 137 ms 145092 KB Output is correct
8 Correct 132 ms 145092 KB Output is correct
9 Correct 115 ms 145092 KB Output is correct
10 Correct 119 ms 145092 KB Output is correct
11 Correct 144 ms 145104 KB Output is correct
12 Correct 132 ms 145104 KB Output is correct
13 Correct 143 ms 145116 KB Output is correct
14 Correct 121 ms 145144 KB Output is correct
15 Correct 126 ms 145144 KB Output is correct
16 Correct 141 ms 145180 KB Output is correct
17 Correct 113 ms 145180 KB Output is correct
18 Correct 151 ms 145180 KB Output is correct
19 Correct 110 ms 145188 KB Output is correct
20 Correct 115 ms 145188 KB Output is correct
21 Correct 145 ms 145188 KB Output is correct
22 Correct 131 ms 145188 KB Output is correct
23 Correct 148 ms 145188 KB Output is correct
24 Correct 122 ms 145188 KB Output is correct
25 Correct 144 ms 145192 KB Output is correct
26 Correct 135 ms 145572 KB Output is correct
27 Correct 200 ms 189372 KB Output is correct
28 Correct 197 ms 189372 KB Output is correct
29 Correct 426 ms 193552 KB Output is correct
30 Correct 455 ms 193844 KB Output is correct
31 Correct 490 ms 193844 KB Output is correct
32 Correct 396 ms 193844 KB Output is correct
33 Correct 471 ms 195380 KB Output is correct
34 Correct 437 ms 195412 KB Output is correct
35 Correct 420 ms 195416 KB Output is correct
36 Correct 471 ms 195528 KB Output is correct
37 Correct 507 ms 195528 KB Output is correct
38 Correct 467 ms 197828 KB Output is correct
39 Correct 395 ms 197860 KB Output is correct
40 Correct 480 ms 197860 KB Output is correct
41 Correct 455 ms 197924 KB Output is correct
42 Correct 412 ms 199860 KB Output is correct
43 Correct 477 ms 200916 KB Output is correct
44 Correct 473 ms 200916 KB Output is correct
45 Correct 348 ms 204524 KB Output is correct
46 Correct 928 ms 204524 KB Output is correct
47 Correct 13039 ms 347316 KB Output is correct
48 Correct 13210 ms 397532 KB Output is correct
49 Correct 12538 ms 443468 KB Output is correct
50 Correct 13474 ms 443576 KB Output is correct
51 Correct 11596 ms 443576 KB Output is correct
52 Correct 15778 ms 443576 KB Output is correct
53 Correct 14022 ms 443576 KB Output is correct
54 Correct 14621 ms 443576 KB Output is correct
55 Correct 14370 ms 443576 KB Output is correct
56 Correct 14569 ms 470076 KB Output is correct
57 Correct 14606 ms 499248 KB Output is correct
58 Correct 15096 ms 530872 KB Output is correct
59 Correct 13422 ms 565004 KB Output is correct
60 Correct 14797 ms 601788 KB Output is correct
61 Correct 12889 ms 640984 KB Output is correct
62 Correct 12771 ms 682748 KB Output is correct
63 Correct 12864 ms 727032 KB Output is correct
64 Correct 9653 ms 819788 KB Output is correct
65 Correct 9829 ms 819968 KB Output is correct
66 Correct 225 ms 819968 KB Output is correct
67 Correct 2257 ms 819968 KB Output is correct
68 Correct 8047 ms 819968 KB Output is correct
69 Correct 9190 ms 819968 KB Output is correct
70 Correct 9285 ms 823860 KB Output is correct
71 Correct 13955 ms 823860 KB Output is correct
72 Correct 12996 ms 823860 KB Output is correct
73 Execution timed out 18119 ms 823860 KB Time limit exceeded
74 Halted 0 ms 0 KB -