oj.uz

Submission #932785

# Submission time Handle Problem Language Result Execution time Memory
932785 2024-02-24T08:09:47 Z Yazan_Alattar Advertisement 2 (JOI23_ho_t2) C++14
100 / 100
 726 ms 118336 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define all(x) x.begin(), x.end()
const int M = 1000007;
const ll inf = 1e9;
const ll INF = 1e12;
const ll mod = 1e9 + 7;
const double eps = 1e-6;

vector < pair <ll,ll> > order;
vector <int> adj[M];
map <ll,ll> mp;
ll n, a[M], b[M], dist[M];
bool reached[M];

void AddEdges(){
    for(int i = 1; i < order.size(); ++i){
        int l = order[i - 1].S;
        int r = order[i].S;

        adj[l].pb(r);
        adj[r].pb(l);
    }

    return;
}

void Dijkstra(){
    priority_queue < pair <ll,ll> > q;
    for(int i = 1; i <= n; ++i){
        q.push({b[i], i});
        dist[i] = b[i];
    }

    while(!q.empty()){
        int node = q.top().S;
        ll cost = q.top().F;
        q.pop();

        if(dist[node] > cost) continue;

        for(auto i : adj[node]){
            ll d = abs(a[i] - a[node]);

            if(dist[node] - d >= b[i]) reached[i] = 1;
            if(dist[node] - d > dist[i]){
                dist[i] = dist[node] - d;
                q.push({dist[i], i});
            }
        }
    }

    return;
}

void solve(int _){
    cin >> n;
    for(int i = 1; i <= n; ++i){
        cin >> a[i] >> b[i];
        mp[a[i]] = max(mp[a[i]], b[i]);
    }

    int idx = 0;
    for(auto i : mp){
        ++idx;
        a[idx] = i.F;
        b[idx] = i.S;
    }
    n = idx;

    for(int i = 1; i <= n; ++i) order.pb({a[i], i});
    sort(all(order));

    AddEdges();
    Dijkstra();

    ll ans = n;
    for(int i = 1; i <= n; ++i) if(reached[i]) --ans;
    cout << ans << endl;
    return;
}

int main(){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int t = 1;
//    cin >> t;
    for(int i = 1; i <= t; ++i) solve(t);

    return 0;
}

Compilation message

