Submission #962456

#	Time	Username	Problem	Language	Result	Execution time	Memory
962456		tvladm2009	Lightning Rod (NOI18_lightningrod)	C++17	0 / 100	1101 ms	57008 KiB

Main

#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <random>

using namespace std;
template<typename T1, typename T2> inline void chkmin(T1 &a, T2 b) {if (a > b) a = b;}
template<typename T1, typename T2> inline void chkmax(T1 &a, T2 b) {if (a < b) a = b;}
#define files(FILENAME) read(FILENAME); write(FILENAME)
#define read(FILENAME) freopen((FILENAME + ".in").c_str(), "r", stdin)
#define write(FILENAME) freopen((FILENAME + ".out").c_str(), "w", stdout)
#define all(c) (c).begin(), (c).end()
#define sz(c) (int)(c).size()
#define left left228
#define right right228
#define y1 y1228
#define mp make_pair
#define pb push_back
#define y2 y2228
#define rank rank228
using ll = long long;
using ld = long double; 
const string FILENAME = "input";

bool check(pair<int, int> a, pair<int, int> b) {
    return a.first <= b.first && b.second <= a.second;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    //read(FILENAME);
    int n;
    cin >> n;
    vector<pair<int, int>> stk;
    for (int i = 1; i <= n; i++) {
        int x, y;
        cin >> x >> y;
        pair<int, int> p = {-(x + y), x - y};
        if (stk.empty()) {
            stk.pb(p);
        } else {
            if (check(stk.back(), p)) {
                continue;
            }
            while (!stk.empty() && check(p, stk.back())) {
                stk.pop_back();
            }
            stk.push_back(p);
        }
    }
    cout << sz(stk) << '\n';
    return 0;
}

• 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