# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
278747 | arnold518 | Circus (Balkan15_CIRCUS) | C++14 | 4075 ms | 18872 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 "circus.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 3e5;
const int INF = 1e9+100;
int N, M, P[MAXN+10];
int dist[MAXN+10];
struct Queue
{
int u, w;
bool operator < (const Queue &p) const { return w>p.w; }
};
void init(int _N, int _M, int _P[])
{
N=_N; M=_M;
for(int i=1; i<=N; i++) P[i]=_P[i-1];
sort(P+1, P+N+1);
N=unique(P+1, P+N+1)-P-1;
P[0]=M;
for(int i=0; i<=3*N; i++) dist[i]=INF;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |