oj.uz

Submission #772978

# Submission time Handle Problem Language Result Execution time Memory
772978 2023-07-04T13:38:22 Z marvinthang Passport (JOI23_passport) C++17
100 / 100
 474 ms 88072 KB 
/*************************************
*    author: marvinthang             *
*    created: 04.07.2023 19:18:29    *
*************************************/

#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i--; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
template <class A, class B> bool minimize(A &a, B b)  { if (a > b) { a = b; return true; } return false; }
template <class A, class B> bool maximize(A &a, B b)  { if (a < b) { a = b; return true; } return false; }

// end of template

const int MAX = 2e5 + 5;

int N, Q, L[MAX], R[MAX], res[MAX];

void init(void) {
	cin >> N;
	REP(i, N) cin >> L[i] >> R[i];
}

int cur, left[MAX << 2], right[MAX << 2];
vector <pair <int, int>> adj[MAX << 2];

int build(int l, int r) {
	if (r - l == 1) return l;
	int m = l + r >> 1;
	int p = cur++;
	left[p] = build(l, m);
	right[p] = build(m, r);
	adj[left[p]].emplace_back(0, p);
	adj[right[p]].emplace_back(0, p);
	return p;
}

void add_edge(int i, int l, int r, int u, int v, int p) {
	if (l >= v || r <= u) return;
	if (u <= l && r <= v) {
		adj[i].emplace_back(1, p);
		return;
	}
	int m = l + r >> 1;
	add_edge(left[i], l, m, u, v, p);
	add_edge(right[i], m, r, u, v, p);
}

int dist[3][MAX << 2];

void bfs(int t) {
	deque <int> q;
	vector <vector <int>> cur(N);
	REP(i, N) if (dist[t][i] < N) cur[dist[t][i]].push_back(i);
	REP(d, N) {
		for (int i = 0; i < cur[d].size(); ++i) {
			int u = cur[d][i];
			if (dist[t][u] != d) continue;
			for (auto [w, v]: adj[u]) if (minimize(dist[t][v], dist[t][u] + w) && dist[t][v] < N)
				cur[dist[t][v]].push_back(v);
		}
	}
}

void process(void) {
	cur = N;
	int r = build(0, N);
	REP(i, N) add_edge(r, 0, N, L[i] - 1, R[i], i);
	queue <int> q;
	REP(i, 3) memset(dist[i], 0x3f, cur * sizeof(int));
	dist[0][0] = 0;
	bfs(0);
	dist[1][N - 1] = 0;
	bfs(1);
	REP(i, N) dist[2][i] = dist[0][i] + dist[1][i] - (i && i != N - 1);
	bfs(2);
	cin >> Q;
	while (Q--) {
		int x; cin >> x; --x;
		int res = dist[2][x];
		cout << (res > 1e9 ? -1 : res) << '\n';
	}
}

int main(void) {
	ios_base::sync_with_stdio(false); cin.tie(nullptr); // cout.tie(nullptr);
	file("passport");
	init();
	process();
	cerr << "Time elapsed: " << TIME << " s.\n";
	return (0^0);
}

Compilation message

passport.cpp: In function 'int build(int, int)':
passport.cpp:61:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   61 |  int m = l + r >> 1;
      |          ~~^~~
passport.cpp: In function 'void add_edge(int, int, int, int, int, int)':
passport.cpp:76:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   76 |  int m = l + r >> 1;
      |          ~~^~~
