# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
303970 | Pajaraja | Hamburg Steak (JOI20_hamburg) | C++17 | 3089 ms | 6648 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 MAXN 200007
using namespace std;
int n,k;
struct rect{int xl,xh,yl,yh;};
rect intersect(rect a,rect b) {rect r={max(a.xl,b.xl),min(a.xh,b.xh),max(a.yl,b.yl),min(a.yh,b.yh)}; return r;}
bool valid(rect a) {return a.xh>=a.xl && a.yh>=a.yl;}
rect p[MAXN],res;
pair<int,int> px[MAXN],py[MAXN];
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
inline vector<rect> check(vector<rect> pot)
{
vector<rect> t;
for(int i=0;i<n;i++)
{
bool ziv=false;
for(int j=0;j<pot.size();j++) if(valid(intersect(p[i],pot[j])))
{
pot[j]=intersect(pot[j],p[i]);
ziv=true;
break;
}
if(!ziv) return t;
}
return pot;
}
int main()
{
scanf("%d%d",&n,&k);
for(int i=0;i<n;i++)
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |