# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
36801 | imaxblue | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 319 ms | 20944 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 ll long long
#define mp make_pair
#define pb push_back
#define x first
#define y second
#define pii pair<int, int>
#define p3i pair<pii, int>
#define pll pair<ll, ll>
#define p3l pair<pll, ll>
#define lseg L, (L+R)/2, N*2+1
#define rseg (L+R)/2+1, R, N*2+2
#define ub upper_bound
#define lb lower_bound
#define p_q priority_queue
#define MN 1000000009
int n, m, P, D, X, K, t, p[30005], j[30005], d[30005][105], J;
p_q<pair<int, pii> > pq;
bool u[30005][105];
vector<int> v[30005];
int main(){
memset(d, 0x3f3f3f3f, sizeof d);
scanf("%i%i", &n, &m);
for (int l=0; l<m; ++l){
scanf("%i%i", &p[l], &j[l]);
v[p[l]].pb(j[l]);
}
X=p[1];
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... |