# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
126813 | MohamedAhmed04 | Examination (JOI19_examination) | C++14 | 3036 ms | 143784 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>
using namespace std;
const int MAX = 1e5 + 5 ;
map< pair<int , int> , int>bit ;
void update(int x , int y , int val)
{
while(x < MAX)
{
int y1 = y ;
while(y1 < MAX)
{
bit[{x , y1}] += val ;
y1 += (y1 & -y1) ;
}
x += (x & -x) ;
}
return ;
}
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] , 1) ;
}
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... |