Submission #41775799


Source Code Expand

#include <bits/stdc++.h>
#define int __int128
#define pb push_back
using namespace std;
class fastIO{private:char ibuf[50007],*p1=ibuf,*p2=ibuf,obuf[50007],*p3=obuf,sta[50];bool file_end=false;char get(){return p1==p2&&(p2=(p1=ibuf)+fread(ibuf,1,50007,stdin),p1==p2)?(file_end=true),char(EOF):*p1++;}void put(const char x){p3-obuf<50007?*p3++=x:(fwrite(obuf,p3-obuf,1,stdout),p3=obuf,*p3++=x);}public:explicit operator bool(){return!file_end;}size_t flush(){size_t f=fwrite(obuf,p3-obuf,1,stdout);p3=obuf;*p3=0;return f;}fastIO&operator>>(char&t){for(t=get();!isgraph(t);t=get());return*this;}template<typename any>typename std::enable_if<std::is_same<any,char>::value,any>::type tpval(){char t;for(t=get();!isgraph(t);t=get());return t;}fastIO&operator>>(char*t){char c;for(c=get();!isgraph(c);c=get());for(;isgraph(c);c=get())*t=c,t++;*t=0;return*this;}fastIO&operator>>(std::string&t){t.clear();char c;for(c=get();!isgraph(c);c=get());for(;isgraph(c);c=get())t+=c;return*this;}template<typename any>typename std::enable_if<std::is_same<any,std::string>::value,any>::type tpval(){std::string t;char c;for(c=get();!isgraph(c);c=get());for(;isgraph(c);c=get())t+=c;return t;}template<typename any>typename std::enable_if<(std::is_signed<any>::value&&std::is_integral<any>::value&&!std::is_same<any,char>::value)||std::is_same<any,__int128_t>::value,fastIO>::type&operator>>(any&t){t=0;bool y=0;char c=get();for(;!isdigit(c);c=get())if(c==45)y=true;for(;isdigit(c);c=get())t=t*10+c-48;if(y==1)t=-t;return*this;}template<typename any>typename std::enable_if<(std::is_signed<any>::value&&std::is_integral<any>::value&&!std::is_same<any,char>::value)||std::is_same<any,__int128_t>::value,any>::type tpval(){any t=0;bool y=0;char c=get();for(;!isdigit(c);c=get())if(c==45)y=true;for(;isdigit(c);c=get())t=t*10+c-48;if(y==1)t=-t;return t;}template<typename any>typename std::enable_if<(std::is_unsigned<any>::value&&std::is_integral<any>::value&&!std::is_same<any,char>::value)||std::is_same<any,__uint128_t>::value,fastIO>::type&operator>>(any&t){t=0;char c=get();for(;!isdigit(c);c=get());for(;isdigit(c);c=get())t=t*10+c-48;return*this;}template<typename any>typename std::enable_if<(std::is_unsigned<any>::value&&std::is_integral<any>::value&&!std::is_same<any,char>::value)||std::is_same<any,__uint128_t>::value,any>::type tpval(){any t=0;char c=get();for(;!isdigit(c);c=get());for(;isdigit(c);c=get())t=t*10+c-48;return t;}template<typename any1,typename any2>fastIO&operator>>(std::pair<any1,any2>&t){return*this>>t.first>>t.second;}template<typename any1,typename any2>std::pair<any1,any2>tpval(){return std::pair<any1,any2>(tpval<any1>(),tpval<any2>());}template<typename any>fastIO&read(any&t){return*this>>t;}fastIO&read(char*t){char c;for(c=get();!isgraph(c);c=get());for(;isgraph(c);c=get())*t=c,t++;*t=0;return*this;}template<typename any,typename...args>fastIO&read(any&t1,args&...t2){return(*this>>t1).read(t2...);}fastIO&operator<<(const char t){put(t);return*this;}fastIO&operator<<(const char*t){for(;*t;t++)put(*t);return*this;}fastIO&operator<<(const std::string&t){for(const char it:t)put(it);return*this;}template<typename any>typename std::enable_if<(std::is_signed<any>::value&&std::is_integral<any>::value&&!std::is_same<any,char>::value)||std::is_same<any,__int128_t>::value,fastIO>::type&operator<<(any t){if(!t){put(48);return*this;}int len=0;if(t<0)t=-t,put(45);while(t)sta[len++]=char(t%10+48),t/=10;while(len--)put(sta[len]);return*this;}template<typename any>typename std::enable_if<(std::is_unsigned<any>::value&&std::is_integral<any>::value&&!std::is_same<any,char>::value)||std::is_same<any,__uint128_t>::value,fastIO>::type&operator<<(any t){if(!t){put(48);return*this;}int len=0;while(t)sta[len++]=char(t%10+48),t/=10;while(len--)put(sta[len]);return*this;}template<typename any1,typename any2>fastIO&operator<<(const std::pair<any1,any2>&t){return*this<<t.first<<' '<<t.second;}template<typename any>fastIO&write(const any&t){return*this<<t;}template<typename any,typename...args>fastIO&write(const any&t1,const args&...t2){return(*this<<t1).write(t2...);}~fastIO(){fwrite(obuf,p3-obuf,1,stdout);}}fio;
#define cin fio
#define cout fio
const int INF=1e6+5;
struct P3{
	int t,d,t1;
}aa[INF];
int n,h,Max[INF],Max1[INF];
int calc(int l,int r,int li) {
	if (l>r) return 0;
//	if (l+r>=li*2) return li+1;
	return (l+r)*(r-l+1)/2;
}
int check(int x) {
	int sum=0;
	int xx=(x-aa[n].t);
	xx=max((int)(0),xx);
	if (xx && Max[n]>h/xx) return 1;
	sum+=Max[n]*xx;
	x-=xx;
//	cout<<sum<<" qwej\n";
	if (sum>=h) return 1;
	for (int i=n;i;i--) {
		if (x<=aa[i-1].t) continue;
		int xx=(x-aa[i-1].t);
		xx=max((int)(0),xx);
//		cout<<calc(aa[i-1].t+1,x,h/Max1[i])<<" "<<Max1[i]<<" ok?12312313\n";
		if (calc(aa[i-1].t+1,x,h/Max1[i])>h/Max1[i]) return 1;
		if (xx && Max[i-1]>h/xx) return 1;
//		cout<<sum<<" ok?\n";
		sum+=max(calc(aa[i-1].t+1,x,h/Max1[i])*Max1[i],Max[i-1]*xx);
		x-=xx;
		if (sum>=h) return 1;
	}
	
	return sum>=h;
}
signed main()
{
	ios::sync_with_stdio(false);
	cin>>n>>h;
	for (int i=1;i<=n;i++) cin>>aa[i].t>>aa[i].d,aa[i].t1=aa[i].t*aa[i].d;
	sort(aa+1,aa+1+n,[](P3 xx,P3 yy){return xx.t<yy.t;});
	for (int i=1;i<=n;i++) Max[i]=max(Max[i-1],aa[i].t1);
	for (int i=n;i;i--) Max1[i]=max(Max1[i+1],aa[i].d);
	int l=0,r=2e18,ans=-1;
	while (l<=r) {
		int Mid=(l+r)>>1;
		if (check(Mid)) r=(ans=Mid)-1;
		else l=Mid+1;
	}
	if (ans==-1) return 1;
	cout<<ans<<"\n";
	return 0;
}

