Submission #1359711

#TimeUsernameProblemLanguageResultExecution timeMemory
1359711chiiuLightning Rod (NOI18_lightningrod)C++20
4 / 100
998 ms263140 KiB
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define fi first
#define se second
const int MAXN = 100005;
ll n, ans = 1;
vector<pair<ll, ll>> v;
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n;
    for(int i = 1; i <= n; i++)
    {
        ll x, y;
        cin >> x >> y;
        v.push_back({x, y});
    }
    sort(v.begin(), v.end());
    for(int i = 1; i < n; i++){
        if(v[i].fi != v[i-1].fi)
            ans++;
    }
    cout << ans;
    return 0;
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...