oj.uz

Submission #734888

# Submission time Handle Problem Language Result Execution time Memory
734888 2023-05-03T08:18:04 Z rahidilbayramli Advertisement 2 (JOI23_ho_t2) C++17
100 / 100
 457 ms 9888 KB 
#include<bits/stdc++.h>
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define vl vector<ll>
#define sl set<ll>
#define pb push_back
#define all(v) v.begin(), v.end()
#define f first
#define s second
#define ld long double
using namespace std;
int main()
{
    ll n, x, e, i;
    cin >> n;
    vector<pair<ll, ll>>points(n);
    for(i = 0; i < n; i++)
    {
        cin >> x >> e;
        points[i] = {x-e, x+e};
    }
    sort(points.begin(), points.end(), [](auto &i, auto &j)
    {
        if(i.f != j.f)    return i.f < j.f;
        return i.s > j.s;
    });
    ll maxx = -1, k = 0;
    for(auto i : points)    if(maxx < i.s)    maxx = i.s, k++;
    cout << k << "\n";
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 100 ms 2320 KB Output is correct
3 Correct 145 ms 3096 KB Output is correct
4 Correct 389 ms 7532 KB Output is correct
5 Correct 236 ms 5396 KB Output is correct
6 Correct 449 ms 8124 KB Output is correct
7 Correct 410 ms 8128 KB Output is correct
8 Correct 420 ms 8120 KB Output is correct
9 Correct 457 ms 8128 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 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 1 ms 212 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 296 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 296 KB Output is correct
18 Correct 1 ms 296 KB Output is correct

Subtask #3
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 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 1 ms 212 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 296 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 296 KB Output is correct
18 Correct 1 ms 296 KB Output is correct
19 Correct 1 ms 316 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 2 ms 212 KB Output is correct
23 Correct 2 ms 304 KB Output is correct
24 Correct 2 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 100 ms 2320 KB Output is correct
3 Correct 145 ms 3096 KB Output is correct
4 Correct 389 ms 7532 KB Output is correct
5 Correct 236 ms 5396 KB Output is correct
6 Correct 449 ms 8124 KB Output is correct
7 Correct 410 ms 8128 KB Output is correct
8 Correct 420 ms 8120 KB Output is correct
9 Correct 457 ms 8128 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 304 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 296 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 296 KB Output is correct
27 Correct 1 ms 296 KB Output is correct
28 Correct 1 ms 316 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 2 ms 212 KB Output is correct
32 Correct 2 ms 304 KB Output is correct
33 Correct 2 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 278 ms 5620 KB Output is correct
37 Correct 395 ms 7440 KB Output is correct
38 Correct 433 ms 8468 KB Output is correct
39 Correct 314 ms 8224 KB Output is correct
40 Correct 414 ms 8124 KB Output is correct
41 Correct 433 ms 8264 KB Output is correct
42 Correct 411 ms 8192 KB Output is correct
43 Correct 419 ms 9888 KB Output is correct
44 Correct 440 ms 8256 KB Output is correct
45 Correct 291 ms 8256 KB Output is correct