Submission #402377


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

int N;
int H[100000], S[100000];

int main() {
	scanf("%d", &N);
	for (int i = 0; i < N; i++) {
		scanf("%d%d", H + i, S + i);
	}
	
	long long l, m, h;
	l = -1, h = 1000000000000000001;
	while (l + 1 < h) {
		m = (l + h) / 2;
		bool f = 1;
		vector<long long> v;
		for (int i = 0; i < N; i++) {
			v.push_back((m - H[i]) / S[i]);
			if (m - H[i] < 0) v[i] = -1;
		}
		sort(v.begin(), v.end());
		for (int i = 0; i < N; i++) {
			if (v[i] < i) {
				f = 0;
				break;
			}
		}
		if (!f) {
			l = m;
		} else {
			h = m;
		}
	}
	
	printf("%lld\n", h);
	
	return 0;
}

Submission Info

Submission Time
Task D - 射撃王
User donkey
Language C++11 (GCC 4.9.2)
Score 100
Code Size 654 Byte
Status AC
Exec Time 993 ms
Memory 3396 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:8:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
                 ^
./Main.cpp:10:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", 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 24 ms 800 KB
subtask0-sample02.txt AC 22 ms 928 KB
subtask1-01.txt AC 22 ms 924 KB
subtask1-02.txt AC 22 ms 804 KB
subtask1-03.txt AC 22 ms 932 KB
subtask1-04.txt AC 24 ms 808 KB
subtask1-05.txt AC 26 ms 800 KB
subtask1-06.txt AC 24 ms 808 KB
subtask1-07.txt AC 24 ms 812 KB
subtask1-08.txt AC 23 ms 804 KB
subtask1-09.txt AC 25 ms 920 KB
subtask1-10.txt AC 24 ms 804 KB
subtask1-11.txt AC 22 ms 804 KB
subtask1-12.txt AC 22 ms 932 KB
subtask1-13.txt AC 23 ms 928 KB
subtask1-14.txt AC 23 ms 928 KB
subtask1-15.txt AC 23 ms 924 KB
subtask2-01.txt AC 24 ms 804 KB
subtask2-02.txt AC 30 ms 840 KB
subtask2-03.txt AC 44 ms 800 KB
subtask2-04.txt AC 204 ms 1368 KB
subtask2-05.txt AC 483 ms 2092 KB
subtask2-06.txt AC 798 ms 3080 KB
subtask2-07.txt AC 899 ms 3220 KB
subtask2-08.txt AC 984 ms 3380 KB
subtask2-09.txt AC 990 ms 3384 KB
subtask2-10.txt AC 933 ms 3396 KB
subtask2-11.txt AC 486 ms 3376 KB
subtask2-12.txt AC 993 ms 3380 KB
subtask2-13.txt AC 979 ms 3380 KB
subtask2-14.txt AC 981 ms 3376 KB
subtask2-15.txt AC 985 ms 3368 KB