oj.uz

답안 #278746

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
278746 2020-08-21T18:01:58 Z arnold518 Circus (Balkan15_CIRCUS) C++14
0 / 100
 153 ms 5752 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;
		printf("%d %d\n", 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);
      |   ~~~~~^~~~~~~~~~

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 153 ms 5752 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 153 ms 5752 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 153 ms 5752 KB Output isn't correct
2 Halted 0 ms 0 KB -