oj.uz

Submission #829015

# Submission time Handle Problem Language Result Execution time Memory
829015 2023-08-18T01:42:02 Z devariaota Lightning Rod (NOI18_lightningrod) C++17
4 / 100
 2000 ms 190732 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+1);
    ll x, y;
    for(int i=1; i<=n; i++){
        cin >> x >> y;
        seg[i] = mp(x-y, x+y);
    }
    sort(seg.begin()+1, seg.begin()+n+1, comp);

    priority_queue<ll> pq;
    ll r=0, cnt = 0;
    for(int i=1; i<=n; i++){
        // cout<<seg[i].fi<<' '<<seg[i].se<<'\n';
        pq.push(seg[i].se);
        if(seg[i].se > r){
            ++cnt;
            r = pq.top();
            pq.pop();
        }
    }
    cout << cnt << '\n';

    return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1761 ms 154180 KB Output is correct
2 Correct 1816 ms 153760 KB Output is correct
3 Correct 1775 ms 149672 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 280 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 1 ms 212 KB Output is correct
2 Correct 1 ms 280 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 1 ms 212 KB Output is correct
2 Correct 1 ms 280 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 1 ms 212 KB Output is correct
2 Correct 1 ms 280 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
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2060 ms 190732 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1761 ms 154180 KB Output is correct
2 Correct 1816 ms 153760 KB Output is correct
3 Correct 1775 ms 149672 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 280 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 -