# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
260974 | trainee | Building Skyscrapers (CEOI19_skyscrapers) | C++17 | 544 ms | 26740 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 int long long
#define rep(i,a,n) for(int i = a; i<n; i++)
#define per(i,a,n) for(int i = n-1; i>=a; i--)
map<pair<int,int>,bool> vis;
map<pair<int,int>,int> idx;
int n,t;
int max(int a,int b){return (a>b)?a:b;}
int min(int a,int b){return (a<b)?a:b;}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cin>>n>>t;
bool f = false;
pair<int,int> start = make_pair(-1,-1);
rep(i,0,n){
int x,y;
cin>>x>>y;
idx[make_pair(x,y)] = i+1;
vis[make_pair(x,y)] = false;
if(!f || x > start.first)start = make_pair(x,y),f = true;
}
# | 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... |