# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
563376 | hoanghq2004 | Building Skyscrapers (CEOI19_skyscrapers) | C++14 | 391 ms | 23868 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;
int n, T;
map <pair <int, int>, int> mp, vis;
int dx[8] = {0, 1, 0, -1, 1, -1, 1, -1};
int dy[8] = {1, 0, -1, 0, 1, 1, -1, -1};
int main() {
// freopen("test.inp", "r", stdin);
ios :: sync_with_stdio(0); cin.tie(0);
cin >> n >> T;
vector <pair <int, int> > P;
int X = 0, Y = 0;
for (int i = 1; i <= n; ++i) {
int x, y;
cin >> x >> y;
mp[{x, y}] = i;
X = x, Y = y;
}
priority_queue <pair <int, int> > q;
q.push({X, Y});
vis[{X, Y}] = 1;
vector <int> ans;
while (q.size()) {
int x = q.top().first;
int y = q.top().second;
ans.push_back(mp[{x, y}]);
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... |