oj.uz

Submission #924130

# Submission time Handle Problem Language Result Execution time Memory
924130 2024-02-08T13:47:00 Z ErJ Advertisement 2 (JOI23_ho_t2) C++17
10 / 100
 118 ms 16104 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define vi vector<ll>
#define vvi vector<vector<ll>>
#define vs vector<string>
#define vc vector<char>
#define vb vector<bool>
#define vp vector<pair<ll, ll>>
#define pp pair<ll, ll>
#define qi queue<ll>
#define qp queue<pp>
#define pqi priority_queue<ll>
#define pqp priority_queue<pp>
#define mi map<ll, ll>
#define mpi map<pp, ll>
#define mip map<ll, pp>
#define mpp map<pp, pp>
#define mb map<ll, bool>
#define si set<ll>
#define sp set<pp>
#define mod 1000000007
#define rep(a, b) for(int a = 0; a < (b); a++)
#define inf 100000000111111111


int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int n;
    cin >> n;
    vi X(n), E(n);
    vp C(n);
    rep(i, n) {
        cin >> X[i] >> E[i];
        C[i] = { X[i] - E[i], X[i] + E[i] };
    }
    sort(C.begin(), C.end());
    ll MAXB = -1;
    ll ans = 0;
    rep(i, n) {
        if (C[i].second > MAXB) {
            ans++;
            MAXB = C[i].second;
        }
    }
    cout << ans << endl;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 30 ms 4444 KB Output is correct
3 Correct 42 ms 5964 KB Output is correct
4 Correct 108 ms 14952 KB Output is correct
5 Correct 56 ms 10648 KB Output is correct
6 Correct 111 ms 16104 KB Output is correct
7 Correct 118 ms 16104 KB Output is correct
8 Correct 107 ms 16104 KB Output is correct
9 Correct 94 ms 15964 KB Output is correct

Subtask #2
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 36.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 30 ms 4444 KB Output is correct
3 Correct 42 ms 5964 KB Output is correct
4 Correct 108 ms 14952 KB Output is correct
5 Correct 56 ms 10648 KB Output is correct
6 Correct 111 ms 16104 KB Output is correct
7 Correct 118 ms 16104 KB Output is correct
8 Correct 107 ms 16104 KB Output is correct
9 Correct 94 ms 15964 KB Output is correct
10 Incorrect 0 ms 348 KB Output isn't correct
11 Halted 0 ms 0 KB -