oj.uz

Submission #954693

# Submission time Handle Problem Language Result Execution time Memory
954693 2024-03-28T11:11:20 Z Warinchai Advertisement 2 (JOI23_ho_t2) C++14
100 / 100
 128 ms 17216 KB 
#include<bits/stdc++.h>
using namespace std;
vector<pair<int,int>>v;
bool check(pair<int,int>f,pair<int,int>s){
    return abs(f.first-s.first)<=f.second-s.second;
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n;cin>>n;
    int a,b;
    for(int i=1;i<=n;i++){
        cin>>a>>b;
        v.push_back({a,b});
    }
    sort(v.begin(),v.end());
    stack<pair<int,int>>st;
    st.push(v[0]);
    for(int i=1;i<n;i++){
        a=v[i].first;
        b=v[i].second;
        if(!check(st.top(),v[i])){
            while(!st.empty()&&check(v[i],st.top())){
                st.pop();
            }
            st.push(v[i]);
        }
    }
    cout<<st.size();
}

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 4772 KB Output is correct
3 Correct 43 ms 5832 KB Output is correct
4 Correct 105 ms 12944 KB Output is correct
5 Correct 66 ms 10328 KB Output is correct
6 Correct 118 ms 17216 KB Output is correct
7 Correct 126 ms 15840 KB Output is correct
8 Correct 109 ms 14156 KB Output is correct
9 Correct 98 ms 14172 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 344 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 1 ms 400 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 344 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 0 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 1 ms 544 KB Output is correct
18 Correct 0 ms 348 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 344 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 1 ms 400 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 344 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 0 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 1 ms 544 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 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 492 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 348 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 30 ms 4772 KB Output is correct
3 Correct 43 ms 5832 KB Output is correct
4 Correct 105 ms 12944 KB Output is correct
5 Correct 66 ms 10328 KB Output is correct
6 Correct 118 ms 17216 KB Output is correct
7 Correct 126 ms 15840 KB Output is correct
8 Correct 109 ms 14156 KB Output is correct
9 Correct 98 ms 14172 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 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 1 ms 400 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 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 1 ms 544 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 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 492 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 348 KB Output is correct
36 Correct 78 ms 9828 KB Output is correct
37 Correct 96 ms 12084 KB Output is correct
38 Correct 128 ms 14084 KB Output is correct
39 Correct 123 ms 11196 KB Output is correct
40 Correct 127 ms 13932 KB Output is correct
41 Correct 127 ms 14016 KB Output is correct
42 Correct 120 ms 14284 KB Output is correct
43 Correct 120 ms 14092 KB Output is correct
44 Correct 116 ms 14048 KB Output is correct
45 Correct 100 ms 14076 KB Output is correct