oj.uz

답안 #715252

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
715252 2023-03-26T09:26:47 Z ismayil Examination (JOI19_examination) C++17
22 / 100
 272 ms 4976 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 operator<(event other){
        if(x == other.x) return type < other.type;
        return x > other.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());
    int ans[m];
    for (auto i : events)
    {
        if(i.type == 0){
            update(i.y, 1);
        }else{
            ans[i.idx] = query(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();
}

Subtask #1
2.0 / 2.0

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

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 254 ms 4912 KB Output is correct
2 Correct 256 ms 4936 KB Output is correct
3 Correct 249 ms 4976 KB Output is correct
4 Correct 233 ms 4556 KB Output is correct
5 Correct 220 ms 4912 KB Output is correct
6 Correct 208 ms 4624 KB Output is correct
7 Correct 248 ms 4876 KB Output is correct
8 Correct 252 ms 4960 KB Output is correct
9 Correct 254 ms 4912 KB Output is correct
10 Correct 219 ms 4728 KB Output is correct
11 Correct 228 ms 4492 KB Output is correct
12 Correct 195 ms 4524 KB Output is correct

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 254 ms 4912 KB Output is correct
2 Correct 256 ms 4936 KB Output is correct
3 Correct 249 ms 4976 KB Output is correct
4 Correct 233 ms 4556 KB Output is correct
5 Correct 220 ms 4912 KB Output is correct
6 Correct 208 ms 4624 KB Output is correct
7 Correct 248 ms 4876 KB Output is correct
8 Correct 252 ms 4960 KB Output is correct
9 Correct 254 ms 4912 KB Output is correct
10 Correct 219 ms 4728 KB Output is correct
11 Correct 228 ms 4492 KB Output is correct
12 Correct 195 ms 4524 KB Output is correct
13 Incorrect 272 ms 4912 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 46 ms 368 KB Output is correct
8 Correct 46 ms 360 KB Output is correct
9 Correct 46 ms 340 KB Output is correct
10 Correct 46 ms 492 KB Output is correct
11 Correct 46 ms 340 KB Output is correct
12 Correct 42 ms 368 KB Output is correct
13 Correct 44 ms 356 KB Output is correct
14 Correct 47 ms 368 KB Output is correct
15 Correct 47 ms 376 KB Output is correct
16 Correct 24 ms 372 KB Output is correct
17 Correct 35 ms 364 KB Output is correct
18 Correct 13 ms 340 KB Output is correct
19 Correct 254 ms 4912 KB Output is correct
20 Correct 256 ms 4936 KB Output is correct
21 Correct 249 ms 4976 KB Output is correct
22 Correct 233 ms 4556 KB Output is correct
23 Correct 220 ms 4912 KB Output is correct
24 Correct 208 ms 4624 KB Output is correct
25 Correct 248 ms 4876 KB Output is correct
26 Correct 252 ms 4960 KB Output is correct
27 Correct 254 ms 4912 KB Output is correct
28 Correct 219 ms 4728 KB Output is correct
29 Correct 228 ms 4492 KB Output is correct
30 Correct 195 ms 4524 KB Output is correct
31 Incorrect 272 ms 4912 KB Output isn't correct
32 Halted 0 ms 0 KB -