# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1045949 | vjudge1 | Rectangles (IOI19_rect) | C++17 | 5067 ms | 1044024 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;
set<int>pos[2501][2501],pos2[2501][2501],stb[2501][20];
set<int> operator & (const set<int>&a,const set<int>&b){
set<int>c;
if(a.size()<b.size()){
for(auto i:a)
if(b.count(i))
c.insert(i);
} else for(auto i:b)
if(a.count(i))
c.insert(i);
return c;
}
vector<array<int,4>> ops;
int CC;
vector<int>res;
int cnt(int l,int r,int col){
/*int x=31-__builtin_clz(r-l+1);
set<int>k=stb[l][x]&stb[r-(1<<x)+1][x];*/
set<int>k=stb[l][0];
for(int i=l;i++<r;)
k=k&stb[i][0];
return distance(k.begin(),k.upper_bound(res[CC++]));
}
int calc(int r1,int r2,int beg){
while(stb[++beg][0].count(r2));
return beg-1;
}
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... |