oj.uz

Submission #99322

# Submission time Handle Problem Language Result Execution time Memory
99322 2019-03-02T14:22:44 Z TadijaSebez Arranging Tickets (JOI17_arranging_tickets) C++11
100 / 100
 2087 ms 15860 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)
{
	heap[++tsz]=x;
	for(int i=tsz;i>1 && b[heap[i]]>b[heap[i>>1]];i>>=1) swap(heap[i],heap[i>>1]);
}
void Pop()
{
	heap[1]=heap[tsz--];
	for(int i=1,j;i*2<=tsz;i=j)
	{
		j=i*2;
		if(j!=tsz && b[heap[j+1]]>b[heap[j]]) j++;
		if(b[heap[j]]>b[heap[i]]) swap(heap[i],heap[j]);
		else break;
	}
}
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:57: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:60: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]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5120 KB Output is correct
2 Correct 6 ms 4992 KB Output is correct
3 Correct 8 ms 4992 KB Output is correct
4 Correct 9 ms 5120 KB Output is correct
5 Correct 8 ms 4992 KB Output is correct
6 Correct 7 ms 4992 KB Output is correct
7 Correct 8 ms 4988 KB Output is correct
8 Correct 9 ms 4992 KB Output is correct
9 Correct 8 ms 5120 KB Output is correct
10 Correct 6 ms 4992 KB Output is correct
11 Correct 6 ms 4992 KB Output is correct
12 Correct 6 ms 4992 KB Output is correct
13 Correct 7 ms 4992 KB Output is correct
14 Correct 7 ms 5120 KB Output is correct
15 Correct 8 ms 5120 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5120 KB Output is correct
2 Correct 6 ms 4992 KB Output is correct
3 Correct 8 ms 4992 KB Output is correct
4 Correct 9 ms 5120 KB Output is correct
5 Correct 8 ms 4992 KB Output is correct
6 Correct 7 ms 4992 KB Output is correct
7 Correct 8 ms 4988 KB Output is correct
8 Correct 9 ms 4992 KB Output is correct
9 Correct 8 ms 5120 KB Output is correct
10 Correct 6 ms 4992 KB Output is correct
11 Correct 6 ms 4992 KB Output is correct
12 Correct 6 ms 4992 KB Output is correct
13 Correct 7 ms 4992 KB Output is correct
14 Correct 7 ms 5120 KB Output is correct
15 Correct 8 ms 5120 KB Output is correct
16 Correct 7 ms 5120 KB Output is correct
17 Correct 8 ms 5120 KB Output is correct
18 Correct 8 ms 5068 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 5 ms 5068 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 7 ms 5104 KB Output is correct
27 Correct 8 ms 5120 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5120 KB Output is correct
2 Correct 6 ms 4992 KB Output is correct
3 Correct 8 ms 4992 KB Output is correct
4 Correct 9 ms 5120 KB Output is correct
5 Correct 8 ms 4992 KB Output is correct
6 Correct 7 ms 4992 KB Output is correct
7 Correct 8 ms 4988 KB Output is correct
8 Correct 9 ms 4992 KB Output is correct
9 Correct 8 ms 5120 KB Output is correct
10 Correct 6 ms 4992 KB Output is correct
11 Correct 6 ms 4992 KB Output is correct
12 Correct 6 ms 4992 KB Output is correct
13 Correct 7 ms 4992 KB Output is correct
14 Correct 7 ms 5120 KB Output is correct
15 Correct 8 ms 5120 KB Output is correct
16 Correct 7 ms 5120 KB Output is correct
17 Correct 8 ms 5120 KB Output is correct
18 Correct 8 ms 5068 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 5 ms 5068 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 7 ms 5104 KB Output is correct
27 Correct 8 ms 5120 KB Output is correct
28 Correct 10 ms 5248 KB Output is correct
29 Correct 13 ms 5296 KB Output is correct
30 Correct 12 ms 5248 KB Output is correct
31 Correct 10 ms 5248 KB Output is correct
32 Correct 12 ms 5376 KB Output is correct
33 Correct 10 ms 5248 KB Output is correct
34 Correct 11 ms 5248 KB Output is correct
35 Correct 12 ms 5248 KB Output is correct
36 Correct 10 ms 5248 KB Output is correct
37 Correct 9 ms 5248 KB Output is correct
38 Correct 9 ms 5248 KB Output is correct
39 Correct 9 ms 5248 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5120 KB Output is correct
2 Correct 6 ms 4992 KB Output is correct
3 Correct 8 ms 4992 KB Output is correct
4 Correct 9 ms 5120 KB Output is correct
5 Correct 8 ms 4992 KB Output is correct
6 Correct 7 ms 4992 KB Output is correct
7 Correct 8 ms 4988 KB Output is correct
8 Correct 9 ms 4992 KB Output is correct
9 Correct 8 ms 5120 KB Output is correct
10 Correct 6 ms 4992 KB Output is correct
11 Correct 6 ms 4992 KB Output is correct
12 Correct 6 ms 4992 KB Output is correct
13 Correct 7 ms 4992 KB Output is correct
14 Correct 7 ms 5120 KB Output is correct
15 Correct 8 ms 5120 KB Output is correct
16 Correct 7 ms 5120 KB Output is correct
17 Correct 8 ms 5120 KB Output is correct
18 Correct 8 ms 5068 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 5 ms 5068 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 7 ms 5104 KB Output is correct
27 Correct 8 ms 5120 KB Output is correct
28 Correct 10 ms 5248 KB Output is correct
29 Correct 13 ms 5296 KB Output is correct
30 Correct 12 ms 5248 KB Output is correct
31 Correct 10 ms 5248 KB Output is correct
32 Correct 12 ms 5376 KB Output is correct
33 Correct 10 ms 5248 KB Output is correct
34 Correct 11 ms 5248 KB Output is correct
35 Correct 12 ms 5248 KB Output is correct
36 Correct 10 ms 5248 KB Output is correct
37 Correct 9 ms 5248 KB Output is correct
38 Correct 9 ms 5248 KB Output is correct
39 Correct 9 ms 5248 KB Output is correct
40 Correct 449 ms 14644 KB Output is correct
41 Correct 462 ms 15020 KB Output is correct
42 Correct 369 ms 14044 KB Output is correct
43 Correct 600 ms 14324 KB Output is correct
44 Correct 265 ms 14840 KB Output is correct
45 Correct 680 ms 13812 KB Output is correct
46 Correct 461 ms 14156 KB Output is correct
47 Correct 116 ms 14584 KB Output is correct
48 Correct 127 ms 13624 KB Output is correct
49 Correct 112 ms 12664 KB Output is correct
50 Correct 90 ms 13688 KB Output is correct
51 Correct 122 ms 12920 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5120 KB Output is correct
2 Correct 6 ms 4992 KB Output is correct
3 Correct 8 ms 4992 KB Output is correct
4 Correct 9 ms 5120 KB Output is correct
5 Correct 8 ms 4992 KB Output is correct
6 Correct 7 ms 4992 KB Output is correct
7 Correct 8 ms 4988 KB Output is correct
8 Correct 9 ms 4992 KB Output is correct
9 Correct 8 ms 5120 KB Output is correct
10 Correct 6 ms 4992 KB Output is correct
11 Correct 6 ms 4992 KB Output is correct
12 Correct 6 ms 4992 KB Output is correct
13 Correct 7 ms 4992 KB Output is correct
14 Correct 7 ms 5120 KB Output is correct
15 Correct 8 ms 5120 KB Output is correct
16 Correct 7 ms 5120 KB Output is correct
17 Correct 8 ms 5120 KB Output is correct
18 Correct 8 ms 5068 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 5 ms 5068 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 7 ms 5104 KB Output is correct
27 Correct 8 ms 5120 KB Output is correct
28 Correct 10 ms 5248 KB Output is correct
29 Correct 13 ms 5296 KB Output is correct
30 Correct 12 ms 5248 KB Output is correct
31 Correct 10 ms 5248 KB Output is correct
32 Correct 12 ms 5376 KB Output is correct
33 Correct 10 ms 5248 KB Output is correct
34 Correct 11 ms 5248 KB Output is correct
35 Correct 12 ms 5248 KB Output is correct
36 Correct 10 ms 5248 KB Output is correct
37 Correct 9 ms 5248 KB Output is correct
38 Correct 9 ms 5248 KB Output is correct
39 Correct 9 ms 5248 KB Output is correct
40 Correct 449 ms 14644 KB Output is correct
41 Correct 462 ms 15020 KB Output is correct
42 Correct 369 ms 14044 KB Output is correct
43 Correct 600 ms 14324 KB Output is correct
44 Correct 265 ms 14840 KB Output is correct
45 Correct 680 ms 13812 KB Output is correct
46 Correct 461 ms 14156 KB Output is correct
47 Correct 116 ms 14584 KB Output is correct
48 Correct 127 ms 13624 KB Output is correct
49 Correct 112 ms 12664 KB Output is correct
50 Correct 90 ms 13688 KB Output is correct
51 Correct 122 ms 12920 KB Output is correct
52 Correct 871 ms 15860 KB Output is correct
53 Correct 1155 ms 15068 KB Output is correct
54 Correct 2087 ms 15616 KB Output is correct
55 Correct 678 ms 15608 KB Output is correct
56 Correct 1559 ms 14884 KB Output is correct
57 Correct 1968 ms 15168 KB Output is correct
58 Correct 983 ms 15428 KB Output is correct
59 Correct 1322 ms 13176 KB Output is correct