Submission #1168749

#	Time	Username	Problem	Language	Result	Execution time	Memory
1168749		son2008	Examination (JOI19_examination)	C++20	Compilation error	0 ms	0 KiB

examination

#include<bits/stdc++.h>
using namespace std;
#define task "task"
#define ii pair<int,int>
#define fi first
#define se second
#define int long long
#define ll long long
#define ld double
#define mp make_pair
#define lg2 30
#define iii pair<int,ii>
#define iiii pair<ii,ii>
#define base 29
#define eps 1e-8
int dx[]= {0LL,0LL,1,-1,1,1,-1,-1};
int dy[]= {1,-1,0LL,0LL,1,-1,1,-1};
const int maxn=4e5+1;
const int mod=1e9+7;
int n,q,ans[maxn];
struct pt
{
    int x,y,z,i;
};
pt a[maxn],query[maxn];
bool cmp(pt x,pt y)
{
    return x.z>y.z;
}
struct FEN
{
    int n;
    vector<int>bit;
    FEN(){};
    FEN(int _n):bit(n+1,0),n(_n+1)
    {
    };
    int get(int r) {
        int ret = 0;
        for (; r >= 0; r = (r & (r + 1)) - 1)
            ret += bit[r];
        return ret;
    }

    int get(int l, int r) {
        return get(r) - get(l - 1);
    }

    void update(int idx, int delta) {
        for (; idx < n; idx = idx | (idx + 1))
            bit[idx] += delta;
    }
    void updateRange(int l,int r,int val)
    {
        update(l,val);
        update(r+1,-val);
    }
}bit1,bit2;
void init()
{
    cin>>n>>q;
    vector<int>nen;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i].x>>a[i].y;
        nen.push_back(a[i].x);
        nen.push_back(a[i].y);
        a[i].z=a[i].x+a[i].y;
    }
    sort(a+1,a+n+1,cmp);
    for(int i=1;i<=q;i++)
    {
        cin>>query[i].x>>query[i].y>>query[i].z;
        nen.push_back(query[i].x);
        nen.push_back(query[i].y);
        query[i].z=max(query[i].z,query[i].x+query[i].y);
        query[i].i=i;
    }
    sort(nen.begin(),nen.end());
    nen.erase(unique(nen.begin(),nen.end()),nen.end());
    for(int i=1;i<=n;i++)
    {
        a[i].x=lower_bound(nen.begin(),nen.end(),a[i].x)-nen.begin()+1;
        a[i].y=lower_bound(nen.begin(),nen.end(),a[i].y)-nen.begin()+1;
    }
    for(int i=1;i<=q;i++)
    {
        query[i].x=lower_bound(nen.begin(),nen.end(),query[i].x)-nen.begin()+1;
        query[i].y=lower_bound(nen.begin(),nen.end(),query[i].y)-nen.begin()+1;
    }
    sort(query+1,query+q+1,cmp);
}
void process()
{
    int l=0;
    bit1=bit2=FEN(nen.size()+1);
    for(int i=1;i<=q;i++)
    {
        while(true)
        {
            if(l==n||a[l+1].z<query[i].z)break;
            l++;
            bit1.update(a[l].x,1);
            bit2.update(a[l].y,1);
        }
        ans[query[i].i]=l-bit1.get(query[i].x-1)-bit2.get(query[i].y-1);
    }
    for(int i=1;i<=q;i++)
    {
        cout<<ans[i]<<'\n';
    }
}
signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    if(fopen(task".inp","r"))
    {
        freopen(task".inp","r",stdin);
        freopen(task".out","w",stdout);
    }
    init();
    process();
    cerr <<endl<< "TIME : " << clock() * 0.001 << "s" << endl ;
}

Compilation message (stderr)

examination.cpp: In function 'void process()':
examination.cpp:96:19: error: 'nen' was not declared in this scope; did you mean 'nan'?
   96 |     bit1=bit2=FEN(nen.size()+1);
      |                   ^~~
      |                   nan
examination.cpp: In function 'int main()':
examination.cpp:120:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  120 |         freopen(task".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
examination.cpp:121:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  121 |         freopen(task".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~