Submission #876059

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
876059	2023-11-21T07:41:23 Z	marvinthang	New Home (APIO18_new_home)	C++17	12 / 100	5000 ms	47580 KB

new_home

/*************************************
*    author: marvinthang             *
*    created: 21.11.2023 14:25:44    *
*************************************/

#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-- > 0; )
#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 << '}'; }

// end of template

const int INF = 1e9;

struct Store {
	int x, t, a, b;
	Store(int x, int t, int a, int b): x(x), t(t), a(a), b(b) {}
};

void process(void) {
	int n, q, k; cin >> n >> k >> q;
	vector <Store> stores;
	REP(i, n) {
		int x, t, a, b; cin >> x >> t >> a >> b;
		stores.emplace_back(x, t - 1, a, b);
	}
	vector <pair <int, int>> queries(q); cin >> queries;

	vector <pair <int, int>> events;
	REP(i, n) {
		events.emplace_back(stores[i].a, i);
		events.emplace_back(stores[i].b + 1, i);
	}
	REP(i, q) events.emplace_back(queries[i].se, i + n);
	sort(ALL(events));

	vector <multiset <int>> pos(k);
	vector <int> res(q);
	for (auto [y, i]: events) {
		if (i < n) {
			if (y == stores[i].a) pos[stores[i].t].insert(stores[i].x);
			else pos[stores[i].t].erase(pos[stores[i].t].find(stores[i].x));
		} else {
			i -= n;
			REP(t, k) {
				int cur = INF;
				auto p = pos[t].lower_bound(queries[i].fi);
				if (p != pos[t].end()) cur = min(cur, *p - queries[i].fi);
				if (p != pos[t].begin()) cur = min(cur, queries[i].fi - *prev(p));
				if (cur == INF) {
					res[i] = -1;
					break;
				}
				res[i] = max(res[i], cur);
			}
		}
	}
	REP(i, q) cout << res[i] << '\n';
}

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

Compilation message

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

Subtask #1
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	464 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	468 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	468 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	352 KB	Output is correct
13	Correct	1 ms	464 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	464 KB	Output is correct
16	Correct	1 ms	524 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	476 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	524 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	356 KB	Output is correct
23	Correct	1 ms	356 KB	Output is correct
24	Correct	1 ms	352 KB	Output is correct
25	Correct	1 ms	356 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	1 ms	356 KB	Output is correct
28	Correct	1 ms	356 KB	Output is correct
29	Correct	1 ms	356 KB	Output is correct
30	Correct	1 ms	496 KB	Output is correct

Subtask #2
7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	464 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	468 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	468 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	352 KB	Output is correct
13	Correct	1 ms	464 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	464 KB	Output is correct
16	Correct	1 ms	524 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	476 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	524 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	356 KB	Output is correct
23	Correct	1 ms	356 KB	Output is correct
24	Correct	1 ms	352 KB	Output is correct
25	Correct	1 ms	356 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	1 ms	356 KB	Output is correct
28	Correct	1 ms	356 KB	Output is correct
29	Correct	1 ms	356 KB	Output is correct
30	Correct	1 ms	496 KB	Output is correct
31	Correct	1546 ms	9556 KB	Output is correct
32	Correct	68 ms	5708 KB	Output is correct
33	Correct	121 ms	7676 KB	Output is correct
34	Correct	1191 ms	7792 KB	Output is correct
35	Correct	681 ms	9500 KB	Output is correct
36	Correct	142 ms	9544 KB	Output is correct
37	Correct	110 ms	6988 KB	Output is correct
38	Correct	68 ms	6740 KB	Output is correct
39	Correct	58 ms	6736 KB	Output is correct
40	Correct	56 ms	6736 KB	Output is correct
41	Correct	182 ms	6976 KB	Output is correct
42	Correct	145 ms	6988 KB	Output is correct
43	Correct	155 ms	9192 KB	Output is correct
44	Correct	155 ms	7192 KB	Output is correct
45	Correct	80 ms	6928 KB	Output is correct
46	Correct	50 ms	6740 KB	Output is correct
47	Correct	45 ms	6748 KB	Output is correct
48	Correct	44 ms	6740 KB	Output is correct
49	Correct	54 ms	6740 KB	Output is correct
50	Correct	126 ms	6856 KB	Output is correct
51	Correct	49 ms	6556 KB	Output is correct

