oj.uz

Submission #829020

# Submission time Handle Problem Language Result Execution time Memory
829020 2023-08-18T01:55:38 Z makanhulia Lightning Rod (NOI18_lightningrod) C++17
14 / 100
 1839 ms 157608 KB 
#include <bits/stdc++.h>
typedef long long ll;
#define ii pair<ll,ll>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
using namespace std;

vector<ii> seg;
bool comp(ii a, ii b){
    if(a.fi == b.fi) return a.se > b.se;
    return a.fi < b.fi;
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n;
    cin >> n;
    seg.resize(n);
    ll x, y;
    for(int i=0; i<n; i++){
        cin >> x >> y;
        seg[i] = mp(x-y, x+y);
    }
    sort(seg.begin(), seg.end(), comp);

    ll r=0, R=0, cnt = 0;
    for(int i=0; i<n; i++){
        R = max(r, seg[i].se);
        if(seg[i].se > r){
            ++cnt;
            r = R;
        }
    }
    cout << cnt << '\n';

    return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1694 ms 152012 KB Output is correct
2 Correct 1686 ms 151572 KB Output is correct
3 Correct 1645 ms 147444 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 Incorrect 1 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 Incorrect 1 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 Incorrect 1 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 Incorrect 1 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1724 ms 156236 KB Output is correct
2 Correct 1839 ms 157608 KB Output is correct
3 Correct 1723 ms 153768 KB Output is correct

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1694 ms 152012 KB Output is correct
2 Correct 1686 ms 151572 KB Output is correct
3 Correct 1645 ms 147444 KB Output is correct
4 Correct 0 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 Incorrect 1 ms 212 KB Output isn't correct
8 Halted 0 ms 0 KB -