oj.uz

답안 #126865

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
126865 2019-07-08T14:27:30 Z MohamedAhmed04 Examination (JOI19_examination) C++14
0 / 100
 2501 ms 66132 KB 
#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 = 100005;

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 q2(int x1 , int y1 , int x2 , int y2)
{
    int x = query(x2, y2) - query(x2 , y1 - 1) - query(x1-1 , y2) + query(x1 - 1 , y1 - 1) ;
}

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++ ;
        z++ ;
        cout<<q2(x , y , N-1 , N-1)<<"\n" ;
    }
    return 0 ;
}

Compilation message

examination.cpp: In function 'int q2(int, int, int, int)':
examination.cpp:46:9: warning: unused variable 'x' [-Wunused-variable]
     int x = query(x2, y2) - query(x2 , y1 - 1) - query(x1-1 , y2) + query(x1 - 1 , y1 - 1) ;
         ^
examination.cpp:47:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^
examination.cpp: In function 'int main()':
examination.cpp:52: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.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 14 ms 9720 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2501 ms 66132 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2501 ms 66132 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 14 ms 9720 KB Output isn't correct
2 Halted 0 ms 0 KB -