Submission #417200

# Submission time Handle Problem Language Result Execution time Memory
417200 2021-06-03T12:56:14 Z pavement Event Hopping 2 (JOI21_event2) C++17
1 / 100
80 ms 1832 KB
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
#define int long long
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define g0(a) get<0>(a)
#define g1(a) get<1>(a)
#define g2(a) get<2>(a)
#define g3(a) get<3>(a)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef double db;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tree<iii, null_type, greater<iii>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

int N, K, L[500005], R[500005];
vector<int> ans;

main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> N >> K;
	for (int i = 1; i <= N; i++) cin >> L[i] >> R[i];
	for (int i = 0; i < (1 << N); i++) {
		if (__builtin_popcountll(i) != K) continue;
		vector<iii> tmp;
		for (int j = 0; j < N; j++)
			if (i & (1 << j)) tmp.eb(L[j + 1], R[j + 1], j + 1);
		sort(tmp.begin(), tmp.end());
		bool inv = 0;
		for (int i = 1; i < tmp.size(); i++)
			if (g0(tmp[i]) < g1(tmp[i - 1])) inv = 1;
		if (!inv) {
			vector<int> out;
			for (int i = 0; i < tmp.size(); i++) out.pb(g2(tmp[i]));
			sort(out.begin(), out.end());
			if (ans.empty()) ans = out;
			else ans = min(ans, out);
		}
	}
	if (ans.empty()) cout << "-1\n";
	else for (int i : ans) cout << i << '\n';
}

Compilation message

event2.cpp:31:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   31 | main() {
      | ^~~~
event2.cpp: In function 'int main()':
event2.cpp:43:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::tuple<long long int, long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |   for (int i = 1; i < tmp.size(); i++)
      |                   ~~^~~~~~~~~~~~
event2.cpp:47:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::tuple<long long int, long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |    for (int i = 0; i < tmp.size(); i++) out.pb(g2(tmp[i]));
      |                    ~~^~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Incorrect 24 ms 1832 KB Output isn't correct
5 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 2 ms 204 KB Output is correct
5 Correct 2 ms 204 KB Output is correct
6 Correct 4 ms 204 KB Output is correct
7 Correct 8 ms 332 KB Output is correct
8 Correct 8 ms 332 KB Output is correct
9 Correct 4 ms 332 KB Output is correct
10 Correct 4 ms 204 KB Output is correct
11 Correct 61 ms 312 KB Output is correct
12 Correct 5 ms 328 KB Output is correct
13 Correct 5 ms 332 KB Output is correct
14 Correct 5 ms 204 KB Output is correct
15 Correct 4 ms 332 KB Output is correct
16 Correct 62 ms 312 KB Output is correct
17 Correct 43 ms 384 KB Output is correct
18 Correct 8 ms 332 KB Output is correct
19 Correct 32 ms 312 KB Output is correct
20 Correct 80 ms 204 KB Output is correct
21 Correct 5 ms 332 KB Output is correct
22 Correct 16 ms 332 KB Output is correct
23 Correct 55 ms 312 KB Output is correct
24 Correct 4 ms 332 KB Output is correct
25 Correct 4 ms 204 KB Output is correct
26 Correct 4 ms 332 KB Output is correct
27 Correct 6 ms 332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 2 ms 204 KB Output is correct
5 Correct 2 ms 204 KB Output is correct
6 Correct 4 ms 204 KB Output is correct
7 Correct 8 ms 332 KB Output is correct
8 Correct 8 ms 332 KB Output is correct
9 Correct 4 ms 332 KB Output is correct
10 Correct 4 ms 204 KB Output is correct
11 Correct 61 ms 312 KB Output is correct
12 Correct 5 ms 328 KB Output is correct
13 Correct 5 ms 332 KB Output is correct
14 Correct 5 ms 204 KB Output is correct
15 Correct 4 ms 332 KB Output is correct
16 Correct 62 ms 312 KB Output is correct
17 Correct 43 ms 384 KB Output is correct
18 Correct 8 ms 332 KB Output is correct
19 Correct 32 ms 312 KB Output is correct
20 Correct 80 ms 204 KB Output is correct
21 Correct 5 ms 332 KB Output is correct
22 Correct 16 ms 332 KB Output is correct
23 Correct 55 ms 312 KB Output is correct
24 Correct 4 ms 332 KB Output is correct
25 Correct 4 ms 204 KB Output is correct
26 Correct 4 ms 332 KB Output is correct
27 Correct 6 ms 332 KB Output is correct
28 Incorrect 65 ms 364 KB Output isn't correct
29 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Incorrect 24 ms 1832 KB Output isn't correct
5 Halted 0 ms 0 KB -