Submission #3212053
Source Code Expand
// {{{ #include <iostream> #include <cmath> #include <cstdio> #include <cstdlib> #include <cstring> #include <complex> #include <vector> #include <list> #include <set> #include <queue> #include <stack> #include <map> #include <string> #include <algorithm> #include <numeric> using namespace std; #define fi first #define se second #define pb push_back #define mp make_pair #define FOR(i, a, b) for(ll i = static_cast<ll>(a); i < static_cast<ll>(b); i++) #define FORR(i, a, b) for(ll i = static_cast<ll>(a); i >= static_cast<ll>(b); i--) #define REP(i, n) for(ll i = 0ll; i < static_cast<ll>(n); i++) #define REPR(i, n) for(ll i = static_cast<ll>(n); i >= 0ll; i--) #define ALL(x) (x).begin(), (x).end() typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> P; typedef pair<ll, ll> LP; typedef pair<int, P> IP; typedef pair<ll, LP> LLP; const int dx[] = {1, -1, 0, 0}; const int dy[] = {0, 0, 1, -1}; constexpr int INF = 100000000; constexpr ll LINF = 10000000000000000ll; constexpr int MOD = static_cast<int>(1e9 + 7); constexpr double EPS = 1e-9; // }}} ll N; ll h[100000], l[100000]; vector<LP> v; bool condition(ll n) { vector<double> t; REP(i, N){ if(n < h[i]) return false; t.pb(static_cast<double>(n - h[i]) / l[i]); } sort(t.begin(), t.end()); REP(i, N){ if(t[i] < i) return false; } return true; } ll binary_search(ll n) { ll lb = 0, ub = n; while(ub - lb > 1){ ll mid = (lb + ub) / 2; if(condition(mid)) ub = mid; else lb = mid; } return ub; } void init() { } void solve() { cout << binary_search(LINF) << endl; } int main() { cin.tie(0); ios::sync_with_stdio(false); cin >> N; REP(i, N){ ll h_, l_; cin >> h_ >> l_; h[i] = h_; l[i] = l_; v.pb(LP(h_+(N-1)*l_, i)); } solve(); return 0; } // vim:set foldmethod=marker:
Submission Info
Submission Time | |
---|---|
Task | D - 射撃王 |
User | rrrccc |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 2022 Byte |
Status | AC |
Exec Time | 442 ms |
Memory | 5260 KB |
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 | 1 ms | 256 KB |
subtask2-02.txt | AC | 5 ms | 384 KB |
subtask2-03.txt | AC | 8 ms | 512 KB |
subtask2-04.txt | AC | 78 ms | 1368 KB |
subtask2-05.txt | AC | 211 ms | 2800 KB |
subtask2-06.txt | AC | 350 ms | 4488 KB |
subtask2-07.txt | AC | 395 ms | 4872 KB |
subtask2-08.txt | AC | 435 ms | 5256 KB |
subtask2-09.txt | AC | 439 ms | 5256 KB |
subtask2-10.txt | AC | 432 ms | 5260 KB |
subtask2-11.txt | AC | 440 ms | 5260 KB |
subtask2-12.txt | AC | 441 ms | 5256 KB |
subtask2-13.txt | AC | 442 ms | 5260 KB |
subtask2-14.txt | AC | 440 ms | 5260 KB |
subtask2-15.txt | AC | 442 ms | 5260 KB |