Submission #743271

#	Time	Username	Problem	Language	Result	Execution time	Memory
743271		vjudge1	Lightning Rod (NOI18_lightningrod)	C++17	40 / 100	2070 ms	262144 KiB

Main

#include <iostream>
#include <unordered_map>
#include <vector>
#include <algorithm>
using namespace std;
vector<pair<long long, long long>> v;

bool sorted(const pair<long long, long long> &a, const pair<long long, long long> &b)
{
    if (a.second == b.second)
        return a.first > b.first;
    return a.second > b.second;
}

bool check(long long x1, long long x2, long long y1, long long y2)
{
    return abs(x1 - x2) <= y1 - y2;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    unordered_map<long long, long long> ma;
    long long n, a, b;
    cin >> n;
    for (long long i = 1; i <= n; ++i)
    {
        cin >> a >> b;
        v.push_back({a, b});
        ma[i - 1] = -1;
    }
    long long sum = n;
    sort(v.begin(), v.end(), sorted);
    for (long long i = 0; i < v.size(); ++i)
    {
        for (long long j = 0; j < v.size(); ++j)
        {
            if (ma[j] == -1 && i != j && check(v[i].first, v[j].first, v[i].second, v[j].second))
            {
                sum--;
                ma[j] = i;
            }
        }
    }
    cout << sum;
}

Compilation message (stderr)

lightningrod.cpp: In function 'int main()':
lightningrod.cpp:36:29: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |     for (long long i = 0; i < v.size(); ++i)
      |                           ~~^~~~~~~~~~
lightningrod.cpp:38:33: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |         for (long long j = 0; j < v.size(); ++j)
      |                               ~~^~~~~~~~~~

• 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