oj.uz

Submission #1079798

# Submission time Handle Problem Language Result Execution time Memory
1079798 2024-08-29T01:55:15 Z kustizus Examination (JOI19_examination) C++17
0 / 100
 267 ms 27400 KB 
// #pragma GCC optimize("O3","unroll-loops")
#include <bits/stdc++.h>
#define int long long
using namespace std;
mt19937_64 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
const int N=2e5;
struct Node{
    int x,y,s,ty;
};
vector <Node> v;
int n,q,ans[N+5];
void Rs(int l, int r){
    int md=l+r>>1;
    int x=l,y=md+1;
    vector <Node> dq;
    while (x<=md || y<=r){
        if (x>md) dq.push_back(v[y++]);
        else if (y>r) dq.push_back(v[x++]);
        else if (v[x].y<v[y].y) dq.push_back(v[x++]);
        else dq.push_back(v[y++]);
    }
    for (int i=r;i>=l;--i){
        v[i]=dq.back();
        dq.pop_back();
    }
}
bool comp(Node a, Node b){
    return a.x<b.x;
}
struct Fenwick_Tree{
    int FT[N+5];
    void clear(){
        for (int i=1;i<=N;++i) FT[i]=0;
    }
    void Update(int idx, int val){
        for (;idx<=N;idx+=idx&(-idx)) FT[idx]+=val;
    }
    int Get(int idx){
        int val=0;
        for (;idx;idx-=idx&(-idx)) val+=FT[idx];
        return val;
    }
    int Sum(int l, int r){
        return Get(r)-Get(l-1);
    }
} fw;
void dnc(int l, int r){
    if (l>=r) return;
    int md=l+r>>1;
    dnc(l,md);
    dnc(md+1,r);
    int pointer=md+1;
    for (int i=md+1;i<=r;++i) 
        if (!v[i].ty) fw.Update(v[i].s,1);
    for (int i=l;i<=md;++i){
        while (pointer<=r && v[pointer].y<v[i].y){
            if (!v[pointer].ty) fw.Update(v[pointer].s,-1);
            ++pointer;
        }
        if (v[i].ty) ans[v[i].ty]+=fw.Get(N)-fw.Get(v[i].s-1);
    }
    for (int i=pointer;i<=r;++i)
        if (!v[i].ty) fw.Update(v[i].s,-1);
    Rs(l,r);
}
void Solve(){
    cin>>n>>q;
    v.push_back({0,0,0,0});
    for (int i=1;i<=n;++i){
        int x,y;
        cin>>x>>y;
        v.push_back({x,y,x+y,0});
    }
    for (int i=1;i<=q;++i){
        int x,y,z;
        cin>>x>>y>>z;
        v.push_back({x,y,z,i});
    }
    sort(v.begin()+1,v.end(),comp);
    map <int,int> mp;
    for (int i=1;i<=n+q;++i) mp[v[i].s]=1;
    int idx=0;
    for (pair <int,int> x : mp)
        mp[x.first]=++idx;
    for (int i=1;i<=n+q;++i) v[i].s=mp[v[i].s];
    // for (int i=1;i<=n+q;++i) cout<<v[i].x<<' '<<v[i].y<<' '<<v[i].s<<"\n";
    // cout<<"\n";
    dnc(1,n+q);
    for (int i=1;i<=q;++i) cout<<ans[i]<<"\n";
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    if (fopen("file.inp","r")){
        freopen ("file.inp","r",stdin);
        freopen ("file.out","w",stdout);
    }
    int t=1;
    // cin>>t;
    while (t--) Solve();
    cerr<<"\nTIME: "<<1000*clock()/CLOCKS_PER_SEC <<"ms.";
}

Compilation message

examination.cpp: In function 'void Rs(long long int, long long int)':
examination.cpp:13:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   13 |     int md=l+r>>1;
      |            ~^~
examination.cpp: In function 'void dnc(long long int, long long int)':
examination.cpp:49:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   49 |     int md=l+r>>1;
      |            ~^~
examination.cpp: In function 'int main()':
examination.cpp:95:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   95 |         freopen ("file.inp","r",stdin);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
examination.cpp:96:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   96 |         freopen ("file.out","w",stdout);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 8 ms 1528 KB Output is correct
8 Correct 12 ms 1564 KB Output is correct
9 Correct 8 ms 1568 KB Output is correct
10 Correct 8 ms 1568 KB Output is correct
11 Incorrect 8 ms 1568 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 267 ms 27400 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 267 ms 27400 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 8 ms 1528 KB Output is correct
8 Correct 12 ms 1564 KB Output is correct
9 Correct 8 ms 1568 KB Output is correct
10 Correct 8 ms 1568 KB Output is correct
11 Incorrect 8 ms 1568 KB Output isn't correct
12 Halted 0 ms 0 KB -