제출 #126859

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
126859		MohamedAhmed04	Examination (JOI19_examination)	C++14	0 / 100	2578 ms	66140 KiB

examination

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<pair<int , int> , null_type, less<pair<int , int> >, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

const int N = 100002;

ordered_set bit[N];

void update(int x, int y)
{
	for(int i = x; i < N; i += i & -i)
		bit[i].insert({y, x});
}
int query(int x, int y)
{
	int ans = 0;
	for(int i = x; i > 0; i -= i & -i)
    {
        ans += bit[i].order_of_key({y+1, 0});
    }
	return ans;
}
/*int query(int x , int y)
{
    int ans = 0 ;
    while(x > 0)
    {
        int y1 = y ;
        while(y1 > 0)
        {
            ans += bit[{x , y1}] ;
            y1 -= (y1 & -y1) ;
        }
        x -= (x & -x) ;
    }
    return ans ;
}*/

int a[N], b[N] ;

int main()
{
    int n , q ;
    scanf("%d %d" , &n, &q) ;
    for(int i = 0 ; i < n ; ++i)
    {
        cin>>a[i]>>b[i] ;
        a[i]++ ;
        b[i]++ ;
    }
    for(int i = 0 ; i < n ; ++i)
        update(a[i] , b[i]) ;
    while(q--)
    {
        int x , y , z ;
        cin>>x>>y>>z ;
        x++ ;
        y++ ;
        cout<<query(N-1 , N-1) - query(x-1 , N-1) - query(N-1 , y-1) + query(x-1 , y-1)<<"\n";
    }
    return 0 ;
}

컴파일 시 표준 에러 (stderr) 메시지

examination.cpp: In function 'int main()':
examination.cpp:47:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d" , &n, &q) ;
     ~~~~~^~~~~~~~~~~~~~~~~~

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