Submission #886498

#TimeUsernameProblemLanguageResultExecution timeMemory
886498vjudge1Towers (NOI22_towers)C++17
0 / 100
679 ms99732 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define endl "\n" #define all(aa) aa.begin(), aa.end() int main(){ int n; cin>>n; vector<pair<int, int>> city; vector<bool> ans(n); vector<vector<int>> c(1000000), r(1000000); for(int i=0; i<n; i++){ int a, b; cin>>a>>b; a--; b--; c[a].push_back(i); r[b].push_back(i); city.emplace_back(a, b); } for(int i=0; i<1000000; i++){ if(!c[i].size()) continue; int minn=0, maxx=0; for(auto j:c[i]){ if(city[j].second>city[maxx].second) maxx=j; if(city[j].second<city[minn].second) minn=j; } ans[minn]=1; ans[maxx]=1; } for(int i=0; i<1000000; i++){ if(!c[i].size()) continue; int minn=0, maxx=0; for(auto j:c[i]){ if(city[j].first>city[maxx].first) maxx=j; if(city[j].first<city[minn].first) minn=j; } ans[minn]=1; ans[maxx]=1; } for(auto e:ans) cout<<e; }
#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...