# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
151866 | Ruxandra985 | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 818 ms | 3948 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.
/// cine ia tle ? eu iau tle
#include <cstdio>
#include <queue>
#include <vector>
#include <algorithm>
#define DIMN 30010
using namespace std;
priority_queue <pair <int,int> > h;
int f[DIMN],dp[DIMN];
pair <int,int> v[DIMN];
vector <int> poz[DIMN];
int main()
{
FILE *fin = stdin;
FILE *fout = stdout;
int n,m,i,curr,add,jump,p,idx;
fscanf (fin,"%d%d",&n,&m);
for (i=1;i<=m;i++){
fscanf (fin,"%d%d",&v[i].first,&v[i].second);
v[i].first++;
poz[v[i].first].push_back(i);
}
for (i=1;i<=n;i++)
dp[i] = 2000000000;
h.push(make_pair(0,v[1].first));
dp[v[1].first] = 0;
while (!h.empty()){
curr = h.top().second;
h.pop();
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... |