# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
144082 | Lyestria | Rectangles (IOI19_rect) | C++14 | 5105 ms | 432732 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 "rect.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mn=2510;
struct seg{
int seg[mn*2];
void up(int a,int b){
seg[a+=mn]=b;
for(a>>=1;a;a>>=1)seg[a]=min(seg[a<<1],seg[(a<<1)^1]);
}
int qu(int a,int b){
int ans=0x3f3f3f3f;
for(a+=mn,b+=mn;a<=b;a>>=1,b>>=1){
if(a&1)ans=min(ans,seg[a++]);
if(!(b&1))ans=min(ans,seg[b--]);
}
return ans;
}
};
seg lef[mn],rig[mn],up[mn],dow[mn];
int elef[mn][mn],erig[mn][mn],eup[mn][mn],edow[mn][mn];
set<ll>ss;
long long hsh(ll a,ll b,ll c,ll d){
return (a<<48)|(b<<32)|(c<<16)|d;
}
long long count_rectangles(std::vector<std::vector<int> > a) {
int n=a.size(),m=a[0].size();
int i,j;
for(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... |