oj.uz

Submission #776890

# Submission time Handle Problem Language Result Execution time Memory
776890 2023-07-08T11:19:10 Z marvinthang Event Hopping 2 (JOI21_event2) C++17
100 / 100
 145 ms 24392 KB 
/*************************************
*    author: marvinthang             *
*    created: 08.07.2023 18:03:51    *
*************************************/

#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;
const int LOG = 20;

int N, K, L[MAX], R[MAX], nxt[MAX][LOG];

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

int countSeg(int l, int r) {
	int res = 0;
	REPD(i, LOG) if (nxt[l][i] <= r) {
		res ^= MASK(i);
		l = nxt[l][i];
	}
	return res;
}

void process(void) {
	vector <int> v;
	REP(i, N) {
		v.push_back(L[i]);
		v.push_back(R[i]);
	}
	sort(ALL(v));
	v.erase(unique(ALL(v)), v.end());
	REP(i, v.size() + 1) nxt[i][0] = v.size();
	REP(i, N) {
		L[i] = lower_bound(ALL(v), L[i]) - v.begin();
		R[i] = lower_bound(ALL(v), R[i]) - v.begin();
		minimize(nxt[L[i]][0], R[i]);
	}
	REPD(i, v.size()) minimize(nxt[i][0], nxt[i + 1][0]);
	FOR(k, 1, LOG) REP(i, v.size() + 1) nxt[i][k] = nxt[nxt[i][k - 1]][k - 1];
	int cnt = countSeg(0, (int) v.size() - 1);
	if (cnt < K) return void(cout << "-1\n");
	map <int, int> mp;
	mp[0] = mp[(int) v.size() - 1] = 0;
	int sz = K;
	REP(i, N) {
		auto it = mp.lower_bound(R[i]);
		int l = prev(it)->se;
		int r = it->fi;
		if (l > L[i]) continue;
		int add = countSeg(l, L[i]) + 1 + countSeg(R[i], r) - countSeg(l, r);
		if (cnt + add >= K) {
			cout << i + 1 << '\n';
			cnt += add;
			mp[L[i]] = R[i];
			if (!--sz) return;
		}
	}
}

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

Compilation message

event2.cpp: In function 'int main()':
event2.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); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
event2.cpp:104:2: note: in expansion of macro 'file'
  104 |  file("event2");
      |  ^~~~
event2.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); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
event2.cpp:104:2: note: in expansion of macro 'file'
  104 |  file("event2");
      |  ^~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 92 ms 24352 KB Output is correct
5 Correct 91 ms 24120 KB Output is correct
6 Correct 90 ms 23828 KB Output is correct
7 Correct 84 ms 23408 KB Output is correct
8 Correct 92 ms 24392 KB Output is correct
9 Correct 90 ms 24092 KB Output is correct
10 Correct 88 ms 23828 KB Output is correct
11 Correct 82 ms 23420 KB Output is correct
12 Correct 83 ms 22512 KB Output is correct
13 Correct 80 ms 22372 KB Output is correct
14 Correct 78 ms 22120 KB Output is correct
15 Correct 75 ms 21792 KB Output is correct
16 Correct 69 ms 20124 KB Output is correct
17 Correct 63 ms 20012 KB Output is correct
18 Correct 61 ms 20036 KB Output is correct
19 Correct 56 ms 19536 KB Output is correct
20 Correct 56 ms 19584 KB Output is correct
21 Correct 64 ms 19688 KB Output is correct
22 Correct 62 ms 19612 KB Output is correct
23 Correct 56 ms 19604 KB Output is correct
24 Correct 56 ms 19536 KB Output is correct
25 Correct 60 ms 19592 KB Output is correct
26 Correct 74 ms 19540 KB Output is correct
27 Correct 69 ms 19632 KB Output is correct
28 Correct 47 ms 19572 KB Output is correct
29 Correct 49 ms 19512 KB Output is correct
30 Correct 50 ms 19536 KB Output is correct
31 Correct 51 ms 19592 KB Output is correct
32 Correct 58 ms 19604 KB Output is correct
33 Correct 59 ms 19536 KB Output is correct
34 Correct 67 ms 21200 KB Output is correct
35 Correct 63 ms 20644 KB Output is correct
36 Correct 53 ms 20008 KB Output is correct
37 Correct 77 ms 22008 KB Output is correct
38 Correct 70 ms 21964 KB Output is correct
39 Correct 73 ms 21928 KB Output is correct
40 Correct 69 ms 21708 KB Output is correct
41 Correct 73 ms 21684 KB Output is correct
42 Correct 57 ms 19548 KB Output is correct
43 Correct 81 ms 21940 KB Output is correct
44 Correct 89 ms 21928 KB Output is correct
45 Correct 77 ms 21768 KB Output is correct
46 Correct 81 ms 21628 KB Output is correct

