Submission #550832

#	Time	Username	Problem	Language	Result	Execution time	Memory
550832		AKiko	Lightning Rod (NOI18_lightningrod)	C++14	0 / 100	1328 ms	80576 KiB

Main

#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define ss second
#define ff first
#define pb push_back
#define pii pair<int, int>
#define INF INT_MAX
using namespace std;
void debug_out() { cerr << endl; }
template<typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << ' ' << H; debug_out(T...); }
#ifdef AKIKO_DEBUG
#define debug(...) cerr << "\033[1;31m(" << #__VA_ARGS__ << "):\033[0m", debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif

#define FAST ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

const ll MOD = 1e9 + 7;








int main() {
    FAST
    int n, ind = 0;
    cin >> n;
    vector<pii> a(n);
    for(int i = 0; i < n; i++) {
        cin >> a[i].ff >> a[i].ss;
        if(a[i].ss > a[ind].ss) {
            ind = i;
        }
    }
    int ans = 0, l = ind, r = ind, cur = ind;
    while(l >= 0) {
        if(a[cur].ss - a[l].ss < a[cur].ff - a[l].ff) {
            cur = l;
            ans++;
        }
        l--;
    }
    cur = ind;
    while(r < n) {
        if(a[cur].ss - a[r].ss < a[r].ff - a[cur].ff) {
            cur = r;
            ans++;
        }
        r++;
    }
    cout << ans << "\n";
    

    return 0;
}

/* stuff you should look for
    * int overflow, array bounds
    * special cases (n=1?)
    * do smth instead of nothing and stay organized
    * WRITE STUFF DOWN
    * DON'T GET STUCK ON ONE APPROACH
*/

• Subtask 1: 0 / 4
• Subtask 2: 0 / 7
• Subtask 3: 0 / 12
• Subtask 4: 0 / 21
• Subtask 5: 0 / 26
• Subtask 6: 0 / 10
• Subtask 7: 0 / 20