oj.uz

답안 #417253

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
417253 2021-06-03T14:01:00 Z Kevin_Zhang_TW Sky Walking (IOI19_walk) C++17
100 / 100
 2268 ms 274384 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l)==r], ++l; }
#else
#define DE(...) 0
#define debug(...) 0
#endif
 
 
// TODO Watch out for the size
const int MAX_N = 400010 * 10;
const ll inf = 1ll << 55;
#include "walk.h"
 
// graph is 0 based
int n, m;
vector<int> xup[MAX_N];
vector<int> x, h, pfsz;
vector<pair<int,int>> edge[MAX_N];
 
int get_id(int i, int j) {
	assert(binary_search(AI(xup[i]), j));
	return lower_bound(AI(xup[i]), j) - begin(xup[i]) + pfsz[i];
}
 
 
const int C = MAX_N;
 
void sweep(vector<int> l, vector<int> r, vector<int> y) {
	set<int> ally;
	vector<vector<int>> in(n + 10), out(n + 10);
	for (int i = 0;i < m;++i) {
		if (r[i] - l[i] + 1 <= 2) continue;
		DE(l[i], r[i], y[i]);
		in[l[i]+1].pb(y[i]);
		out[r[i]].pb(y[i]);
	}
 
	for (int i = 0;i < n;++i) {
		for (int j : out[i]) ally.erase(j);
		for (int j : in[i]) ally.insert(j);
 
		vector<int> ep = xup[i];
 
		if (false && ep.size() && ep[0] == 0) {
			xup[i].insert(end(xup[i]), AI(ally));
			continue;
		}
 
//		auto it = begin(ally), rit = ally.upper_bound(h[i]);
//		for (int j = 0;j < C && it != rit;++j) {
//			xup[i].pb(*it++);
//		}
//		for (int j = 0;j < C && it != rit;++j)
//			xup[i].pb(*--rit);
 
		ep.pb(0), ep.pb(h[i]);
		for (int j : ep) {
			auto it = ally.upper_bound(j);
			{
				auto c = it;
				if (c != end(ally)) xup[i].pb(*c++);
				//if (c != end(ally)) xup[i].pb(*c++);
			}
			//if (it != begin(ally)) xup[i].pb(*prev(it)), --it;
			if (it != begin(ally)) xup[i].pb(*prev(it));
		}
	}
}
void init_ver(std::vector<int> l, std::vector<int> r, std::vector<int> y, int s, int g) {
//	for (int i = 0;i < m;++i) {
//		for (int j = l[i];j <= r[i];++j) {
//			if (h[j] < y[i]) continue;
//			xup[j].pb(y[i]);
//		}
//	}
//	for (int i = 0;i < n;++i) {
//		sort(AI(xup[i]));
//		xup[i].erase(unique(AI(xup[i])), end(xup[i]));
//		if (xup[i].size() < C * 2) continue;
//		vector<int> e(end(xup[i])-C, end(xup[i]));
//		xup[i].resize(C);
//		xup[i].insert(end(xup[i]), AI(e));
//	}
//
 
	xup[s].pb(0), xup[g].pb(0);
 
	for (int i = 0;i < m;++i) {
		xup[ l[i] ].pb( y[i] );
		xup[ r[i] ].pb( y[i] );
	}
 
	sweep(l, r, y);
 
	pfsz.resize(n+1);
	for (int i = 0;i < n;++i) {
		sort(AI(xup[i]));
		xup[i].erase(unique(AI(xup[i])), end(xup[i]));
		while (xup[i].size() && xup[i].back() > h[i])
			xup[i].pop_back();
 
		pfsz[i+1] = pfsz[i] + xup[i].size();
		for (int j = 1;j < xup[i].size();++j) {
			int a = pfsz[i]+j-1, b = pfsz[i] + j
			//int a = get_id(i, xup[i][j-1]), b = get_id(i, xup[i][j]),
				, d = xup[i][j] - xup[i][j-1];
			edge[a].pb(b, d);
			edge[b].pb(a, d);
		}
	}
}
 
void mbuild(vector<int> l, vector<int> r, vector<int> y) {
 
	map<int, vector<int>> xs;
 
	for (int i = 0;i < n;++i) {
		for (int j : xup[i])
			xs[j].pb(i);
	}
 
	for (int i = 0;i < m;++i) {
		vector< int > loc;
 
		auto it = lower_bound(AI( xs[y[i]] ), l[i]);
		while (it != end(xs[y[i]])) {
			if (*it > r[i]) break;
			loc.pb(*it++);
		}
 
		for (int j = 1;j < loc.size();++j) {
			int a = get_id(loc[j-1], y[i]), b = get_id(loc[j], y[i]),
				d = x[ loc[j] ] - x[ loc[j-1] ];
		
			edge[a].pb(b, d);
			edge[b].pb(a, d);
		}
	}
}
 
