oj.uz

Submission #715262

# Submission time Handle Problem Language Result Execution time Memory
715262 2023-03-26T09:58:45 Z Khizri Examination (JOI19_examination) C++17
20 / 100
 78 ms 4424 KB 
#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<=100000){
        tree[ind]+=val;
        ind = ind | (ind + 1);
    }
}
int query(int ind){
    int ans=0;
    while(ind>=0){
        ans+=tree[ind];
        ind = (ind & (ind+1))-1;;
    }
    return ans;
}
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});
    }
    sort(rall(vt));
    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(rall(q));
    int idx=0;
    for(int i=0;i<q.size();i++){
        int x=q[i].F.F,y=q[i].F.S;
        while(idx<vt.size()&&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;
}

Compilation message

examination.cpp: In function 'void solve()':
examination.cpp:77:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |     for(int i=0;i<q.size();i++){
      |                 ~^~~~~~~~~
examination.cpp:79:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |         while(idx<vt.size()&&vt[idx].F>=x){
      |               ~~~^~~~~~~~~~

Subtask #1
0 / 2.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 4352 KB Output is correct
2 Correct 62 ms 4336 KB Output is correct
3 Correct 64 ms 4352 KB Output is correct
4 Correct 70 ms 4032 KB Output is correct
5 Correct 65 ms 4424 KB Output is correct
6 Correct 51 ms 4036 KB Output is correct
7 Correct 78 ms 4340 KB Output is correct
8 Correct 70 ms 4368 KB Output is correct
9 Correct 72 ms 4376 KB Output is correct
10 Correct 66 ms 4212 KB Output is correct
11 Correct 55 ms 3772 KB Output is correct
12 Correct 47 ms 3676 KB Output is correct

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 4352 KB Output is correct
2 Correct 62 ms 4336 KB Output is correct
3 Correct 64 ms 4352 KB Output is correct
4 Correct 70 ms 4032 KB Output is correct
5 Correct 65 ms 4424 KB Output is correct
6 Correct 51 ms 4036 KB Output is correct
7 Correct 78 ms 4340 KB Output is correct
8 Correct 70 ms 4368 KB Output is correct
9 Correct 72 ms 4376 KB Output is correct
10 Correct 66 ms 4212 KB Output is correct
11 Correct 55 ms 3772 KB Output is correct
12 Correct 47 ms 3676 KB Output is correct
13 Incorrect 68 ms 4308 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

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