답안 #287280

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
287280	2020-08-31T14:53:06 Z	ScarletS	새 집 (APIO18_new_home)	C++17	5 / 100	5000 ms	5636 KB

new_home

#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];
int present[MAXN];

ll solve()
{
	ans=0;
	cin>>x>>y;
	for (int i=1;i<=k;++i)
		present[i]=INF;
	for (int i=0;i<n;++i)
		if (a[i].s.f<=y&&y<=a[i].s.s)
			present[a[i].f.s]=min(present[a[i].f.s],abs(x-a[i].f.f));
	for (int i=1;i<=k;++i)	
		ans=max(ans,present[i]);
	if (ans==INF)
		return -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

5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	3 ms	384 KB	Output is correct
6	Correct	4 ms	384 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	4 ms	384 KB	Output is correct
9	Correct	4 ms	384 KB	Output is correct
10	Correct	4 ms	384 KB	Output is correct
11	Correct	3 ms	384 KB	Output is correct
12	Correct	4 ms	384 KB	Output is correct
13	Correct	3 ms	384 KB	Output is correct
14	Correct	4 ms	384 KB	Output is correct
15	Correct	4 ms	384 KB	Output is correct
16	Correct	4 ms	384 KB	Output is correct
17	Correct	4 ms	384 KB	Output is correct
18	Correct	4 ms	384 KB	Output is correct
19	Correct	4 ms	384 KB	Output is correct
20	Correct	4 ms	384 KB	Output is correct
21	Correct	4 ms	384 KB	Output is correct
22	Correct	4 ms	384 KB	Output is correct
23	Correct	4 ms	384 KB	Output is correct
24	Correct	4 ms	384 KB	Output is correct
25	Correct	4 ms	384 KB	Output is correct
26	Correct	4 ms	384 KB	Output is correct
27	Correct	3 ms	384 KB	Output is correct
28	Correct	3 ms	384 KB	Output is correct
29	Correct	3 ms	384 KB	Output is correct
30	Correct	3 ms	384 KB	Output is correct

Subtask #2

0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	3 ms	384 KB	Output is correct
6	Correct	4 ms	384 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	4 ms	384 KB	Output is correct
9	Correct	4 ms	384 KB	Output is correct
10	Correct	4 ms	384 KB	Output is correct
11	Correct	3 ms	384 KB	Output is correct
12	Correct	4 ms	384 KB	Output is correct
13	Correct	3 ms	384 KB	Output is correct
14	Correct	4 ms	384 KB	Output is correct
15	Correct	4 ms	384 KB	Output is correct
16	Correct	4 ms	384 KB	Output is correct
17	Correct	4 ms	384 KB	Output is correct
18	Correct	4 ms	384 KB	Output is correct
19	Correct	4 ms	384 KB	Output is correct
20	Correct	4 ms	384 KB	Output is correct
21	Correct	4 ms	384 KB	Output is correct
22	Correct	4 ms	384 KB	Output is correct
23	Correct	4 ms	384 KB	Output is correct
24	Correct	4 ms	384 KB	Output is correct
25	Correct	4 ms	384 KB	Output is correct
26	Correct	4 ms	384 KB	Output is correct
27	Correct	3 ms	384 KB	Output is correct
28	Correct	3 ms	384 KB	Output is correct
29	Correct	3 ms	384 KB	Output is correct
30	Correct	3 ms	384 KB	Output is correct
31	Execution timed out	5068 ms	3720 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-

Subtask #3

0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	5059 ms	5636 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #4

0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	5053 ms	5256 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	3 ms	384 KB	Output is correct
6	Correct	4 ms	384 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	4 ms	384 KB	Output is correct
9	Correct	4 ms	384 KB	Output is correct
10	Correct	4 ms	384 KB	Output is correct
11	Correct	3 ms	384 KB	Output is correct
12	Correct	4 ms	384 KB	Output is correct
13	Correct	3 ms	384 KB	Output is correct
14	Correct	4 ms	384 KB	Output is correct
15	Correct	4 ms	384 KB	Output is correct
16	Correct	4 ms	384 KB	Output is correct
17	Correct	4 ms	384 KB	Output is correct
18	Correct	4 ms	384 KB	Output is correct
19	Correct	4 ms	384 KB	Output is correct
20	Correct	4 ms	384 KB	Output is correct
21	Correct	4 ms	384 KB	Output is correct
22	Correct	4 ms	384 KB	Output is correct
23	Correct	4 ms	384 KB	Output is correct
24	Correct	4 ms	384 KB	Output is correct
25	Correct	4 ms	384 KB	Output is correct
26	Correct	4 ms	384 KB	Output is correct
27	Correct	3 ms	384 KB	Output is correct
28	Correct	3 ms	384 KB	Output is correct
29	Correct	3 ms	384 KB	Output is correct
30	Correct	3 ms	384 KB	Output is correct
31	Execution timed out	5068 ms	3720 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-

Subtask #6

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	3 ms	384 KB	Output is correct
6	Correct	4 ms	384 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	4 ms	384 KB	Output is correct
9	Correct	4 ms	384 KB	Output is correct
10	Correct	4 ms	384 KB	Output is correct
11	Correct	3 ms	384 KB	Output is correct
12	Correct	4 ms	384 KB	Output is correct
13	Correct	3 ms	384 KB	Output is correct
14	Correct	4 ms	384 KB	Output is correct
15	Correct	4 ms	384 KB	Output is correct
16	Correct	4 ms	384 KB	Output is correct
17	Correct	4 ms	384 KB	Output is correct
18	Correct	4 ms	384 KB	Output is correct
19	Correct	4 ms	384 KB	Output is correct
20	Correct	4 ms	384 KB	Output is correct
21	Correct	4 ms	384 KB	Output is correct
22	Correct	4 ms	384 KB	Output is correct
23	Correct	4 ms	384 KB	Output is correct
24	Correct	4 ms	384 KB	Output is correct
25	Correct	4 ms	384 KB	Output is correct
26	Correct	4 ms	384 KB	Output is correct
27	Correct	3 ms	384 KB	Output is correct
28	Correct	3 ms	384 KB	Output is correct
29	Correct	3 ms	384 KB	Output is correct
30	Correct	3 ms	384 KB	Output is correct
31	Execution timed out	5068 ms	3720 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-