Subtask #2
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 0 ms 328 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 0 ms 328 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 0 ms 328 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 0 ms 328 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 2 ms 860 KB Output is correct
29 Correct 2 ms 852 KB Output is correct
30 Correct 3 ms 920 KB Output is correct
31 Correct 2 ms 852 KB Output is correct
32 Correct 2 ms 852 KB Output is correct
33 Correct 2 ms 1044 KB Output is correct
34 Correct 2 ms 852 KB Output is correct
35 Correct 3 ms 980 KB Output is correct
36 Correct 3 ms 980 KB Output is correct
37 Correct 3 ms 980 KB Output is correct
38 Correct 2 ms 856 KB Output is correct
39 Correct 3 ms 980 KB Output is correct
40 Correct 3 ms 984 KB Output is correct
41 Correct 4 ms 980 KB Output is correct
42 Correct 2 ms 852 KB Output is correct
43 Correct 2 ms 932 KB Output is correct
44 Correct 3 ms 852 KB Output is correct
45 Correct 2 ms 852 KB Output is correct
46 Correct 2 ms 852 KB Output is correct
47 Correct 2 ms 852 KB Output is correct
48 Correct 2 ms 852 KB Output is correct
49 Correct 3 ms 852 KB Output is correct
50 Correct 2 ms 852 KB Output is correct
51 Correct 3 ms 852 KB Output is correct
52 Correct 2 ms 896 KB Output is correct
53 Correct 2 ms 852 KB Output is correct
54 Correct 3 ms 852 KB Output is correct
55 Correct 4 ms 724 KB Output is correct
56 Correct 4 ms 852 KB Output is correct
57 Correct 2 ms 728 KB Output is correct
58 Correct 2 ms 724 KB Output is correct
59 Correct 3 ms 724 KB Output is correct
60 Correct 2 ms 724 KB Output is correct
61 Correct 2 ms 732 KB Output is correct
62 Correct 2 ms 724 KB Output is correct
63 Correct 3 ms 724 KB Output is correct
64 Correct 1 ms 728 KB Output is correct

