# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
546552 | LucaDantas | Building Skyscrapers (CEOI19_skyscrapers) | C++17 | 363 ms | 22612 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;
const int dx[] = {0, 0, 1, 1, 1, -1, -1, -1};
const int dy[] = {1, -1, 1, -1, 0, 1, -1, 0};
int main() {
int n; scanf("%d", &n);
int t; scanf("%d", &t);
if(t == 2) return 0; // return to this subtask after coding t = 1
vector<pair<int,int>> sk(n);
for(auto& [x, y] : sk)
scanf("%d %d", &x, &y);
map<pair<int,int>, int> id;
for(int i = 0; i < n; i++)
id[sk[i]] = i+1;
sort(sk.begin(), sk.end());
set<pair<int,int>> mark;
priority_queue<pair<int,int>> q;
q.push(sk.back());
mark.insert(sk.back());
vector<int> ans;
Compilation message (stderr)
# | 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... |