passport.cpp: In function 'void bfs(int)':
passport.cpp:88:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   88 |   for (int i = 0; i < cur[d].size(); ++i) {
      |                   ~~^~~~~~~~~~~~~~~
passport.cpp: In function 'int main()':
passport.cpp:30:61: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
passport.cpp:119:2: note: in expansion of macro 'file'
  119 |  file("passport");
      |  ^~~~
passport.cpp:30:94: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
passport.cpp:119:2: note: in expansion of macro 'file'
  119 |  file("passport");
      |  ^~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 19156 KB Output is correct
2 Correct 10 ms 19156 KB Output is correct
3 Correct 10 ms 19156 KB Output is correct
4 Correct 413 ms 78688 KB Output is correct
5 Correct 198 ms 57460 KB Output is correct
6 Correct 177 ms 57340 KB Output is correct
7 Correct 84 ms 50372 KB Output is correct
8 Correct 56 ms 43268 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 19152 KB Output is correct
2 Correct 9 ms 19156 KB Output is correct
3 Correct 9 ms 19116 KB Output is correct
4 Correct 9 ms 19156 KB Output is correct
5 Correct 9 ms 19156 KB Output is correct
6 Correct 10 ms 19156 KB Output is correct
7 Correct 10 ms 19056 KB Output is correct
8 Correct 10 ms 19120 KB Output is correct
9 Correct 9 ms 19120 KB Output is correct
10 Correct 9 ms 19156 KB Output is correct
11 Correct 10 ms 19156 KB Output is correct
12 Correct 10 ms 19136 KB Output is correct
13 Correct 10 ms 19156 KB Output is correct
14 Correct 10 ms 19124 KB Output is correct
15 Correct 10 ms 19128 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 19152 KB Output is correct
2 Correct 9 ms 19156 KB Output is correct
3 Correct 9 ms 19116 KB Output is correct
4 Correct 9 ms 19156 KB Output is correct
5 Correct 9 ms 19156 KB Output is correct
6 Correct 10 ms 19156 KB Output is correct
7 Correct 10 ms 19056 KB Output is correct
8 Correct 10 ms 19120 KB Output is correct
9 Correct 9 ms 19120 KB Output is correct
10 Correct 9 ms 19156 KB Output is correct
11 Correct 10 ms 19156 KB Output is correct
12 Correct 10 ms 19136 KB Output is correct
13 Correct 10 ms 19156 KB Output is correct
14 Correct 10 ms 19124 KB Output is correct
15 Correct 10 ms 19128 KB Output is correct
16 Correct 13 ms 19644 KB Output is correct
17 Correct 12 ms 19644 KB Output is correct
18 Correct 15 ms 19880 KB Output is correct
19 Correct 11 ms 19796 KB Output is correct
20 Correct 11 ms 19520 KB Output is correct
21 Correct 10 ms 19520 KB Output is correct
22 Correct 10 ms 19644 KB Output is correct
23 Correct 11 ms 19632 KB Output is correct
24 Correct 14 ms 19784 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 19152 KB Output is correct
2 Correct 9 ms 19156 KB Output is correct
3 Correct 9 ms 19116 KB Output is correct
4 Correct 9 ms 19156 KB Output is correct
5 Correct 9 ms 19156 KB Output is correct
6 Correct 10 ms 19156 KB Output is correct
7 Correct 10 ms 19056 KB Output is correct
8 Correct 10 ms 19120 KB Output is correct
9 Correct 9 ms 19120 KB Output is correct
10 Correct 9 ms 19156 KB Output is correct
11 Correct 10 ms 19156 KB Output is correct
12 Correct 10 ms 19136 KB Output is correct
13 Correct 10 ms 19156 KB Output is correct
14 Correct 10 ms 19124 KB Output is correct
15 Correct 10 ms 19128 KB Output is correct
16 Correct 13 ms 19644 KB Output is correct
17 Correct 12 ms 19644 KB Output is correct
18 Correct 15 ms 19880 KB Output is correct
19 Correct 11 ms 19796 KB Output is correct
20 Correct 11 ms 19520 KB Output is correct
21 Correct 10 ms 19520 KB Output is correct
22 Correct 10 ms 19644 KB Output is correct
23 Correct 11 ms 19632 KB Output is correct
24 Correct 14 ms 19784 KB Output is correct
25 Correct 10 ms 19156 KB Output is correct
26 Correct 9 ms 19084 KB Output is correct
27 Correct 10 ms 19772 KB Output is correct
28 Correct 10 ms 19668 KB Output is correct
29 Correct 12 ms 19648 KB Output is correct
30 Correct 11 ms 19540 KB Output is correct
31 Correct 10 ms 19572 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 19156 KB Output is correct
2 Correct 10 ms 19156 KB Output is correct
3 Correct 10 ms 19156 KB Output is correct
4 Correct 413 ms 78688 KB Output is correct
5 Correct 198 ms 57460 KB Output is correct
6 Correct 177 ms 57340 KB Output is correct
7 Correct 84 ms 50372 KB Output is correct
8 Correct 56 ms 43268 KB Output is correct
9 Correct 11 ms 19152 KB Output is correct
10 Correct 9 ms 19156 KB Output is correct
11 Correct 9 ms 19116 KB Output is correct
12 Correct 9 ms 19156 KB Output is correct
13 Correct 9 ms 19156 KB Output is correct
14 Correct 10 ms 19156 KB Output is correct
15 Correct 10 ms 19056 KB Output is correct
16 Correct 10 ms 19120 KB Output is correct
17 Correct 9 ms 19120 KB Output is correct
18 Correct 9 ms 19156 KB Output is correct
19 Correct 10 ms 19156 KB Output is correct
20 Correct 10 ms 19136 KB Output is correct
21 Correct 10 ms 19156 KB Output is correct
22 Correct 10 ms 19124 KB Output is correct
23 Correct 10 ms 19128 KB Output is correct
24 Correct 13 ms 19644 KB Output is correct
25 Correct 12 ms 19644 KB Output is correct
26 Correct 15 ms 19880 KB Output is correct
27 Correct 11 ms 19796 KB Output is correct
28 Correct 11 ms 19520 KB Output is correct
29 Correct 10 ms 19520 KB Output is correct
30 Correct 10 ms 19644 KB Output is correct
31 Correct 11 ms 19632 KB Output is correct
32 Correct 14 ms 19784 KB Output is correct
33 Correct 10 ms 19156 KB Output is correct
34 Correct 9 ms 19084 KB Output is correct
35 Correct 10 ms 19772 KB Output is correct
36 Correct 10 ms 19668 KB Output is correct
37 Correct 12 ms 19648 KB Output is correct
38 Correct 11 ms 19540 KB Output is correct
39 Correct 10 ms 19572 KB Output is correct
40 Correct 474 ms 79892 KB Output is correct
41 Correct 216 ms 60268 KB Output is correct
42 Correct 277 ms 88072 KB Output is correct
43 Correct 257 ms 86752 KB Output is correct
44 Correct 192 ms 59992 KB Output is correct
45 Correct 242 ms 64468 KB Output is correct
46 Correct 80 ms 34020 KB Output is correct
47 Correct 277 ms 63680 KB Output is correct
48 Correct 223 ms 69700 KB Output is correct