#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define ll long long
#define pb push_back
#define F first
#define S second
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
if(a>b) swap(a,b);
if(a==0) return a+b;
return gcd(b%a,a);
}
ll lcm(ll a,ll b){
return a/gcd(a,b)*b;
}
bool is_prime(ll n){
ll k=sqrt(n);
if(n==2) return true;
if(n<2||n%2==0||k*k==n) return false;
for(int i=3;i<=k;i+=2){
if(n%i==0){
return false;
}
}
return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=2e5+5,N=1e5;
int t=1,n,m,tree[mxn],ans[mxn];
void update(int ind,int val){
while(ind<=N){
tree[ind]+=val;
ind+=(ind&(-ind));
}
}
int query(int ind){
int ans=0;
while(ind>0){
ans+=tree[ind];
ind-=(ind&(-ind));
}
return ans;
}
bool f(pii a,pii b){
return a.F>b.F;
}
bool ff(pair<pii,int>a,pair<pii,int>b){
return a.F.F>b.F.F;
}
void solve(){
vector<pii>vt;
cin>>n>>m;
for(int i=1;i<=n;i++){
int a,b;
cin>>a>>b;
vt.pb({a,b});
}
vector<pair<pii,int>>q;
for(int i=1;i<=m;i++){
int a,b,c;
cin>>a>>b>>c;
q.pb({{a,b},i});
}
sort(all(vt));
sort(all(q));
int idx=vt.size()-1;
for(int i=q.size()-1;i>=0;i--){
int x=q[i].F.F,y=q[i].F.S;
while(idx>=0&&vt[idx].F>=x){
update(vt[idx].S,1);
idx--;
}
ans[q[i].S]=query(100000)-query(y-1);
}
for(int i=1;i<=m;i++){
cout<<ans[i]<<endl;
}
}
int main(){
IOS;
//cin>>t;
while(t--){
solve();
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
340 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
3059 ms |
3904 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
3059 ms |
3904 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
340 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
