# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
45534 | gnoor | Jakarta Skyscrapers (APIO15_skyscraper) | C++17 | 859 ms | 5816 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 <cstdio>
#include <vector>
#include <algorithm>
#include <queue>
#include <cstring>
using namespace std;
vector<int> pth[30100];
int dis[30100];
struct ei {
int x,dis;
};
bool operator< (const ei &a, const ei &b) {
return a.dis>b.dis;
}
int main () {
int n,m;
scanf("%d%d",&n,&m);
int a,b;
int s,t;
for (int i=0;i<m;i++) {
scanf("%d%d",&a,&b);
pth[a].push_back(b);
if (i==0) s=a;
if (i==1) t=a;
}
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... |