답안 #99323

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
99323 2019-03-02T14:28:37 Z TadijaSebez Arranging Tickets (JOI17_arranging_tickets) C++11
100 / 100
2001 ms 13792 KB
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N=200050;
int n,m,a[N],b[N],c[N];
int heap[N],tsz;
void Push(int x)
{
	++tsz;int i;
	for(i=tsz;i>1 && b[x]>b[heap[i>>1]];i>>=1) heap[i]=heap[i>>1];
	heap[i]=x;
}
void Pop()
{
	int tmp=heap[tsz--],i,j;
	for(i=1;i*2<=tsz;i=j)
	{
		j=i*2;
		if(j!=tsz && b[heap[j+1]]>b[heap[j]]) j++;
		if(b[heap[j]]>b[tmp]) heap[i]=heap[j];
		else break;
	}
	heap[i]=tmp;
}
ll sum[N],need[N],add[N],ost[N];
vector<int> ids[N];
bool Check(ll mid, int pos, ll flip)
{
	for(int i=1;i<=n;i++) add[i]=0;
	for(int i=1;i<pos;i++) need[i]=(sum[i]+flip-mid+1)/2;
	need[pos]=flip;
	tsz=0;
	ll done=0;
	for(int i=1;i<=pos;i++)
	{
		for(int j:ids[i]) if(a[j]<=pos && pos<b[j]) Push(j),ost[j]=c[j];
		while(tsz && done<need[i])
		{
			int j=heap[1];
			ll work=min(ost[j],need[i]-done);
			done+=work;
			ost[j]-=work;
			add[1]+=work;
			add[a[j]]-=2*work;
			add[b[j]]+=2*work;
			if(!ost[j]) Pop();
		}
		if(done<need[i]) return 0;
	}
	for(int i=1;i<=n;i++)
	{
		add[i]+=add[i-1];
		if(add[i]+sum[i]>mid) return 0;
	}
	return 1;
}
int main()
{
	scanf("%i %i",&n,&m);
	for(int i=1;i<=m;i++)
	{
		scanf("%i %i %i",&a[i],&b[i],&c[i]);
		if(a[i]>b[i]) swap(a[i],b[i]);
		sum[a[i]]+=c[i];
		sum[b[i]]-=c[i];
		ids[a[i]].push_back(i);
	}
	int fir=0,las=0;
	for(int i=1;i<=n;i++)
	{
		sum[i]+=sum[i-1];
		if(sum[i]>sum[fir]) fir=i;
		if(sum[i]==sum[fir]) las=i;
	}
	ll top=sum[fir],bot=0,mid,ans=top;
	while(top>=bot)
	{
		mid=top+bot>>1;
		if(Check(mid,fir,sum[fir]-mid)||Check(mid,fir,sum[fir]-mid+1)
		 ||Check(mid,las,sum[las]-mid)||Check(mid,las,sum[las]-mid+1)) ans=mid,top=mid-1;
		else bot=mid+1;
	}
	printf("%lld\n",ans);
	return 0;
}

Compilation message

arranging_tickets.cpp: In function 'int main()':
arranging_tickets.cpp:59:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%i %i",&n,&m);
  ~~~~~^~~~~~~~~~~~~~~
