# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
158241 | Akashi | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 260 ms | 65636 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 sgn[] = {-1, 1};
int n, m, pos;
int d[30005];
bool viz[30005];
set <int> s[30005];
vector <pair <int, int> > v[30005];
priority_queue <pair <int, int>, vector <pair <int, int> >, greater <pair <int, int> > > q;
int main()
{
scanf("%d%d", &n, &m);
int x2, x, y;
scanf("%d%d", &x, &y);
s[x].insert(y); x2 = x;
scanf("%d%d", &x, &y);
pos = x;
if(pos == x2){
printf("0");
return 0;
}
for(int i = 3; i <= m ; ++i){
scanf("%d%d", &x, &y);
s[x].insert(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... |