oj.uz

답안 #126822

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
126822 2019-07-08T13:28:06 Z MohamedAhmed04 Examination (JOI19_examination) C++14
0 / 100
 3000 ms 198620 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;

const int MAX = 1e5 + 5 ;

struct chash {
    int operator()(pair<int , int> x) const { return x.first* 31 + x.second; }
};

gp_hash_table<pair<int , int> , int, chash> bit;

void update(int x , int y , int val)
{
    while(x < MAX)
    {
        int y1 = y ;
        while(y1 < MAX)
        {
            bit[{x , y1}] += val ;
            y1 += (y1 & -y1) ;
        }
        x += (x & -x) ;
    }
    return ;
}

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 main()
{
    int n , q ;
    scanf("%d %d" , &n , &q) ;
    int a[n] , b[n] ;
    for(int i = 0 ; i < n ; ++i)
    {
        scanf("%d %d" , &a[i] , &b[i]) ;
        update(a[i] , b[i] , 1) ;
    }
    const int N = 1e5 ;
    int cur = query(N , N) ;
    while(q--)
    {
        int x , y , z ;
        scanf("%d %d %d" , &x , &y , &z) ;
        printf("%d\n" , cur - query(x-1 , N) - query(N , y-1) + query(x-1 , y-1)) ;
    }
    return 0 ;
}

Compilation message

examination.cpp: In function 'int main()':
examination.cpp:48:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d" , &n , &q) ;
     ~~~~~^~~~~~~~~~~~~~~~~~~
examination.cpp:52:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d" , &a[i] , &b[i]) ;
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
examination.cpp:60:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %d" , &x , &y , &z) ;
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 2.0

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

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3026 ms 198620 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3026 ms 198620 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

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