Submission #278747

# Submission time Handle Problem Language Result Execution time Memory
278747 2020-08-21T18:03:29 Z arnold518 Circus (Balkan15_CIRCUS) C++14
91 / 100
4000 ms 18872 KB
#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;

	priority_queue<Queue> PQ;
	PQ.push({2*N, M-P[N]}); dist[0]=0;
	while(!PQ.empty())
	{
		Queue now=PQ.top(); PQ.pop();
		if(dist[now.u]<=now.w) continue;
		dist[now.u]=now.w;
		if(now.u<=N)
		{
			int t=upper_bound(P+1, P+N+1, P[now.u]-now.w)-P-1;
			if(t!=0) PQ.push({N+t, P[now.u]-P[t]});

			t=lower_bound(P+1, P+N+1, P[now.u]+now.w)-P;
			if(t!=N+1) PQ.push({N*2+t, P[t]-P[now.u]});
		}
		else if(now.u<=2*N)
		{
			PQ.push({now.u-N, now.w});
			if(now.u!=N+1) PQ.push({now.u-1, now.w+P[now.u-N]-P[now.u-N-1]});
		}
		else
		{
			PQ.push({now.u-2*N, now.w});
			if(now.u!=3*N) PQ.push({now.u+1, now.w+P[now.u+1-2*N]-P[now.u-2*N]});
		}
	}
	//for(int i=1; i<=N; i++) printf("%d ", dist[i]); printf("\n");
}
 
int minLength(int D)
{
	int ans=M-D;
	for(int i=1; i<=N; i++) if(dist[i]<=abs(P[i]-D)) ans=min(ans, abs(P[i]-D));
	return ans;
}

Compilation message

grader.cpp: In function 'int main()':
grader.cpp:14:12: warning: unused variable 'max_code' [-Wunused-variable]
   14 |  long long max_code;
      |            ^~~~~~~~
grader.cpp:16:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   16 |  scanf("%d%d", &N, &M);
      |  ~~~~~^~~~~~~~~~~~~~~~
grader.cpp:18:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   18 |   scanf("%d", &P[i]);
      |   ~~~~~^~~~~~~~~~~~~
grader.cpp:21:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   21 |  scanf("%d", &Q);
      |  ~~~~~^~~~~~~~~~
grader.cpp:23:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   23 |   scanf("%d", &d);
      |   ~~~~~^~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 95 ms 2296 KB Output is correct
2 Correct 97 ms 3320 KB Output is correct
3 Correct 97 ms 3192 KB Output is correct
4 Correct 95 ms 3192 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 3193 ms 13268 KB Output is correct
10 Correct 2972 ms 10964 KB Output is correct
11 Correct 3001 ms 10060 KB Output is correct
12 Correct 3099 ms 18872 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 95 ms 2296 KB Output is correct
2 Correct 97 ms 3320 KB Output is correct
3 Correct 97 ms 3192 KB Output is correct
4 Correct 95 ms 3192 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 229 ms 3316 KB Output is correct
14 Correct 229 ms 3448 KB Output is correct
15 Correct 222 ms 2936 KB Output is correct
16 Correct 230 ms 3172 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 95 ms 2296 KB Output is correct
2 Correct 97 ms 3320 KB Output is correct
3 Correct 97 ms 3192 KB Output is correct
4 Correct 95 ms 3192 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 3193 ms 13268 KB Output is correct
14 Correct 2972 ms 10964 KB Output is correct
15 Correct 3001 ms 10060 KB Output is correct
16 Correct 3099 ms 18872 KB Output is correct
17 Correct 229 ms 3316 KB Output is correct
18 Correct 229 ms 3448 KB Output is correct
19 Correct 222 ms 2936 KB Output is correct
20 Correct 230 ms 3172 KB Output is correct
21 Execution timed out 4075 ms 3828 KB Time limit exceeded
22 Halted 0 ms 0 KB -