oj.uz

답안 #715251

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
715251 2023-03-26T09:26:04 Z ismayil Examination (JOI19_examination) C++17
2 / 100
 252 ms 4780 KB 
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int MAX = 1e5;
int bit[MAX + 1];
void update(int pos, int val){
    for(int i = pos; i <= MAX; i = i | (i + 1)){
        bit[i] += val;
    }
}
int query(int pos){
    int res = 0;
    for(int i = pos; i >= 0; i = (i & (i + 1)) - 1){
        res += bit[i];
    }
    return res;
}
int query(int l, int r){
    if(l == 0) return query(r);
    return query(r) - query(l - 1);
}
struct event{
    int x, y, idx, type;
};
bool f(event a, event b){
    if(a.x == b.x) a.type > b.type;
    return a.x < b.x;
}
int n, m;
void solve2(){
    vector<event> events;
    for(int i = 0; i < n; i++){
        int x, y;
        cin>>x>>y;
        events.push_back({x, y, -1, 0});
    }
    for(int i = 0; i < m; i++){
        int x, y, z;
        cin>>x>>y>>z;
        events.push_back({x, y, i, 1});
    }
    sort(events.begin(), events.end(), f);
    int ans[m];
    for (int i = m - 1; i >= 0; i--)
    {
        if(events[i].type == 0){
            update(events[i].y, 1);
        }else{
            ans[events[i].idx] = query(events[i].y, MAX);
        }
    }
    for (int i = 0; i < m; i++) cout<<ans[i]<<endl;
}
void solve1(){
    vector<pair<int, int>> p;
    for(int i = 0; i < n; i++){
        int x, y;
        cin>>x>>y;
        p.push_back({x, y});
    }
    for(int i = 0; i < m; i++){
        int x, y, z;
        cin>>x>>y>>z;
        int cnt = 0;
        for(int i = 0; i < n; i++){
            if(p[i].first >= x && p[i].second >= y && p[i].first + p[i].second >= z) cnt++;
        }
        cout<<cnt<<endl;
    }
}
int main(){
    
    cin>>n>>m;
    if(n <= 3000 && m <= 3000) solve1();
    else solve2();
}

Compilation message

examination.cpp: In function 'bool f(event, event)':
examination.cpp:26:27: warning: statement has no effect [-Wunused-value]
   26 |     if(a.x == b.x) a.type > b.type;
      |                    ~~~~~~~^~~~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 46 ms 340 KB Output is correct
8 Correct 45 ms 340 KB Output is correct
9 Correct 46 ms 368 KB Output is correct
10 Correct 44 ms 368 KB Output is correct
11 Correct 45 ms 368 KB Output is correct
12 Correct 42 ms 368 KB Output is correct
13 Correct 46 ms 352 KB Output is correct
14 Correct 46 ms 340 KB Output is correct
15 Correct 46 ms 352 KB Output is correct
16 Correct 24 ms 376 KB Output is correct
17 Correct 34 ms 368 KB Output is correct
18 Correct 13 ms 340 KB Output is correct

Subtask #2
0 / 20.0

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

Subtask #3
0 / 21.0

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

Subtask #4
0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 46 ms 340 KB Output is correct
8 Correct 45 ms 340 KB Output is correct
9 Correct 46 ms 368 KB Output is correct
10 Correct 44 ms 368 KB Output is correct
11 Correct 45 ms 368 KB Output is correct
12 Correct 42 ms 368 KB Output is correct
13 Correct 46 ms 352 KB Output is correct
14 Correct 46 ms 340 KB Output is correct
15 Correct 46 ms 352 KB Output is correct
16 Correct 24 ms 376 KB Output is correct
17 Correct 34 ms 368 KB Output is correct
18 Correct 13 ms 340 KB Output is correct
19 Incorrect 252 ms 4780 KB Output isn't correct
20 Halted 0 ms 0 KB -