# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
690891 | TomitaMatei | Trampoline (info1cup20_trampoline) | C++14 | 2101 ms | 2560 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 <iostream>
#include <algorithm>
using namespace std;
struct pozitii
{
int x,y;
}poz[200001];
bool ord (pozitii a, pozitii b)
{
return a.x<b.x || (a.x==b.x && a.y<b.y);
}
int n,k,i,m,t,x1,y1,x2,y2,mij,st,dr,ok;
int main()
{
cin>>n>>m>>k;
for (i=1; i<=k; i++)
cin>>poz[i].x>>poz[i].y;
sort (poz+1,poz+k+1,ord);
cin>>t;
while (t!=0)
{
t--;
cin>>x1>>y1>>x2>>y2;
st=1;
dr=k;
# | 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... |