Submission #742935

#TimeUsernameProblemLanguageResultExecution timeMemory
742935vjudge1Lightning Rod (NOI18_lightningrod)C++17
0 / 100
2074 ms173904 KiB
#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int>> v;

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

int main()
{
    // bf
    map<int, vector<int>> ma;
    map<int, int> mac;
    int n, a, b;
    cin >> n;
    for (int i = 1; i <= n; ++i)
    {
        cin >> a >> b;
        v.push_back({b, a});
        mac[i-1] = 0;
    }
    cout << n;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...