oj.uz

Submission #931702

# Submission time Handle Problem Language Result Execution time Memory
931702 2024-02-22T09:44:02 Z Yazan_Alattar Advertisement 2 (JOI23_ho_t2) C++14
69 / 100
 524 ms 74816 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;

pair <ll,ll> a[M];
vector <ll> adj[M];
vector < pair <ll,ll> > order;
priority_queue < pair <ll,ll> > q;
ll n, ans;
bool visit[M], done[M];

void solve(int _){
    cin >> n;
    for(int i = 1; i <= n; ++i){
        cin >> a[i].F >> a[i].S;

        order.pb({a[i].F, i});
        q.push({a[i].S, i});
    }

    sort(all(order));
    for(int i = 0; i < order.size(); ++i){
        if(i > 0) adj[order[i].S].pb(order[i - 1].S);
        if(i + 1 < order.size()) adj[order[i].S].pb(order[i + 1].S);
    }


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

        if(done[i]) continue;
        done[i] = 1;

        if(!visit[i]) ++ans;

        for(auto j : adj[i]){
            int newCost = a[i].S - abs(a[i].F - a[j].F);
            if(newCost >= a[j].S) visit[j] = 1;
            if(newCost > a[j].S){
                a[j].S = newCost;
                q.push({newCost, j});
            }
        }
    }

    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 solve(int)':
Main.cpp:33: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]
   33 |     for(int i = 0; i < order.size(); ++i){
      |                    ~~^~~~~~~~~~~~~~
Main.cpp:35:18: 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]
   35 |         if(i + 1 < order.size()) adj[order[i].S].pb(order[i + 1].S);
      |            ~~~~~~^~~~~~~~~~~~~~
Main.cpp:41:13: warning: unused variable 'cost' [-Wunused-variable]
   41 |         int cost = q.top().F;
      |             ^~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 26972 KB Output is correct
2 Correct 65 ms 37288 KB Output is correct
3 Correct 98 ms 41620 KB Output is correct
4 Correct 286 ms 63176 KB Output is correct
5 Correct 125 ms 52112 KB Output is correct
6 Correct 346 ms 66888 KB Output is correct
7 Correct 352 ms 67368 KB Output is correct
8 Correct 306 ms 66752 KB Output is correct
9 Correct 182 ms 66704 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 26968 KB Output is correct
2 Correct 6 ms 27060 KB Output is correct
3 Correct 5 ms 26972 KB Output is correct
4 Correct 6 ms 26972 KB Output is correct
5 Correct 7 ms 27064 KB Output is correct
6 Correct 6 ms 26972 KB Output is correct
7 Correct 6 ms 27076 KB Output is correct
8 Correct 6 ms 26972 KB Output is correct
9 Correct 7 ms 27228 KB Output is correct
10 Correct 6 ms 26972 KB Output is correct
11 Correct 6 ms 27092 KB Output is correct
12 Correct 5 ms 26968 KB Output is correct
13 Correct 6 ms 27072 KB Output is correct
14 Correct 6 ms 26972 KB Output is correct
15 Correct 6 ms 27144 KB Output is correct
16 Correct 6 ms 26968 KB Output is correct
17 Correct 6 ms 26972 KB Output is correct
18 Correct 6 ms 26968 KB Output is correct

Subtask #3
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 26968 KB Output is correct
2 Correct 6 ms 27060 KB Output is correct
3 Correct 5 ms 26972 KB Output is correct
4 Correct 6 ms 26972 KB Output is correct
5 Correct 7 ms 27064 KB Output is correct
6 Correct 6 ms 26972 KB Output is correct
7 Correct 6 ms 27076 KB Output is correct
8 Correct 6 ms 26972 KB Output is correct
9 Correct 7 ms 27228 KB Output is correct
10 Correct 6 ms 26972 KB Output is correct
11 Correct 6 ms 27092 KB Output is correct
12 Correct 5 ms 26968 KB Output is correct
13 Correct 6 ms 27072 KB Output is correct
14 Correct 6 ms 26972 KB Output is correct
15 Correct 6 ms 27144 KB Output is correct
16 Correct 6 ms 26968 KB Output is correct
17 Correct 6 ms 26972 KB Output is correct
18 Correct 6 ms 26968 KB Output is correct
19 Correct 6 ms 27228 KB Output is correct
20 Correct 6 ms 27228 KB Output is correct
21 Correct 6 ms 26972 KB Output is correct
22 Correct 10 ms 27216 KB Output is correct
23 Correct 7 ms 27152 KB Output is correct
24 Correct 6 ms 27228 KB Output is correct
25 Correct 6 ms 26972 KB Output is correct
26 Correct 6 ms 27228 KB Output is correct

Subtask #4
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 26972 KB Output is correct
2 Correct 65 ms 37288 KB Output is correct
3 Correct 98 ms 41620 KB Output is correct
4 Correct 286 ms 63176 KB Output is correct
5 Correct 125 ms 52112 KB Output is correct
6 Correct 346 ms 66888 KB Output is correct
7 Correct 352 ms 67368 KB Output is correct
8 Correct 306 ms 66752 KB Output is correct
9 Correct 182 ms 66704 KB Output is correct
10 Correct 6 ms 26968 KB Output is correct
11 Correct 6 ms 27060 KB Output is correct
12 Correct 5 ms 26972 KB Output is correct
13 Correct 6 ms 26972 KB Output is correct
14 Correct 7 ms 27064 KB Output is correct
15 Correct 6 ms 26972 KB Output is correct
16 Correct 6 ms 27076 KB Output is correct
17 Correct 6 ms 26972 KB Output is correct
18 Correct 7 ms 27228 KB Output is correct
19 Correct 6 ms 26972 KB Output is correct
20 Correct 6 ms 27092 KB Output is correct
21 Correct 5 ms 26968 KB Output is correct
22 Correct 6 ms 27072 KB Output is correct
23 Correct 6 ms 26972 KB Output is correct
24 Correct 6 ms 27144 KB Output is correct
25 Correct 6 ms 26968 KB Output is correct
26 Correct 6 ms 26972 KB Output is correct
27 Correct 6 ms 26968 KB Output is correct
28 Correct 6 ms 27228 KB Output is correct
29 Correct 6 ms 27228 KB Output is correct
30 Correct 6 ms 26972 KB Output is correct
31 Correct 10 ms 27216 KB Output is correct
32 Correct 7 ms 27152 KB Output is correct
33 Correct 6 ms 27228 KB Output is correct
34 Correct 6 ms 26972 KB Output is correct
35 Correct 6 ms 27228 KB Output is correct
36 Correct 296 ms 58768 KB Output is correct
37 Correct 414 ms 66312 KB Output is correct
38 Correct 487 ms 74816 KB Output is correct
39 Correct 524 ms 72772 KB Output is correct
40 Correct 490 ms 74772 KB Output is correct
41 Correct 436 ms 74708 KB Output is correct
42 Correct 398 ms 74256 KB Output is correct
43 Incorrect 418 ms 73740 KB Output isn't correct
44 Halted 0 ms 0 KB -