oj.uz

Submission #698666

# Submission time Handle Problem Language Result Execution time Memory
698666 2023-02-14T07:25:02 Z vjudge1 New Home (APIO18_new_home) C++17
0 / 100
 5000 ms 14836 KB 
#include <bits/stdc++.h>
#include <array>
#define all(v) (v.begin()), (v.end())
#define setall(a, val) for(auto& x : a) x = val
#define ll long long
clock_t start_time;
double get_time() { return (double)(clock() - start_time) / CLOCKS_PER_SEC; }
void init() {
#ifndef ONLINE_JUDGE
	FILE* _ = freopen("in.txt", "r", stdin);
	start_time = clock();
#endif
}
const ll MOD = 998244353;
const ll N = 6e5 + 1;
const ll M = 2e2 + 1;
using namespace std;
//####################################################################################

int main() {
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); srand(time(0)); //init();

	int n, k, q;
	cin >> n >> k >> q;
	vector< vector< array<ll, 3> > > v(k + 1);
	for (int i = 0; i < n; i++) {
		ll x, t, a, b;
		cin >> x >> t >> a >> b;
		v[t].push_back({ x, a, b });
	}

	for (int i = 1; i <= k; i++)
		sort(all(v[i]));
	
	while (q--) {
		ll x, y;
		cin >> x >> y;
		ll mx = 0;
		for (int i = 1; i <= k; i++) {
			ll cur = LLONG_MAX;
			for (array<ll, 3>& ar : v[i]) {
				if (ar[1] <= y && y <= ar[2]) {
					cur = abs(x - ar[0]);
					break;
				}
			}
			if (cur == LLONG_MAX)
				mx = -1, i = k + 1;
			else
				mx = max(mx, cur);
		}
		cout << mx << endl;
	}

	cerr << get_time() << "s" << endl;
}

Compilation message

new_home.cpp: In function 'void init()':
new_home.cpp:10:8: warning: unused variable '_' [-Wunused-variable]
   10 |  FILE* _ = freopen("in.txt", "r", stdin);
      |        ^

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Incorrect 0 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Incorrect 0 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5086 ms 14836 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 5078 ms 12932 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 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Incorrect 0 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Incorrect 0 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -