제출 #945837

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
945837		kxd	새 집 (APIO18_new_home)	C++17	5 / 100	5058 ms	18708 KiB

new_home

#include <bits/stdc++.h>
//#define DEBUG 1106
#define int long long
#define ll long long
#define ld long double
#define pb push_back
#define p_q priority_queue
#define m_p make_pair
#define pii pair<int,int>
#define endl '\n'
#define INIT ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define FOR(i,a,b) for(int i = a; i <= b; i++)
#define forn(i,n) for (int i = 0; i < n; i++)
#define forn1(i,n) for (int i = 1; i <= n; i++)
#define all(x) x.begin(),x.end()
#define ft first
#define sd second
#define lowbit(x) (x&(-x))
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
#ifdef DEBUG
#define debug(x) cout << #x << ": " << x << endl;
#else
#define debug(x) 1106;
#endif

using namespace std;
const int N = 2e5+5;
const int inf = 1e9;
const int INF = 1e18;
const int MOD = 1e9+7;

int x[N],t[N],a[N],b[N];

signed main() {
	INIT
	#ifdef DEBUG
	freopen("input.txt", "r", stdin);
	#endif
	///////////
	int n, k, q;
	cin >> n >> k >> q;
	forn(i,n) {
		cin >> x[i] >> t[i] >> a[i] >> b[i];
	}
	while(q--) {
		int l, y;
		cin >> l >> y;
		int ans = 0;
		forn1(i,k) {
			int m = inf;
			forn(j,n) {
				if(t[j]==i && a[j]<=y&&y<=b[j]) chmin(m, abs(x[j]-l));
			}
			if(m==inf) {
				ans = -1; break;
			}
			chmax(ans,m);
		}
		cout << ans << endl;
	}
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 7
• Subtask 3: 0 / 10
• Subtask 4: 0 / 23
• Subtask 5: 0 / 35
• Subtask 6: 0 / 20