Submission Info

Submission Time
Task F - Damage over Time
User fzx6
Language C++ (GCC 9.2.1)
Score 0
Code Size 5470 Byte
Status WA
Exec Time 305 ms
Memory 27132 KiB

Compile Error

./Main.cpp: In function ‘__int128 calc(__int128, __int128, __int128)’:
./Main.cpp:13:26: warning: unused parameter ‘li’ [-Wunused-parameter]
   13 | int calc(int l,int r,int li) {
      |                          ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 525
Status
AC × 2
AC × 39
WA × 1
Set Name Test Cases
Sample 00_sample_00.txt, 00_sample_01.txt
All 00_sample_00.txt, 00_sample_01.txt, 01_rnd_00.txt, 01_rnd_01.txt, 01_rnd_02.txt, 01_rnd_03.txt, 01_rnd_04.txt, 01_rnd_05.txt, 01_rnd_06.txt, 01_rnd_07.txt, 01_rnd_08.txt, 01_rnd_09.txt, 02_minmax_00.txt, 02_minmax_01.txt, 02_minmax_02.txt, 02_minmax_03.txt, 02_minmax_04.txt, 02_minmax_05.txt, 02_minmax_06.txt, 02_minmax_07.txt, 03_special_00.txt, 03_special_01.txt, 03_special_02.txt, 03_special_03.txt, 03_special_04.txt, 03_special_05.txt, 03_special_06.txt, 03_special_07.txt, 03_special_08.txt, 03_special_09.txt, 03_special_10.txt, 03_special_11.txt, 03_special_12.txt, 03_special_13.txt, 03_special_14.txt, 03_special_15.txt, 03_special_16.txt, 03_special_17.txt, 03_special_18.txt, 03_special_19.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 6 ms 3500 KiB
00_sample_01.txt AC 5 ms 3560 KiB
01_rnd_00.txt AC 123 ms 27100 KiB
01_rnd_01.txt AC 120 ms 26924 KiB
01_rnd_02.txt AC 120 ms 27100 KiB
01_rnd_03.txt AC 121 ms 27096 KiB
01_rnd_04.txt AC 122 ms 27100 KiB
01_rnd_05.txt AC 107 ms 27056 KiB
01_rnd_06.txt AC 97 ms 27040 KiB
01_rnd_07.txt AC 104 ms 27048 KiB
01_rnd_08.txt AC 95 ms 27048 KiB
01_rnd_09.txt AC 99 ms 27132 KiB
02_minmax_00.txt AC 51 ms 26916 KiB
02_minmax_01.txt AC 54 ms 27104 KiB
02_minmax_02.txt AC 103 ms 26980 KiB
02_minmax_03.txt AC 110 ms 27048 KiB
02_minmax_04.txt AC 140 ms 26916 KiB
02_minmax_05.txt AC 80 ms 27004 KiB
02_minmax_06.txt AC 105 ms 26984 KiB
02_minmax_07.txt AC 108 ms 27100 KiB
03_special_00.txt AC 290 ms 26980 KiB
03_special_01.txt AC 296 ms 26984 KiB
03_special_02.txt AC 284 ms 27044 KiB
03_special_03.txt WA 305 ms 26932 KiB
03_special_04.txt AC 287 ms 27100 KiB
03_special_05.txt AC 272 ms 26932 KiB
03_special_06.txt AC 282 ms 27100 KiB
03_special_07.txt AC 271 ms 27048 KiB
03_special_08.txt AC 280 ms 26976 KiB
03_special_09.txt AC 288 ms 27112 KiB
03_special_10.txt AC 195 ms 26976 KiB
03_special_11.txt AC 140 ms 27000 KiB
03_special_12.txt AC 124 ms 27132 KiB
03_special_13.txt AC 119 ms 26920 KiB
03_special_14.txt AC 116 ms 27000 KiB
03_special_15.txt AC 114 ms 26972 KiB
03_special_16.txt AC 109 ms 27040 KiB
03_special_17.txt AC 111 ms 27040 KiB
03_special_18.txt AC 107 ms 27056 KiB
03_special_19.txt AC 107 ms 27048 KiB