# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
126832 | MohamedAhmed04 | Examination (JOI19_examination) | C++14 | 3023 ms | 53880 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>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
const int MAX = 1e5 + 5 ;
const int MAX2 = 1e5 ;
typedef tree<
pair<int , int>,
null_type,
less< pair<int , int> >,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
ordered_set bit[MAX] ;
void update(int x , int y)
{
for(int i = x ; i < MAX ; i += i & -i)
bit[i].insert({y , x}) ;
}
int query(int x , int y)
{
int ans = 0 ;
for(int i = x ; i > 0 ; i -= i & -i)
ans += bit[i].order_of_key(make_pair(y+1 , 0)) ;
return ans ;
}
/*int query(int x , int y)
{
int ans = 0 ;
while(x > 0)
{
int y1 = y ;
while(y1 > 0)
{
ans += bit[{x , y1}] ;
y1 -= (y1 & -y1) ;
}
x -= (x & -x) ;
}
return ans ;
}*/
int main()
{
int n , q ;
scanf("%d %d" , &n , &q) ;
int a[n] , b[n] ;
for(int i = 0 ; i < n ; ++i)
{
scanf("%d %d" , &a[i] , &b[i]) ;
update(a[i] , b[i]) ;
}
const int N = 1e5 ;
while(q--)
{
int x , y , z ;
scanf("%d %d %d" , &x , &y , &z) ;
printf("%d\n" , query(N , N) - query(x-1 , N) - query(N , y-1) + query(x-1 , y-1)) ;
}
return 0 ;
}
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... |