oj.uz

Submission #928330

# Submission time Handle Problem Language Result Execution time Memory
928330 2024-02-16T08:30:02 Z ttamx Advertisement 2 (JOI23_ho_t2) C++14
100 / 100
 686 ms 39508 KB 
#include<bits/stdc++.h>

using namespace std;

int main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    int n;
    cin >> n;
    vector<pair<int,int>> a(n);
    for(auto &[x,e]:a)cin >> x >> e;
    sort(a.begin(),a.end());
    a.erase(unique(a.begin(),a.end()),a.end());
    n=a.size();
    vector<int> ok(n,1);
    for(int t=0;t<2;t++){
        set<int> s;
        for(int i=0;i<n;i++){
            auto [x,e]=a[i];
            int val=e+(t?-x:x);
            if(s.lower_bound(val)!=s.end())ok[i]=0;
            s.emplace(val);
        }
        reverse(a.begin(),a.end());
        reverse(ok.begin(),ok.end());
    }
    cout << accumulate(ok.begin(),ok.end(),0);
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:10:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   10 |     for(auto &[x,e]:a)cin >> x >> e;
      |               ^
Main.cpp:18:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   18 |             auto [x,e]=a[i];
      |                  ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 76 ms 9776 KB Output is correct
3 Correct 71 ms 9128 KB Output is correct
4 Correct 102 ms 13264 KB Output is correct
5 Correct 56 ms 9300 KB Output is correct
6 Correct 342 ms 36620 KB Output is correct
7 Correct 213 ms 24840 KB Output is correct
8 Correct 108 ms 14160 KB Output is correct
9 Correct 83 ms 14068 KB Output is correct

Subtask #2
23.0 / 23.0

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

Subtask #3
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 456 KB Output is correct
12 Correct 0 ms 456 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 456 KB Output is correct
19 Correct 1 ms 544 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 344 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 76 ms 9776 KB Output is correct
3 Correct 71 ms 9128 KB Output is correct
4 Correct 102 ms 13264 KB Output is correct
5 Correct 56 ms 9300 KB Output is correct
6 Correct 342 ms 36620 KB Output is correct
7 Correct 213 ms 24840 KB Output is correct
8 Correct 108 ms 14160 KB Output is correct
9 Correct 83 ms 14068 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 456 KB Output is correct
21 Correct 0 ms 456 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 456 KB Output is correct
28 Correct 1 ms 544 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 337 ms 26320 KB Output is correct
37 Correct 525 ms 33476 KB Output is correct
38 Correct 686 ms 39508 KB Output is correct
39 Correct 564 ms 30044 KB Output is correct
40 Correct 644 ms 38648 KB Output is correct
41 Correct 491 ms 33584 KB Output is correct
42 Correct 342 ms 33480 KB Output is correct
43 Correct 336 ms 30364 KB Output is correct
44 Correct 322 ms 32588 KB Output is correct
45 Correct 346 ms 35472 KB Output is correct