ll sho(int s, int t) {
	int V = pfsz.back() + 10;
	vector<ll> dis(V, inf);
	
	priority_queue<pair<ll,ll>, vector<pair<ll,ll>>, greater<pair<ll,ll>>> pq;
	auto upd = [&](int id, ll d) {
		if (chmin(dis[id], d))
			pq.emplace(d, id);
	};
 
	upd(s, 0);
 
	while (pq.size()) {
		auto [d, x] = pq.top(); pq.pop();
		if (d != dis[x]) continue;
		if (x == t) return d;
		DE(x, d);
		for (auto [u, w] : edge[x])
			upd(u, d + w);
	}
	return -1;
 
}
 
long long min_distance(std::vector<int> x, std::vector<int> h, std::vector<int> l, std::vector<int> r, std::vector<int> y, int s, int g) {
	n = x.size();
	m = l.size();
	::x = x;
	::h = h;
 
	init_ver(l, r, y, s, g);
 
	mbuild(l, r, y);
 
	return sho( get_id(s, 0), get_id(g, 0) );
}

Compilation message

walk.cpp: In function 'void sweep(std::vector<int>, std::vector<int>, std::vector<int>)':
walk.cpp:14:17: warning: statement has no effect [-Wunused-value]
   14 | #define DE(...) 0
      |                 ^
walk.cpp:43:3: note: in expansion of macro 'DE'
   43 |   DE(l[i], r[i], y[i]);
      |   ^~
