제출 #154610

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
154610		dolphingarlic	Lightning Rod (NOI18_lightningrod)	C++14	40 / 100	2033 ms	5852 KiB

Main

#include <bits/stdc++.h>
#define FOR(i, x, y) for(int i = x; i < y; i++)
typedef long long ll;
using namespace std;

int n, x, y;
pair<ll, ll> mountains[100000];

void solve() {
    vector<pair<int, int>> visible;
    int c = 0;
    FOR(i, 0, n) {
        bool v = true;
        for (auto& j : visible) {
            if (abs(j.first - mountains[i].first) - abs(j.second - mountains[i].second) >= 0) {
                v = false;
                break;
            }
        }
        if (v) {
            c++;
            visible.push_back(mountains[i]);
        }
    }
    cout << c << '\n';
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n;
    FOR(i, 0, n) {
        cin >> x >> y;
        mountains[i] = {-y, x};
    }
    sort(mountains, mountains + n);
    solve();
    return 0;
}

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