# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
37074 | leejseo | Jakarta Skyscrapers (APIO15_skyscraper) | C++11 | 443 ms | 8628 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 <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
#define all(v) v.begin(), v.end()
#define maxint 2E9
struct Node{
int u;
int dist;
Node (int u_, int d_) {u = u_; dist = d_;}
bool operator < (const Node &a) const {return dist > a.dist;}
};
int N, M;
int B[30001];
int P[30001];
vector<int> V[30000];
int dist[30000];
void get_input(){
scanf("%d%d", &N, &M);
for (int i=0; i<M; i++) {
scanf("%d%d", &B[i], &P[i]);
V[B[i]].push_back(P[i]);
}
for (int i=0; i<N; i++) {
sort(all(V[i]));
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... |