oj.uz

Submission #938553

# Submission time Handle Problem Language Result Execution time Memory
938553 2024-03-05T10:06:05 Z the_coding_pooh Advertisement 2 (JOI23_ho_t2) C++14
100 / 100
 1523 ms 96108 KB 
#include <bits/stdc++.h>
#define uwu return 0;

using namespace std;

const int SIZE = 5e5 + 5;

int N;

int X[SIZE], E[SIZE];

int innode[SIZE];

map<int, pair<int, int>> mp;

#define fs first
#define sc second

vector<int> disX;

int main(){
    cin >> N;

    for (int i = 0; i < N;i++){
        cin >> X[i] >> E[i];
        if(mp[X[i]].fs < E[i]){
            mp[X[i]].fs = E[i];
            mp[X[i]].sc = 1;
        }
    }
    
    for(auto i:mp){
        disX.push_back(i.fs);
    }
    
    N = disX.size();

    set<int> XmE, XpE;

    for (int i = 0; i < N;i++){
        if(XpE.lower_bound(disX[i] + mp[disX[i]].fs) != XpE.end()){
            innode[i]++;
        }
        XpE.insert(disX[i] + mp[disX[i]].fs);
    }

    for (int i = N - 1; i >= 0;i--){
        if(XmE.upper_bound(disX[i] - mp[disX[i]].fs) != XmE.begin()){
            innode[i]++;
        }
        XmE.insert(disX[i] - mp[disX[i]].fs);
    }
    

    int cnt = 0;
    for (int i = 0; i < N;i++){
        //cout << innode[i] << '\n';
        if(!innode[i])
            cnt += mp[disX[i]].sc;
    }
    cout << cnt << '\n';
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 227 ms 25540 KB Output is correct
3 Correct 206 ms 20596 KB Output is correct
4 Correct 302 ms 15648 KB Output is correct
5 Correct 182 ms 11792 KB Output is correct
6 Correct 1214 ms 88072 KB Output is correct
7 Correct 717 ms 50432 KB Output is correct
8 Correct 346 ms 16468 KB Output is correct
9 Correct 278 ms 15712 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4540 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4440 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4548 KB Output is correct
14 Correct 1 ms 4440 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct

Subtask #3
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4540 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4440 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4548 KB Output is correct
14 Correct 1 ms 4440 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 2 ms 4700 KB Output is correct
20 Correct 2 ms 4548 KB Output is correct
21 Correct 1 ms 4544 KB Output is correct
22 Correct 2 ms 4700 KB Output is correct
23 Correct 4 ms 4444 KB Output is correct
24 Correct 2 ms 4444 KB Output is correct
25 Correct 2 ms 4444 KB Output is correct
26 Correct 2 ms 4444 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 227 ms 25540 KB Output is correct
3 Correct 206 ms 20596 KB Output is correct
4 Correct 302 ms 15648 KB Output is correct
5 Correct 182 ms 11792 KB Output is correct
6 Correct 1214 ms 88072 KB Output is correct
7 Correct 717 ms 50432 KB Output is correct
8 Correct 346 ms 16468 KB Output is correct
9 Correct 278 ms 15712 KB Output is correct
10 Correct 1 ms 4440 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4540 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4440 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4440 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4548 KB Output is correct
23 Correct 1 ms 4440 KB Output is correct
24 Correct 1 ms 4444 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 2 ms 4700 KB Output is correct
29 Correct 2 ms 4548 KB Output is correct
30 Correct 1 ms 4544 KB Output is correct
31 Correct 2 ms 4700 KB Output is correct
32 Correct 4 ms 4444 KB Output is correct
33 Correct 2 ms 4444 KB Output is correct
34 Correct 2 ms 4444 KB Output is correct
35 Correct 2 ms 4444 KB Output is correct
36 Correct 894 ms 65040 KB Output is correct
37 Correct 1230 ms 82248 KB Output is correct
38 Correct 1484 ms 96108 KB Output is correct
39 Correct 861 ms 58148 KB Output is correct
40 Correct 1523 ms 92324 KB Output is correct
41 Correct 966 ms 64456 KB Output is correct
42 Correct 914 ms 64264 KB Output is correct
43 Correct 1234 ms 77612 KB Output is correct
44 Correct 1185 ms 72560 KB Output is correct
45 Correct 1220 ms 92052 KB Output is correct