# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
522979 | Farhan_HY | Trampoline (info1cup20_trampoline) | C++14 | 489 ms | 95616 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define int long long
#define float double
#define pb push_back
#define F first
#define S second
#define T int t; cin >> t; while(t--)
#define IOS ios::sync_with_stdio(); cin.tie(0); cout.tie(0);
using namespace std;
const int inf = 8e18;
const int N = 1e6 + 6;
const int M = 1e3 + 3;
const int mod = 1e9 + 7;
const float pi = atan(1) * 4;
int r, c, n;
set<int> tramps[N];
main()
{
cin >> r >> c >> n;
for(int i = 0; i < n; i++)
{
int y, x;
cin >> y >> x;
tramps[y].insert(x);
}
T
{
int x1, x2, y1, y2;
cin >> y1 >> x1 >> y2 >> x2;
while(y1 != y2)
{
if (tramps[y1].lower_bound(x1) == tramps[y1].end())
break;
x1 = *tramps[y1].lower_bound(x1);
if (x1 > x2)
break;
y1++;
}
if (y1 == y2)
cout << "Yes\n";
else
cout << "No\n";
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |