Submission #1302152

#	Time	Username	Problem	Language	Result	Execution time	Memory
1302152		LmaoLmao	Examination (JOI19_examination)	C++20	0 / 100	392 ms	6172 KiB

examination

#include <bits/stdc++.h>

#define name "a"
#define fi first
#define se second
using namespace std;

using ll = long long;
using ii = pair<int,int>;
using aa = array<int,4>;

const int N = 2e5+5;
const int MOD = 998244353;

vector<int> nen;

int getnen(int x) {
    return lower_bound(nen.begin(),nen.end(),x)-nen.begin()+1;
}

struct BIT {
    int F[N];
    void update(int pos,int val) {
        for(int i=pos;i<N;i+=i & -i) {
            F[i]+=val;
        }
    }
    int get(int pos) {
        int res=0;
        for(int i=pos;i>0;i-=i & -i) {
            res+=F[i];
        }
        return res;
    }
} F;


aa a[N];
int ans[N];

bool cmp(aa x,aa y) {
    if(x[1]!=y[1]) {
        return x[1]>y[1];
    } else
    if(x[2]!=y[2]) {
        return x[2]<y[2];
    }
    else {
        return x[3]<y[3];
    }
}

void DNC(int l,int r) {
    if(l==r) return;
    int mid = l+r >> 1;

    DNC(l,mid);
    DNC(mid+1,r);

    int j=l;
    for(int i=mid+1;i<=r;i++) {
        if(a[i][3]==0) continue;
        while(j<=mid && cmp(a[j],a[i]) ) {
            if(a[j][3]==0) F.update(a[j][2],1);
            j++;
        }
        ans[a[i][3]]+=F.get(a[i][2]);
    }
    for(int i=l;i<j;i++) {
        if(a[i][3]==0) F.update(a[i][2],-1);
    }
    sort(a+l,a+1+r,cmp);
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    if (fopen(name".inp","r")) {
        freopen(name".inp","r",stdin);
        freopen(name".out","w",stdout);
    }
    int n,q;
    cin >> n >> q;
    for(int i=1;i<=n;i++) {
        cin >> a[i][0] >> a[i][1];
        a[i][2]=a[i][0]+a[i][1];
        nen.push_back(-a[i][2]);
    }
    for(int i=n+1;i<=n+q;i++) {
        cin >> a[i][0] >> a[i][1] >> a[i][2];
        a[i][2]=max(a[i][2],a[i][0]+a[i][1]); 
        a[i][3]=i-n;
        nen.push_back(-a[i][2]);
    }
    sort(a+1,a+1+n+q,greater<>());
    sort(nen.begin(),nen.end());
    for(int i=1;i<=n+q;i++) {
        a[i][2]=getnen(-a[i][2]);
    }
    DNC(1,n+q);
    for(int i=1;i<=q;i++) {
        cout << ans[i] << endl;
    }
    return 0;
}

Compilation message (stderr)

examination.cpp: In function 'int main()':
examination.cpp:79:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   79 |         freopen(name".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
examination.cpp:80:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   80 |         freopen(name".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 2
• Subtask 2: 0 / 20
• Subtask 3: 0 / 21
• Subtask 4: 0 / 57