Subtask #4
61.0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 92 ms 24352 KB Output is correct
5 Correct 91 ms 24120 KB Output is correct
6 Correct 90 ms 23828 KB Output is correct
7 Correct 84 ms 23408 KB Output is correct
8 Correct 92 ms 24392 KB Output is correct
9 Correct 90 ms 24092 KB Output is correct
10 Correct 88 ms 23828 KB Output is correct
11 Correct 82 ms 23420 KB Output is correct
12 Correct 83 ms 22512 KB Output is correct
13 Correct 80 ms 22372 KB Output is correct
14 Correct 78 ms 22120 KB Output is correct
15 Correct 75 ms 21792 KB Output is correct
16 Correct 69 ms 20124 KB Output is correct
17 Correct 63 ms 20012 KB Output is correct
18 Correct 61 ms 20036 KB Output is correct
19 Correct 56 ms 19536 KB Output is correct
20 Correct 56 ms 19584 KB Output is correct
21 Correct 64 ms 19688 KB Output is correct
22 Correct 62 ms 19612 KB Output is correct
23 Correct 56 ms 19604 KB Output is correct
24 Correct 56 ms 19536 KB Output is correct
25 Correct 60 ms 19592 KB Output is correct
26 Correct 74 ms 19540 KB Output is correct
27 Correct 69 ms 19632 KB Output is correct
28 Correct 47 ms 19572 KB Output is correct
29 Correct 49 ms 19512 KB Output is correct
30 Correct 50 ms 19536 KB Output is correct
31 Correct 51 ms 19592 KB Output is correct
32 Correct 58 ms 19604 KB Output is correct
33 Correct 59 ms 19536 KB Output is correct
34 Correct 67 ms 21200 KB Output is correct
35 Correct 63 ms 20644 KB Output is correct
36 Correct 53 ms 20008 KB Output is correct
37 Correct 77 ms 22008 KB Output is correct
38 Correct 70 ms 21964 KB Output is correct
39 Correct 73 ms 21928 KB Output is correct
40 Correct 69 ms 21708 KB Output is correct
41 Correct 73 ms 21684 KB Output is correct
42 Correct 57 ms 19548 KB Output is correct
43 Correct 81 ms 21940 KB Output is correct
44 Correct 89 ms 21928 KB Output is correct
45 Correct 77 ms 21768 KB Output is correct
46 Correct 81 ms 21628 KB Output is correct
47 Correct 0 ms 340 KB Output is correct
48 Correct 0 ms 328 KB Output is correct
49 Correct 0 ms 340 KB Output is correct
50 Correct 0 ms 340 KB Output is correct
51 Correct 0 ms 332 KB Output is correct
52 Correct 0 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 0 ms 340 KB Output is correct
58 Correct 1 ms 336 KB Output is correct
59 Correct 0 ms 340 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 1 ms 340 KB Output is correct
62 Correct 0 ms 340 KB Output is correct
63 Correct 0 ms 340 KB Output is correct
64 Correct 1 ms 340 KB Output is correct
65 Correct 0 ms 340 KB Output is correct
66 Correct 1 ms 340 KB Output is correct
67 Correct 0 ms 340 KB Output is correct
68 Correct 1 ms 340 KB Output is correct
69 Correct 0 ms 328 KB Output is correct
70 Correct 1 ms 332 KB Output is correct
71 Correct 0 ms 328 KB Output is correct
72 Correct 0 ms 340 KB Output is correct
73 Correct 1 ms 340 KB Output is correct
74 Correct 2 ms 860 KB Output is correct
75 Correct 2 ms 852 KB Output is correct
76 Correct 3 ms 920 KB Output is correct
77 Correct 2 ms 852 KB Output is correct
78 Correct 2 ms 852 KB Output is correct
79 Correct 2 ms 1044 KB Output is correct
80 Correct 2 ms 852 KB Output is correct
81 Correct 3 ms 980 KB Output is correct
82 Correct 3 ms 980 KB Output is correct
83 Correct 3 ms 980 KB Output is correct
84 Correct 2 ms 856 KB Output is correct
85 Correct 3 ms 980 KB Output is correct
86 Correct 3 ms 984 KB Output is correct
87 Correct 4 ms 980 KB Output is correct
88 Correct 2 ms 852 KB Output is correct
89 Correct 2 ms 932 KB Output is correct
90 Correct 3 ms 852 KB Output is correct
91 Correct 2 ms 852 KB Output is correct
92 Correct 2 ms 852 KB Output is correct
93 Correct 2 ms 852 KB Output is correct
94 Correct 2 ms 852 KB Output is correct
95 Correct 3 ms 852 KB Output is correct
96 Correct 2 ms 852 KB Output is correct
97 Correct 3 ms 852 KB Output is correct
98 Correct 2 ms 896 KB Output is correct
99 Correct 2 ms 852 KB Output is correct
100 Correct 3 ms 852 KB Output is correct
101 Correct 4 ms 724 KB Output is correct
102 Correct 4 ms 852 KB Output is correct
103 Correct 2 ms 728 KB Output is correct
104 Correct 2 ms 724 KB Output is correct
105 Correct 3 ms 724 KB Output is correct
106 Correct 2 ms 724 KB Output is correct
107 Correct 2 ms 732 KB Output is correct
108 Correct 2 ms 724 KB Output is correct
109 Correct 3 ms 724 KB Output is correct
110 Correct 1 ms 728 KB Output is correct
111 Correct 78 ms 19528 KB Output is correct
112 Correct 78 ms 19588 KB Output is correct
113 Correct 88 ms 19488 KB Output is correct
114 Correct 74 ms 19532 KB Output is correct
115 Correct 73 ms 19608 KB Output is correct
116 Correct 73 ms 19516 KB Output is correct
117 Correct 87 ms 19524 KB Output is correct
118 Correct 145 ms 24324 KB Output is correct
119 Correct 131 ms 23808 KB Output is correct
120 Correct 131 ms 21900 KB Output is correct
121 Correct 71 ms 19528 KB Output is correct
122 Correct 130 ms 22408 KB Output is correct
123 Correct 130 ms 22180 KB Output is correct
124 Correct 120 ms 21796 KB Output is correct
125 Correct 81 ms 19580 KB Output is correct
126 Correct 89 ms 20040 KB Output is correct
127 Correct 87 ms 20032 KB Output is correct
128 Correct 88 ms 19908 KB Output is correct
129 Correct 76 ms 19524 KB Output is correct
130 Correct 81 ms 19616 KB Output is correct
131 Correct 79 ms 19524 KB Output is correct
132 Correct 87 ms 19616 KB Output is correct
133 Correct 71 ms 19528 KB Output is correct
134 Correct 93 ms 19588 KB Output is correct
135 Correct 87 ms 19512 KB Output is correct
136 Correct 74 ms 19532 KB Output is correct
137 Correct 78 ms 19576 KB Output is correct
138 Correct 76 ms 19580 KB Output is correct
139 Correct 75 ms 19536 KB Output is correct
140 Correct 72 ms 19612 KB Output is correct
141 Correct 73 ms 19596 KB Output is correct
142 Correct 78 ms 16920 KB Output is correct
143 Correct 77 ms 16924 KB Output is correct
144 Correct 90 ms 16916 KB Output is correct
145 Correct 66 ms 16892 KB Output is correct
146 Correct 67 ms 16836 KB Output is correct
147 Correct 64 ms 16716 KB Output is correct
148 Correct 73 ms 16720 KB Output is correct
149 Correct 64 ms 16452 KB Output is correct
150 Correct 70 ms 16348 KB Output is correct
151 Correct 71 ms 15900 KB Output is correct
152 Correct 32 ms 11828 KB Output is correct
153 Correct 66 ms 16928 KB Output is correct
154 Correct 70 ms 16788 KB Output is correct
155 Correct 76 ms 16688 KB Output is correct
156 Correct 63 ms 16576 KB Output is correct
157 Correct 62 ms 16464 KB Output is correct
158 Correct 63 ms 16328 KB Output is correct
159 Correct 62 ms 15900 KB Output is correct
160 Correct 32 ms 11836 KB Output is correct
161 Correct 92 ms 18124 KB Output is correct
162 Correct 90 ms 18064 KB Output is correct
163 Correct 85 ms 18000 KB Output is correct
164 Correct 91 ms 17884 KB Output is correct
165 Correct 84 ms 17760 KB Output is correct
166 Correct 69 ms 19516 KB Output is correct
167 Correct 77 ms 21920 KB Output is correct
168 Correct 77 ms 21828 KB Output is correct
169 Correct 74 ms 21788 KB Output is correct
170 Correct 76 ms 21644 KB Output is correct
171 Correct 80 ms 21448 KB Output is correct
172 Correct 70 ms 22064 KB Output is correct
173 Correct 99 ms 14276 KB Output is correct
174 Correct 87 ms 14232 KB Output is correct
175 Correct 85 ms 14208 KB Output is correct
176 Correct 78 ms 13760 KB Output is correct