# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
802880 | Theo830 | Towers (NOI22_towers) | C++17 | 2065 ms | 302360 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define ii pair<ll,ll>
#define iii pair<ll,ii>
#define F first
#define S second
const ll N = 1e6+5;
int main(){
set<ii>x[N],y[N];
ll n;
cin>>n;
ll ans[n] = {0};
set<iii>ek;
f(i,0,n){
ll a,b;
cin>>a>>b;
ek.insert(iii(i,ii(a,b)));
x[a].insert(ii(b,i));
y[b].insert(ii(a,i));
}
while(!ek.empty()){
auto it = ek.begin();
ll a = (*it).S.F,b = (*it).S.S;
if(x[a].size() > 1){
for(auto z:x[a]){
ek.erase(iii(z.S,ii(a,z.F)));
y[z.F].erase(ii(a,z.S));
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |