Submission #3211278


Source Code Expand

#include <cstdio>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <map>

using namespace std;

typedef long long ll;

ll H[100005];
ll S[100005];
double t[100005];
int N;

int check(ll score){
	int i;

	for(i=0;i<N;i++){
		if(score-H[i]<0){return 1;}
		t[i]=(double)(score-H[i])/S[i];
	}
	sort(t,t+N);

	for(i=0;i<N;i++){
		if(t[i]<i){return 1;}
	}
	return 0;
}

int main(){

	scanf("%d",&N);

	int i;

	for(i=0;i<N;i++){
		scanf("%lld %lld",&H[i],&S[i]);
	}

	ll l=0ll;
	ll r=110000000000000ll;

	while(l+1<r){
		ll mid=(l+r)/2;
		if(check(mid)==0){
			r=mid;
		}
		else{
			l=mid;
		}
	}
	printf("%lld\n",r);

	return 0;
}

Submission Info

Submission Time
Task D - 射撃王
User tekitouk
Language C++14 (GCC 5.4.1)
Score 100
Code Size 718 Byte
Status AC
Exec Time 356 ms
Memory 2560 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:34:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&N);
                ^
./Main.cpp:39:33: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld %lld",&H[i],&S[i]);
                                 ^

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 30 / 30 70 / 70
Status
AC × 2
AC × 17
AC × 32
Set Name Test Cases
Sample subtask0-sample01.txt, subtask0-sample02.txt
Subtask1 subtask0-sample01.txt, subtask0-sample02.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt
Subtask2 subtask0-sample01.txt, subtask0-sample02.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt, subtask2-01.txt, subtask2-02.txt, subtask2-03.txt, subtask2-04.txt, subtask2-05.txt, subtask2-06.txt, subtask2-07.txt, subtask2-08.txt, subtask2-09.txt, subtask2-10.txt, subtask2-11.txt, subtask2-12.txt, subtask2-13.txt, subtask2-14.txt, subtask2-15.txt
Case Name Status Exec Time Memory
subtask0-sample01.txt AC 1 ms 256 KB
subtask0-sample02.txt AC 1 ms 256 KB
subtask1-01.txt AC 1 ms 256 KB
subtask1-02.txt AC 1 ms 256 KB
subtask1-03.txt AC 1 ms 256 KB
subtask1-04.txt AC 1 ms 256 KB
subtask1-05.txt AC 1 ms 256 KB
subtask1-06.txt AC 1 ms 256 KB
subtask1-07.txt AC 1 ms 256 KB
subtask1-08.txt AC 1 ms 256 KB
subtask1-09.txt AC 1 ms 256 KB
subtask1-10.txt AC 1 ms 256 KB
subtask1-11.txt AC 1 ms 256 KB
subtask1-12.txt AC 1 ms 256 KB
subtask1-13.txt AC 1 ms 256 KB
subtask1-14.txt AC 1 ms 256 KB
subtask1-15.txt AC 1 ms 256 KB
subtask2-01.txt AC 1 ms 256 KB
subtask2-02.txt AC 4 ms 256 KB
subtask2-03.txt AC 7 ms 384 KB
subtask2-04.txt AC 63 ms 768 KB
subtask2-05.txt AC 164 ms 1408 KB
subtask2-06.txt AC 273 ms 2176 KB
subtask2-07.txt AC 316 ms 2304 KB
subtask2-08.txt AC 351 ms 2560 KB
subtask2-09.txt AC 356 ms 2560 KB
subtask2-10.txt AC 348 ms 2560 KB
subtask2-11.txt AC 356 ms 2560 KB
subtask2-12.txt AC 356 ms 2560 KB
subtask2-13.txt AC 349 ms 2560 KB
subtask2-14.txt AC 341 ms 2560 KB
subtask2-15.txt AC 350 ms 2560 KB