Main.cpp: In function 'void AddEdges()':
Main.cpp:23:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |     for(int i = 1; i < order.size(); ++i){
      |                    ~~^~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 31576 KB Output is correct
2 Correct 106 ms 49964 KB Output is correct
3 Correct 108 ms 46788 KB Output is correct
4 Correct 155 ms 45388 KB Output is correct
5 Correct 62 ms 42068 KB Output is correct
6 Correct 545 ms 111688 KB Output is correct
7 Correct 351 ms 79800 KB Output is correct
8 Correct 163 ms 48212 KB Output is correct
9 Correct 93 ms 47700 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 31576 KB Output is correct
2 Correct 7 ms 31580 KB Output is correct
3 Correct 8 ms 31824 KB Output is correct
4 Correct 8 ms 31700 KB Output is correct
5 Correct 7 ms 31776 KB Output is correct
6 Correct 7 ms 31580 KB Output is correct
7 Correct 7 ms 31668 KB Output is correct
8 Correct 7 ms 31580 KB Output is correct
9 Correct 8 ms 31576 KB Output is correct
10 Correct 7 ms 31804 KB Output is correct
11 Correct 7 ms 31576 KB Output is correct
12 Correct 8 ms 31580 KB Output is correct
13 Correct 7 ms 31580 KB Output is correct
14 Correct 8 ms 31580 KB Output is correct
15 Correct 7 ms 31580 KB Output is correct
16 Correct 7 ms 31576 KB Output is correct
17 Correct 7 ms 31576 KB Output is correct
18 Correct 7 ms 31832 KB Output is correct

Subtask #3
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 31576 KB Output is correct
2 Correct 7 ms 31580 KB Output is correct
3 Correct 8 ms 31824 KB Output is correct
4 Correct 8 ms 31700 KB Output is correct
5 Correct 7 ms 31776 KB Output is correct
6 Correct 7 ms 31580 KB Output is correct
7 Correct 7 ms 31668 KB Output is correct
8 Correct 7 ms 31580 KB Output is correct
9 Correct 8 ms 31576 KB Output is correct
10 Correct 7 ms 31804 KB Output is correct
11 Correct 7 ms 31576 KB Output is correct
12 Correct 8 ms 31580 KB Output is correct
13 Correct 7 ms 31580 KB Output is correct
14 Correct 8 ms 31580 KB Output is correct
15 Correct 7 ms 31580 KB Output is correct
16 Correct 7 ms 31576 KB Output is correct
17 Correct 7 ms 31576 KB Output is correct
18 Correct 7 ms 31832 KB Output is correct
19 Correct 8 ms 31832 KB Output is correct
20 Correct 7 ms 31836 KB Output is correct
21 Correct 8 ms 31836 KB Output is correct
22 Correct 9 ms 31836 KB Output is correct
23 Correct 8 ms 31832 KB Output is correct
24 Correct 7 ms 31836 KB Output is correct
25 Correct 9 ms 31836 KB Output is correct
26 Correct 8 ms 31820 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 31576 KB Output is correct
2 Correct 106 ms 49964 KB Output is correct
3 Correct 108 ms 46788 KB Output is correct
4 Correct 155 ms 45388 KB Output is correct
5 Correct 62 ms 42068 KB Output is correct
6 Correct 545 ms 111688 KB Output is correct
7 Correct 351 ms 79800 KB Output is correct
8 Correct 163 ms 48212 KB Output is correct
9 Correct 93 ms 47700 KB Output is correct
10 Correct 7 ms 31576 KB Output is correct
11 Correct 7 ms 31580 KB Output is correct
12 Correct 8 ms 31824 KB Output is correct
13 Correct 8 ms 31700 KB Output is correct
14 Correct 7 ms 31776 KB Output is correct
15 Correct 7 ms 31580 KB Output is correct
16 Correct 7 ms 31668 KB Output is correct
17 Correct 7 ms 31580 KB Output is correct
18 Correct 8 ms 31576 KB Output is correct
19 Correct 7 ms 31804 KB Output is correct
20 Correct 7 ms 31576 KB Output is correct
21 Correct 8 ms 31580 KB Output is correct
22 Correct 7 ms 31580 KB Output is correct
23 Correct 8 ms 31580 KB Output is correct
24 Correct 7 ms 31580 KB Output is correct
25 Correct 7 ms 31576 KB Output is correct
26 Correct 7 ms 31576 KB Output is correct
27 Correct 7 ms 31832 KB Output is correct
28 Correct 8 ms 31832 KB Output is correct
29 Correct 7 ms 31836 KB Output is correct
30 Correct 8 ms 31836 KB Output is correct
31 Correct 9 ms 31836 KB Output is correct
32 Correct 8 ms 31832 KB Output is correct
33 Correct 7 ms 31836 KB Output is correct
34 Correct 9 ms 31836 KB Output is correct
35 Correct 8 ms 31820 KB Output is correct
36 Correct 436 ms 94928 KB Output is correct
37 Correct 587 ms 108320 KB Output is correct
38 Correct 726 ms 118336 KB Output is correct
39 Correct 512 ms 95064 KB Output is correct
40 Correct 703 ms 116984 KB Output is correct
41 Correct 547 ms 105904 KB Output is correct
42 Correct 508 ms 106104 KB Output is correct
43 Correct 656 ms 116296 KB Output is correct
44 Correct 644 ms 117164 KB Output is correct
45 Correct 583 ms 113204 KB Output is correct