Subtask #3
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	5093 ms	47580 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #4
0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	5027 ms	44592 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #5
0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	464 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	468 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	468 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	352 KB	Output is correct
13	Correct	1 ms	464 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	464 KB	Output is correct
16	Correct	1 ms	524 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	476 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	524 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	356 KB	Output is correct
23	Correct	1 ms	356 KB	Output is correct
24	Correct	1 ms	352 KB	Output is correct
25	Correct	1 ms	356 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	1 ms	356 KB	Output is correct
28	Correct	1 ms	356 KB	Output is correct
29	Correct	1 ms	356 KB	Output is correct
30	Correct	1 ms	496 KB	Output is correct
31	Correct	1546 ms	9556 KB	Output is correct
32	Correct	68 ms	5708 KB	Output is correct
33	Correct	121 ms	7676 KB	Output is correct
34	Correct	1191 ms	7792 KB	Output is correct
35	Correct	681 ms	9500 KB	Output is correct
36	Correct	142 ms	9544 KB	Output is correct
37	Correct	110 ms	6988 KB	Output is correct
38	Correct	68 ms	6740 KB	Output is correct
39	Correct	58 ms	6736 KB	Output is correct
40	Correct	56 ms	6736 KB	Output is correct
41	Correct	182 ms	6976 KB	Output is correct
42	Correct	145 ms	6988 KB	Output is correct
43	Correct	155 ms	9192 KB	Output is correct
44	Correct	155 ms	7192 KB	Output is correct
45	Correct	80 ms	6928 KB	Output is correct
46	Correct	50 ms	6740 KB	Output is correct
47	Correct	45 ms	6748 KB	Output is correct
48	Correct	44 ms	6740 KB	Output is correct
49	Correct	54 ms	6740 KB	Output is correct
50	Correct	126 ms	6856 KB	Output is correct
51	Correct	49 ms	6556 KB	Output is correct
52	Correct	53 ms	12224 KB	Output is correct
53	Correct	48 ms	10628 KB	Output is correct
54	Correct	95 ms	10312 KB	Output is correct
55	Execution timed out	5037 ms	8436 KB	Time limit exceeded
56	Halted	0 ms	0 KB	-

Subtask #6
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	464 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	468 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	468 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	352 KB	Output is correct
13	Correct	1 ms	464 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	464 KB	Output is correct
16	Correct	1 ms	524 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	476 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	524 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	356 KB	Output is correct
23	Correct	1 ms	356 KB	Output is correct
24	Correct	1 ms	352 KB	Output is correct
25	Correct	1 ms	356 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	1 ms	356 KB	Output is correct
28	Correct	1 ms	356 KB	Output is correct
29	Correct	1 ms	356 KB	Output is correct
30	Correct	1 ms	496 KB	Output is correct
31	Correct	1546 ms	9556 KB	Output is correct
32	Correct	68 ms	5708 KB	Output is correct
33	Correct	121 ms	7676 KB	Output is correct
34	Correct	1191 ms	7792 KB	Output is correct
35	Correct	681 ms	9500 KB	Output is correct
36	Correct	142 ms	9544 KB	Output is correct
37	Correct	110 ms	6988 KB	Output is correct
38	Correct	68 ms	6740 KB	Output is correct
39	Correct	58 ms	6736 KB	Output is correct
40	Correct	56 ms	6736 KB	Output is correct
41	Correct	182 ms	6976 KB	Output is correct
42	Correct	145 ms	6988 KB	Output is correct
43	Correct	155 ms	9192 KB	Output is correct
44	Correct	155 ms	7192 KB	Output is correct
45	Correct	80 ms	6928 KB	Output is correct
46	Correct	50 ms	6740 KB	Output is correct
47	Correct	45 ms	6748 KB	Output is correct
48	Correct	44 ms	6740 KB	Output is correct
49	Correct	54 ms	6740 KB	Output is correct
50	Correct	126 ms	6856 KB	Output is correct
51	Correct	49 ms	6556 KB	Output is correct
52	Execution timed out	5093 ms	47580 KB	Time limit exceeded
53	Halted	0 ms	0 KB	-

Submission #876059

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 7.0 / 7.0

Subtask #3 0 / 10.0

Subtask #4 0 / 23.0

Subtask #5 0 / 35.0

Subtask #6 0 / 20.0

Subtask #1
5.0 / 5.0

Subtask #2
7.0 / 7.0

Subtask #3
0 / 10.0

Subtask #4
0 / 23.0

Subtask #5
0 / 35.0

Subtask #6
0 / 20.0