arranging_tickets.cpp:62:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%i %i %i",&a[i],&b[i],&c[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 4992 KB Output is correct
2 Correct 6 ms 4992 KB Output is correct
3 Correct 7 ms 5120 KB Output is correct
4 Correct 8 ms 5120 KB Output is correct
5 Correct 7 ms 5000 KB Output is correct
6 Correct 6 ms 4992 KB Output is correct
7 Correct 6 ms 5120 KB Output is correct
8 Correct 6 ms 5120 KB Output is correct
9 Correct 7 ms 4992 KB Output is correct
10 Correct 7 ms 5120 KB Output is correct
11 Correct 6 ms 4992 KB Output is correct
12 Correct 7 ms 5120 KB Output is correct
13 Correct 6 ms 5120 KB Output is correct
14 Correct 7 ms 5120 KB Output is correct
15 Correct 8 ms 5248 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 4992 KB Output is correct
2 Correct 6 ms 4992 KB Output is correct
3 Correct 7 ms 5120 KB Output is correct
4 Correct 8 ms 5120 KB Output is correct
5 Correct 7 ms 5000 KB Output is correct
6 Correct 6 ms 4992 KB Output is correct
7 Correct 6 ms 5120 KB Output is correct
8 Correct 6 ms 5120 KB Output is correct
9 Correct 7 ms 4992 KB Output is correct
10 Correct 7 ms 5120 KB Output is correct
11 Correct 6 ms 4992 KB Output is correct
12 Correct 7 ms 5120 KB Output is correct
13 Correct 6 ms 5120 KB Output is correct
14 Correct 7 ms 5120 KB Output is correct
15 Correct 8 ms 5248 KB Output is correct
16 Correct 8 ms 5120 KB Output is correct
17 Correct 8 ms 5120 KB Output is correct
18 Correct 8 ms 5120 KB Output is correct
19 Correct 7 ms 5120 KB Output is correct
20 Correct 8 ms 5120 KB Output is correct
21 Correct 8 ms 5120 KB Output is correct
22 Correct 7 ms 5120 KB Output is correct
23 Correct 7 ms 5120 KB Output is correct
24 Correct 6 ms 5120 KB Output is correct
25 Correct 7 ms 5120 KB Output is correct
26 Correct 8 ms 5120 KB Output is correct
27 Correct 7 ms 5120 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 4992 KB Output is correct
2 Correct 6 ms 4992 KB Output is correct
3 Correct 7 ms 5120 KB Output is correct
4 Correct 8 ms 5120 KB Output is correct
5 Correct 7 ms 5000 KB Output is correct
6 Correct 6 ms 4992 KB Output is correct
7 Correct 6 ms 5120 KB Output is correct
8 Correct 6 ms 5120 KB Output is correct
9 Correct 7 ms 4992 KB Output is correct
10 Correct 7 ms 5120 KB Output is correct
11 Correct 6 ms 4992 KB Output is correct
12 Correct 7 ms 5120 KB Output is correct
13 Correct 6 ms 5120 KB Output is correct
14 Correct 7 ms 5120 KB Output is correct
15 Correct 8 ms 5248 KB Output is correct
16 Correct 8 ms 5120 KB Output is correct
17 Correct 8 ms 5120 KB Output is correct
18 Correct 8 ms 5120 KB Output is correct
19 Correct 7 ms 5120 KB Output is correct
20 Correct 8 ms 5120 KB Output is correct
21 Correct 8 ms 5120 KB Output is correct
22 Correct 7 ms 5120 KB Output is correct
23 Correct 7 ms 5120 KB Output is correct
24 Correct 6 ms 5120 KB Output is correct
25 Correct 7 ms 5120 KB Output is correct
26 Correct 8 ms 5120 KB Output is correct
27 Correct 7 ms 5120 KB Output is correct
28 Correct 10 ms 5248 KB Output is correct
29 Correct 11 ms 5248 KB Output is correct
30 Correct 11 ms 5248 KB Output is correct
31 Correct 11 ms 5248 KB Output is correct
32 Correct 12 ms 5248 KB Output is correct
33 Correct 11 ms 5248 KB Output is correct
34 Correct 11 ms 5248 KB Output is correct
35 Correct 12 ms 5120 KB Output is correct
36 Correct 12 ms 5248 KB Output is correct
37 Correct 9 ms 5248 KB Output is correct
38 Correct 10 ms 5376 KB Output is correct
39 Correct 8 ms 5376 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 4992 KB Output is correct
2 Correct 6 ms 4992 KB Output is correct
3 Correct 7 ms 5120 KB Output is correct
4 Correct 8 ms 5120 KB Output is correct
5 Correct 7 ms 5000 KB Output is correct
6 Correct 6 ms 4992 KB Output is correct
7 Correct 6 ms 5120 KB Output is correct
8 Correct 6 ms 5120 KB Output is correct
9 Correct 7 ms 4992 KB Output is correct
10 Correct 7 ms 5120 KB Output is correct
11 Correct 6 ms 4992 KB Output is correct
12 Correct 7 ms 5120 KB Output is correct
13 Correct 6 ms 5120 KB Output is correct
14 Correct 7 ms 5120 KB Output is correct
15 Correct 8 ms 5248 KB Output is correct
16 Correct 8 ms 5120 KB Output is correct
17 Correct 8 ms 5120 KB Output is correct
18 Correct 8 ms 5120 KB Output is correct
19 Correct 7 ms 5120 KB Output is correct
20 Correct 8 ms 5120 KB Output is correct
21 Correct 8 ms 5120 KB Output is correct
22 Correct 7 ms 5120 KB Output is correct
23 Correct 7 ms 5120 KB Output is correct
24 Correct 6 ms 5120 KB Output is correct
25 Correct 7 ms 5120 KB Output is correct
26 Correct 8 ms 5120 KB Output is correct
27 Correct 7 ms 5120 KB Output is correct
28 Correct 10 ms 5248 KB Output is correct
29 Correct 11 ms 5248 KB Output is correct
30 Correct 11 ms 5248 KB Output is correct
31 Correct 11 ms 5248 KB Output is correct
32 Correct 12 ms 5248 KB Output is correct
33 Correct 11 ms 5248 KB Output is correct
34 Correct 11 ms 5248 KB Output is correct
35 Correct 12 ms 5120 KB Output is correct
36 Correct 12 ms 5248 KB Output is correct
37 Correct 9 ms 5248 KB Output is correct
38 Correct 10 ms 5376 KB Output is correct
39 Correct 8 ms 5376 KB Output is correct
40 Correct 371 ms 13252 KB Output is correct
41 Correct 437 ms 13660 KB Output is correct
42 Correct 364 ms 12664 KB Output is correct
43 Correct 628 ms 13008 KB Output is correct
44 Correct 308 ms 13560 KB Output is correct
45 Correct 683 ms 12536 KB Output is correct
46 Correct 401 ms 12860 KB Output is correct
47 Correct 113 ms 13176 KB Output is correct
48 Correct 164 ms 12468 KB Output is correct
49 Correct 148 ms 11384 KB Output is correct
50 Correct 100 ms 12344 KB Output is correct
51 Correct 108 ms 11748 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 4992 KB Output is correct
2 Correct 6 ms 4992 KB Output is correct
3 Correct 7 ms 5120 KB Output is correct
4 Correct 8 ms 5120 KB Output is correct
5 Correct 7 ms 5000 KB Output is correct
6 Correct 6 ms 4992 KB Output is correct
7 Correct 6 ms 5120 KB Output is correct
8 Correct 6 ms 5120 KB Output is correct
9 Correct 7 ms 4992 KB Output is correct
10 Correct 7 ms 5120 KB Output is correct
11 Correct 6 ms 4992 KB Output is correct
12 Correct 7 ms 5120 KB Output is correct
13 Correct 6 ms 5120 KB Output is correct
14 Correct 7 ms 5120 KB Output is correct
15 Correct 8 ms 5248 KB Output is correct
16 Correct 8 ms 5120 KB Output is correct
17 Correct 8 ms 5120 KB Output is correct
18 Correct 8 ms 5120 KB Output is correct
19 Correct 7 ms 5120 KB Output is correct
20 Correct 8 ms 5120 KB Output is correct
21 Correct 8 ms 5120 KB Output is correct
22 Correct 7 ms 5120 KB Output is correct
23 Correct 7 ms 5120 KB Output is correct
24 Correct 6 ms 5120 KB Output is correct
25 Correct 7 ms 5120 KB Output is correct
26 Correct 8 ms 5120 KB Output is correct
27 Correct 7 ms 5120 KB Output is correct
28 Correct 10 ms 5248 KB Output is correct
29 Correct 11 ms 5248 KB Output is correct
30 Correct 11 ms 5248 KB Output is correct
31 Correct 11 ms 5248 KB Output is correct
32 Correct 12 ms 5248 KB Output is correct
33 Correct 11 ms 5248 KB Output is correct
34 Correct 11 ms 5248 KB Output is correct
35 Correct 12 ms 5120 KB Output is correct
36 Correct 12 ms 5248 KB Output is correct
37 Correct 9 ms 5248 KB Output is correct
38 Correct 10 ms 5376 KB Output is correct
39 Correct 8 ms 5376 KB Output is correct
40 Correct 371 ms 13252 KB Output is correct
41 Correct 437 ms 13660 KB Output is correct
42 Correct 364 ms 12664 KB Output is correct
43 Correct 628 ms 13008 KB Output is correct
44 Correct 308 ms 13560 KB Output is correct
45 Correct 683 ms 12536 KB Output is correct
46 Correct 401 ms 12860 KB Output is correct
47 Correct 113 ms 13176 KB Output is correct
48 Correct 164 ms 12468 KB Output is correct
49 Correct 148 ms 11384 KB Output is correct
50 Correct 100 ms 12344 KB Output is correct
51 Correct 108 ms 11748 KB Output is correct
52 Correct 708 ms 13792 KB Output is correct
53 Correct 1045 ms 13048 KB Output is correct
54 Correct 1989 ms 13520 KB Output is correct
55 Correct 569 ms 13560 KB Output is correct
56 Correct 1440 ms 12868 KB Output is correct
57 Correct 2001 ms 13176 KB Output is correct
58 Correct 834 ms 13560 KB Output is correct
59 Correct 1077 ms 11004 KB Output is correct