Submission #879297

#TimeUsernameProblemLanguageResultExecution timeMemory
879297hasan2006Examination (JOI19_examination)C++17
100 / 100
931 ms90776 KiB
#include <bits/stdc++.h>

using namespace std;

#define TL ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define rall(s) s.rbegin(),s.rend()
#define all(s) s.begin(),s.end()
#define pb push_back
#define se second
#define fi first
#define ll long long
#define ld long double
#define YES cout<<"YES\n"
#define Yes cout<<"Yes\n"
#define yes cout<<"yes\n"
#define NO cout<<"NO\n"
#define No cout<<"No\n"
#define no cout<<"no\n"


const int N = 6e5 + 9 , mod = 1e9 + 7;
ll   a[N] = {}, b[N] , c[N] , d[N][3] , dp[N];

ll nn = 0;

void add(int x , int y){
    while(x <= nn){
        d[x][y] += 1;
        x += (x & (-x));
    }
}

ll get(int x , int y){
    ll sum = 0;
    while(x > 0){
        sum += d[x][y];
        x -= (x & (-x));
    }
    return sum;
}

void solve()
{
    ll q , i , j , m ,n, z ,s = 0 , f, l , r , k , x , y , mn  = 1e18 , mx = 0;
    cin>>n>>m;
    set<int>st;
    map<int,int>mp;
    vector<pair<int,pair<int,int>>>v;
    vector<pair<int,int>>v1;
    for(i = 1; i <= n; i++){
        cin>>l>>r;
        st.insert(l);
        st.insert(r);
        st.insert(r + l);
        v.pb({l + r , {l , r}});
    }
    sort(rall(v));
    for(i = 1; i <= m; i++){
        cin>>a[i]>>b[i]>>c[i];
        v1.pb({c[i] , i});
        st.insert(b[i]);
        st.insert(a[i]);
        st.insert(b[i] + a[i]);
    }
    sort(rall(v1));
    for(auto it:st)
        mp[it] = ++nn;
    l = 0;
    vector<pair<int,int>>vc;
    for(auto to : v1){
        if(a[to.se] + b[to.se] < c[to.se]){
        while(l < v.size() && v[l].fi >= to.fi){
            add(mp[v[l].se.fi] , 1);
            add(mp[v[l].se.se] , 2);
            l++;
        }
        s = -l;
        s += l - get(mp[a[to.se]] - 1 , 1);
        s += l - get(mp[b[to.se]] - 1, 2);
        dp[to.se] = s;
        }else {
            vc.pb({b[to.se] , to.se});
        }
    }
    for(i = 0; i < v.size(); i++)
        swap(v[i].fi , v[i].se.se);
    sort(rall(vc));
    sort(rall(v));
    l = 0;
    for(auto to : vc){
        while(l < v.size() && v[l].fi >= to.fi){
            add(mp[v[l].se.fi] , 0);
            l++;
        }
        dp[to.se] = l - get(mp[a[to.se]] - 1 , 0);
    }
    for(i = 1; i <= m; i++)
        cout<<dp[i]<<"\n";
}

int main(){
int t = 1;
//cin>>t;
while(t--)
     {
     solve();
     }
}
// Author : حسن

Compilation message (stderr)

examination.cpp: In function 'void solve()':
examination.cpp:72:17: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |         while(l < v.size() && v[l].fi >= to.fi){
      |               ~~^~~~~~~~~~
examination.cpp:85:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |     for(i = 0; i < v.size(); i++)
      |                ~~^~~~~~~~~~
examination.cpp:91:17: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |         while(l < v.size() && v[l].fi >= to.fi){
      |               ~~^~~~~~~~~~
examination.cpp:44:8: warning: unused variable 'q' [-Wunused-variable]
   44 |     ll q , i , j , m ,n, z ,s = 0 , f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |        ^
examination.cpp:44:16: warning: unused variable 'j' [-Wunused-variable]
   44 |     ll q , i , j , m ,n, z ,s = 0 , f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                ^
examination.cpp:44:26: warning: unused variable 'z' [-Wunused-variable]
   44 |     ll q , i , j , m ,n, z ,s = 0 , f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                          ^
examination.cpp:44:37: warning: unused variable 'f' [-Wunused-variable]
   44 |     ll q , i , j , m ,n, z ,s = 0 , f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                     ^
examination.cpp:44:48: warning: unused variable 'k' [-Wunused-variable]
   44 |     ll q , i , j , m ,n, z ,s = 0 , f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                                ^
examination.cpp:44:52: warning: unused variable 'x' [-Wunused-variable]
   44 |     ll q , i , j , m ,n, z ,s = 0 , f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                                    ^
examination.cpp:44:56: warning: unused variable 'y' [-Wunused-variable]
   44 |     ll q , i , j , m ,n, z ,s = 0 , f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                                        ^
examination.cpp:44:60: warning: unused variable 'mn' [-Wunused-variable]
   44 |     ll q , i , j , m ,n, z ,s = 0 , f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                                            ^~
examination.cpp:44:73: warning: unused variable 'mx' [-Wunused-variable]
   44 |     ll q , i , j , m ,n, z ,s = 0 , f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                                                         ^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...