walk.cpp: In function 'void init_ver(std::vector<int>, std::vector<int>, std::vector<int>, int, int)':
walk.cpp:113:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  113 |   for (int j = 1;j < xup[i].size();++j) {
      |                  ~~^~~~~~~~~~~~~~~
walk.cpp: In function 'void mbuild(std::vector<int>, std::vector<int>, std::vector<int>)':
walk.cpp:141:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  141 |   for (int j = 1;j < loc.size();++j) {
      |                  ~~^~~~~~~~~~~~
walk.cpp: In function 'll sho(int, int)':
walk.cpp:14:17: warning: statement has no effect [-Wunused-value]
   14 | #define DE(...) 0
      |                 ^
walk.cpp:167:3: note: in expansion of macro 'DE'
  167 |   DE(x, d);
      |   ^~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 113 ms 188140 KB Output is correct
2 Correct 124 ms 188104 KB Output is correct
3 Correct 103 ms 188056 KB Output is correct
4 Correct 103 ms 188100 KB Output is correct
5 Correct 104 ms 188064 KB Output is correct
6 Correct 123 ms 188160 KB Output is correct
7 Correct 106 ms 188172 KB Output is correct
8 Correct 117 ms 188116 KB Output is correct
9 Correct 106 ms 188088 KB Output is correct
10 Correct 101 ms 188100 KB Output is correct
11 Correct 104 ms 188076 KB Output is correct
12 Correct 110 ms 188128 KB Output is correct
13 Correct 102 ms 188044 KB Output is correct
14 Correct 105 ms 188108 KB Output is correct
15 Correct 107 ms 188048 KB Output is correct
16 Correct 102 ms 188128 KB Output is correct
17 Correct 103 ms 188160 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 105 ms 188024 KB Output is correct
2 Correct 101 ms 188084 KB Output is correct
3 Correct 1030 ms 234564 KB Output is correct
4 Correct 1205 ms 245056 KB Output is correct
5 Correct 801 ms 232480 KB Output is correct
6 Correct 755 ms 228400 KB Output is correct
7 Correct 822 ms 232312 KB Output is correct
8 Correct 946 ms 239672 KB Output is correct
9 Correct 931 ms 239644 KB Output is correct
10 Correct 1232 ms 252872 KB Output is correct
11 Correct 769 ms 228488 KB Output is correct
12 Correct 513 ms 218780 KB Output is correct
13 Correct 1214 ms 252916 KB Output is correct
14 Correct 548 ms 218408 KB Output is correct
15 Correct 503 ms 212608 KB Output is correct
16 Correct 422 ms 213376 KB Output is correct
17 Correct 378 ms 211908 KB Output is correct
18 Correct 648 ms 223132 KB Output is correct
19 Correct 113 ms 189700 KB Output is correct
20 Correct 230 ms 204012 KB Output is correct
21 Correct 352 ms 209828 KB Output is correct
22 Correct 304 ms 210608 KB Output is correct
23 Correct 747 ms 220948 KB Output is correct
24 Correct 419 ms 212216 KB Output is correct
25 Correct 370 ms 210648 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 182 ms 195232 KB Output is correct
2 Correct 1307 ms 244896 KB Output is correct
3 Correct 1512 ms 249896 KB Output is correct
4 Correct 1925 ms 268084 KB Output is correct
5 Correct 2136 ms 274384 KB Output is correct
6 Correct 1878 ms 266184 KB Output is correct
7 Correct 972 ms 239620 KB Output is correct
8 Correct 595 ms 217784 KB Output is correct
9 Correct 1853 ms 261664 KB Output is correct
10 Correct 683 ms 236704 KB Output is correct
11 Correct 121 ms 192672 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 182 ms 195232 KB Output is correct
2 Correct 1307 ms 244896 KB Output is correct
3 Correct 1512 ms 249896 KB Output is correct
4 Correct 1925 ms 268084 KB Output is correct
5 Correct 2136 ms 274384 KB Output is correct
6 Correct 1878 ms 266184 KB Output is correct
7 Correct 972 ms 239620 KB Output is correct
8 Correct 595 ms 217784 KB Output is correct
9 Correct 1853 ms 261664 KB Output is correct
10 Correct 683 ms 236704 KB Output is correct
11 Correct 121 ms 192672 KB Output is correct
12 Correct 1499 ms 249800 KB Output is correct
13 Correct 1721 ms 268992 KB Output is correct
14 Correct 2268 ms 273516 KB Output is correct
15 Correct 1190 ms 241240 KB Output is correct
16 Correct 1574 ms 254896 KB Output is correct
17 Correct 1712 ms 263860 KB Output is correct
18 Correct 1312 ms 241324 KB Output is correct
19 Correct 1617 ms 254600 KB Output is correct
20 Correct 1301 ms 240240 KB Output is correct
21 Correct 369 ms 211112 KB Output is correct
22 Correct 1384 ms 248076 KB Output is correct
23 Correct 1039 ms 244072 KB Output is correct
24 Correct 763 ms 227828 KB Output is correct
25 Correct 903 ms 241368 KB Output is correct
26 Correct 511 ms 217896 KB Output is correct
27 Correct 1933 ms 272700 KB Output is correct
28 Correct 1440 ms 268400 KB Output is correct
29 Correct 1778 ms 266812 KB Output is correct
30 Correct 952 ms 240380 KB Output is correct
31 Correct 1676 ms 263412 KB Output is correct
32 Correct 503 ms 222064 KB Output is correct
33 Correct 483 ms 224388 KB Output is correct
34 Correct 632 ms 225572 KB Output is correct
35 Correct 668 ms 227776 KB Output is correct
36 Correct 477 ms 217724 KB Output is correct
37 Correct 329 ms 209864 KB Output is correct
38 Correct 320 ms 210812 KB Output is correct
39 Correct 696 ms 221080 KB Output is correct
40 Correct 371 ms 212240 KB Output is correct
41 Correct 370 ms 210968 KB Output is correct

Subtask #5
43.0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 113 ms 188140 KB Output is correct
2 Correct 124 ms 188104 KB Output is correct
3 Correct 103 ms 188056 KB Output is correct
4 Correct 103 ms 188100 KB Output is correct
5 Correct 104 ms 188064 KB Output is correct
6 Correct 123 ms 188160 KB Output is correct
7 Correct 106 ms 188172 KB Output is correct
8 Correct 117 ms 188116 KB Output is correct
9 Correct 106 ms 188088 KB Output is correct
10 Correct 101 ms 188100 KB Output is correct
11 Correct 104 ms 188076 KB Output is correct
12 Correct 110 ms 188128 KB Output is correct
13 Correct 102 ms 188044 KB Output is correct
14 Correct 105 ms 188108 KB Output is correct
15 Correct 107 ms 188048 KB Output is correct
16 Correct 102 ms 188128 KB Output is correct
17 Correct 103 ms 188160 KB Output is correct
18 Correct 105 ms 188024 KB Output is correct
19 Correct 101 ms 188084 KB Output is correct
20 Correct 1030 ms 234564 KB Output is correct
21 Correct 1205 ms 245056 KB Output is correct
22 Correct 801 ms 232480 KB Output is correct
23 Correct 755 ms 228400 KB Output is correct
24 Correct 822 ms 232312 KB Output is correct
25 Correct 946 ms 239672 KB Output is correct
26 Correct 931 ms 239644 KB Output is correct
27 Correct 1232 ms 252872 KB Output is correct
28 Correct 769 ms 228488 KB Output is correct
29 Correct 513 ms 218780 KB Output is correct
30 Correct 1214 ms 252916 KB Output is correct
31 Correct 548 ms 218408 KB Output is correct
32 Correct 503 ms 212608 KB Output is correct
33 Correct 422 ms 213376 KB Output is correct
34 Correct 378 ms 211908 KB Output is correct
35 Correct 648 ms 223132 KB Output is correct
36 Correct 113 ms 189700 KB Output is correct
37 Correct 230 ms 204012 KB Output is correct
38 Correct 352 ms 209828 KB Output is correct
39 Correct 304 ms 210608 KB Output is correct
40 Correct 747 ms 220948 KB Output is correct
41 Correct 419 ms 212216 KB Output is correct
42 Correct 370 ms 210648 KB Output is correct
43 Correct 182 ms 195232 KB Output is correct
44 Correct 1307 ms 244896 KB Output is correct
45 Correct 1512 ms 249896 KB Output is correct
46 Correct 1925 ms 268084 KB Output is correct
47 Correct 2136 ms 274384 KB Output is correct
48 Correct 1878 ms 266184 KB Output is correct
49 Correct 972 ms 239620 KB Output is correct
50 Correct 595 ms 217784 KB Output is correct
51 Correct 1853 ms 261664 KB Output is correct
52 Correct 683 ms 236704 KB Output is correct
53 Correct 121 ms 192672 KB Output is correct
54 Correct 1499 ms 249800 KB Output is correct
55 Correct 1721 ms 268992 KB Output is correct
56 Correct 2268 ms 273516 KB Output is correct
57 Correct 1190 ms 241240 KB Output is correct
58 Correct 1574 ms 254896 KB Output is correct
59 Correct 1712 ms 263860 KB Output is correct
60 Correct 1312 ms 241324 KB Output is correct
61 Correct 1617 ms 254600 KB Output is correct
62 Correct 1301 ms 240240 KB Output is correct
63 Correct 369 ms 211112 KB Output is correct
64 Correct 1384 ms 248076 KB Output is correct
65 Correct 1039 ms 244072 KB Output is correct
66 Correct 763 ms 227828 KB Output is correct
67 Correct 903 ms 241368 KB Output is correct
68 Correct 511 ms 217896 KB Output is correct
69 Correct 1933 ms 272700 KB Output is correct
70 Correct 1440 ms 268400 KB Output is correct
71 Correct 1778 ms 266812 KB Output is correct
72 Correct 952 ms 240380 KB Output is correct
73 Correct 1676 ms 263412 KB Output is correct
74 Correct 503 ms 222064 KB Output is correct
75 Correct 483 ms 224388 KB Output is correct
76 Correct 632 ms 225572 KB Output is correct
77 Correct 668 ms 227776 KB Output is correct
78 Correct 477 ms 217724 KB Output is correct
79 Correct 329 ms 209864 KB Output is correct
80 Correct 320 ms 210812 KB Output is correct
81 Correct 696 ms 221080 KB Output is correct
82 Correct 371 ms 212240 KB Output is correct
83 Correct 370 ms 210968 KB Output is correct
84 Correct 176 ms 194732 KB Output is correct
85 Correct 1350 ms 249756 KB Output is correct
86 Correct 2059 ms 272200 KB Output is correct
87 Correct 261 ms 210792 KB Output is correct
88 Correct 293 ms 212936 KB Output is correct
89 Correct 262 ms 210796 KB Output is correct
90 Correct 141 ms 191844 KB Output is correct
91 Correct 109 ms 188356 KB Output is correct
92 Correct 150 ms 192368 KB Output is correct
93 Correct 762 ms 228296 KB Output is correct
94 Correct 314 ms 210684 KB Output is correct
95 Correct 1311 ms 249196 KB Output is correct
96 Correct 1091 ms 243108 KB Output is correct
97 Correct 879 ms 226552 KB Output is correct
98 Correct 1164 ms 239964 KB Output is correct
99 Correct 2206 ms 271340 KB Output is correct
100 Correct 1759 ms 268320 KB Output is correct
101 Correct 1777 ms 264784 KB Output is correct
102 Correct 864 ms 239808 KB Output is correct
103 Correct 550 ms 222564 KB Output is correct
104 Correct 571 ms 223936 KB Output is correct
105 Correct 714 ms 227164 KB Output is correct
106 Correct 636 ms 223424 KB Output is correct
107 Correct 656 ms 217368 KB Output is correct
108 Correct 219 ms 194580 KB Output is correct
109 Correct 1867 ms 254736 KB Output is correct
110 Correct 1749 ms 261604 KB Output is correct
111 Correct 1716 ms 266644 KB Output is correct
112 Correct 723 ms 227216 KB Output is correct
113 Correct 682 ms 223436 KB Output is correct