Submission #402356


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 = 0, 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]);
		}
		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 0
Code Size 620 Byte
Status WA
Exec Time 1066 ms
Memory 3748 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 0 / 30 0 / 70
Status
AC × 2
AC × 12
WA × 5
AC × 26
WA × 6
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 118 ms 1224 KB
subtask0-sample02.txt AC 33 ms 1280 KB
subtask1-01.txt AC 33 ms 1164 KB
subtask1-02.txt AC 33 ms 1228 KB
subtask1-03.txt WA 35 ms 1172 KB
subtask1-04.txt AC 34 ms 1220 KB
subtask1-05.txt AC 34 ms 1260 KB
subtask1-06.txt WA 34 ms 1224 KB
subtask1-07.txt WA 34 ms 1256 KB
subtask1-08.txt AC 34 ms 1228 KB
subtask1-09.txt AC 34 ms 1180 KB
subtask1-10.txt AC 34 ms 1232 KB
subtask1-11.txt AC 34 ms 1232 KB
subtask1-12.txt WA 32 ms 1228 KB
subtask1-13.txt AC 33 ms 1248 KB
subtask1-14.txt AC 33 ms 1232 KB
subtask1-15.txt WA 34 ms 1228 KB
subtask2-01.txt AC 35 ms 1224 KB
subtask2-02.txt AC 41 ms 1220 KB
subtask2-03.txt WA 54 ms 1376 KB
subtask2-04.txt AC 214 ms 1728 KB
subtask2-05.txt AC 521 ms 2456 KB
subtask2-06.txt AC 825 ms 3448 KB
subtask2-07.txt AC 943 ms 3604 KB
subtask2-08.txt AC 1031 ms 3740 KB
subtask2-09.txt AC 1066 ms 3744 KB
subtask2-10.txt AC 995 ms 3744 KB
subtask2-11.txt AC 509 ms 3740 KB
subtask2-12.txt AC 1039 ms 3748 KB
subtask2-13.txt AC 1015 ms 3744 KB
subtask2-14.txt AC 1030 ms 3748 KB
subtask2-15.txt AC 1026 ms 3744 KB