Submission #1291483
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; #define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i) int nextInt() { int x; scanf("%d", &x); return x;} typedef pair<ll, ll> P; P p[100000 + 10]; ll y[100000 + 10]; int N; bool possible(ll K) { REP(i, N) { ll x = (K - p[i].first) < 0 ? -1 : (K - p[i].first) / p[i].second; y[i] = x; } sort(y, y + N); for (int i = 0; i < N; i++) { if (y[i] < i) return false; } return true; } int main2() { N = nextInt(); REP(i, N) { p[i].first = nextInt(); p[i].second = nextInt(); } ll lo = -1; ll hi = 1LL << 58; while (hi - lo > 1) { ll mid = (hi + lo) / 2; if (possible(mid)) hi = mid; else lo = mid; } ll ans = hi; cout << ans << endl; return 0; } int main() { for (;!cin.eof();cin>>ws) main2(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - 射撃王 |
User | hs484 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 864 Byte |
Status | AC |
Exec Time | 442 ms |
Memory | 2560 KB |
Compile Error
./Main.cpp: In function ‘int nextInt()’: ./Main.cpp:7:39: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] int nextInt() { int x; scanf("%d", &x); return x;} ^
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 30 / 30 | 70 / 70 | ||||||
Status |
|
|
|
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 | 2 ms | 256 KB |
subtask2-02.txt | AC | 5 ms | 256 KB |
subtask2-03.txt | AC | 13 ms | 384 KB |
subtask2-04.txt | AC | 80 ms | 768 KB |
subtask2-05.txt | AC | 210 ms | 1408 KB |
subtask2-06.txt | AC | 343 ms | 2176 KB |
subtask2-07.txt | AC | 395 ms | 2304 KB |
subtask2-08.txt | AC | 437 ms | 2560 KB |
subtask2-09.txt | AC | 441 ms | 2560 KB |
subtask2-10.txt | AC | 411 ms | 2560 KB |
subtask2-11.txt | AC | 165 ms | 2560 KB |
subtask2-12.txt | AC | 442 ms | 2560 KB |
subtask2-13.txt | AC | 435 ms | 2560 KB |
subtask2-14.txt | AC | 435 ms | 2560 KB |
subtask2-15.txt | AC | 438 ms | 2560 KB |