oj.uz

Submission #287275

# Submission time Handle Problem Language Result Execution time Memory
287275 2020-08-31T14:46:41 Z ScarletS New Home (APIO18_new_home) C++17
0 / 100
 5000 ms 16920 KB 
#include <bits/stdc++.h>
#define ll long long
#define sz(x) (int)(x).size();
#define pii pair<int,int>
#define f first
#define s second
using namespace std;

const int MAXN=3e5+7;
int n,k,x,y,ans,INF=1e9,l,r,m;
pair<pii,pii> a[MAXN];
vector<int> present[MAXN];

ll solve()
{
	ans=0;
	cin>>x>>y;
	for (int i=1;i<=k;++i)
		present[i].clear();
	for (int i=0;i<n;++i)
		if (a[i].s.f<=y&&y<=a[i].s.s)
		{
			present[a[i].f.s].push_back(a[i].f.f);
			//cout<<a[i].f.f<<" ";
		}
	//cout<<"\n";
	for (int i=1;i<=k;++i)
	{
		l=0;r=sz(present[i]);
		if (!r)
			return -1;
		if (x<=present[i][0])
		{
			ans=max(ans,abs(present[i][0]-x));
			continue;
		}
		while (l<r)
		{
			m=l+((r-l)>>1);
			if (present[i][m]<x)
				l=m+1;
			else
				r=m;
		}
		ans=max(ans,min(abs(present[i][l]-x),abs(x-present[i][l-1])));
	}
	return ans;
}

int main()
{
	int q;
	cin>>n>>k>>q;
	for (int i=0;i<n;++i)
		cin>>a[i].f.f>>a[i].f.s>>a[i].s.f>>a[i].s.s;
	sort(a,a+n);
	while (q--)
		cout<<solve()<<"\n";
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7424 KB Output is correct
2 Correct 5 ms 7424 KB Output is correct
3 Correct 7 ms 7424 KB Output is correct
4 Incorrect 5 ms 7424 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 5010 ms 16920 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 5019 ms 15612 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

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

Subtask #6
0 / 20.0

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