# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
52654 | evpipis | Jakarta Skyscrapers (APIO15_skyscraper) | C++11 | 321 ms | 45132 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;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
typedef pair<int, int> ii;
const int len = 30005, inf = 1e9;
int po[len], pos[len], vis[len], dis[len][180][2];
vector<int> vec[len];
//map<int, int> mymap[len];
deque<pair<ii, ii> > deq;
int main(){
int n, m, k;
scanf("%d %d", &n, &m);
k = sqrt(n)+1;
for (int i = 0; i < m; i++)
scanf("%d %d", &pos[i], &po[i]);
for (int i = 0; i < m; i++)
vec[pos[i]].pb(po[i]);
for (int i = 0; i < n; i++)
for (int j = 0; j <= k; j++)
dis[i][j][0] = dis[i][j][1] = inf;
int ans = -1;
deq.pb(mp(mp(0, 0), mp(pos[0], po[0])));
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... |