# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
886498 | vjudge1 | Towers (NOI22_towers) | C++17 | 679 ms | 99732 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 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;
# | 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... |