제출 #345043

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
345043		nishuz	Lightning Rod (NOI18_lightningrod)	C++14	44 / 100	2091 ms	88044 KiB

Main

#include <bits/stdc++.h>

using namespace std;

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n, ans = 0, subtask = 1;
    cin >> n;
    vector <pair <int, int>> a(n);
    bool vis[n], ok = 1;
    memset(vis, 0, sizeof vis);
    for (int i = 0; i < n; ++i)
    {
        cin >> a[i].first >> a[i].second;
        ok &= (a[i].second == 1);
        if (i) subtask += (a[i].first != a[i-1].first);
    }
    if (ok)
    {
        cout << subtask << '\n';
        return 0;
    }
    sort(a.begin(), a.end(), [&](pair <int, int>& a, pair <int, int>& b) {return a.second > b.second;});
    for (int i = 0; i < n; ++i)
    {
        if (vis[i]) continue;
        ++ans;
        for (int j = i; j < n; ++j) if (abs(a[i].first - a[j].first) <= abs(a[i].second - a[j].second)) vis[j] = 1;
    }
    cout << ans << '\n';
}

• Subtask 1: 4 / 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