Submission #401369
Source Code Expand
#include<bits/stdc++.h> using namespace std; typedef long long int64; typedef pair< int64, int64 > Pi; int main() { int N; static Pi data[100000]; cin >> N; int64 ret = 0; for(int i = 0; i < N; i++) { cin >> data[i].first >> data[i].second; ret = max(ret, data[i].first); } int64 low = ret, high = 1LL << 55; while(high - low > 0) { int64 mid = (low + high) >> 1LL; static vector< int64 > dat; for(int i = 0; i < N; i++) { int64 itu = mid - data[i].first; itu /= data[i].second; dat.push_back(itu); } sort(dat.begin(), dat.end()); bool flag = true; for(int i = 0; i < dat.size(); i++) { // 切る時間 if(i > dat[i]) flag = false; } if(flag) high = mid; else low = mid + 1; dat.clear(); } cout << low << endl; }
Submission Info
Submission Time | |
---|---|
Task | D - 射撃王 |
User | ei13333 |
Language | C++11 (GCC 4.9.2) |
Score | 100 |
Code Size | 849 Byte |
Status | AC |
Exec Time | 863 ms |
Memory | 3488 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 | 28 ms | 2340 KB |
subtask0-sample02.txt | AC | 28 ms | 2336 KB |
subtask1-01.txt | AC | 26 ms | 2464 KB |
subtask1-02.txt | AC | 29 ms | 2456 KB |
subtask1-03.txt | AC | 28 ms | 2456 KB |
subtask1-04.txt | AC | 28 ms | 2452 KB |
subtask1-05.txt | AC | 29 ms | 2456 KB |
subtask1-06.txt | AC | 28 ms | 2344 KB |
subtask1-07.txt | AC | 29 ms | 2340 KB |
subtask1-08.txt | AC | 28 ms | 2336 KB |
subtask1-09.txt | AC | 28 ms | 2460 KB |
subtask1-10.txt | AC | 29 ms | 2456 KB |
subtask1-11.txt | AC | 29 ms | 2460 KB |
subtask1-12.txt | AC | 28 ms | 2460 KB |
subtask1-13.txt | AC | 29 ms | 2456 KB |
subtask1-14.txt | AC | 28 ms | 2336 KB |
subtask1-15.txt | AC | 27 ms | 2456 KB |
subtask2-01.txt | AC | 29 ms | 2456 KB |
subtask2-02.txt | AC | 36 ms | 2456 KB |
subtask2-03.txt | AC | 49 ms | 2456 KB |
subtask2-04.txt | AC | 180 ms | 2716 KB |
subtask2-05.txt | AC | 429 ms | 2968 KB |
subtask2-06.txt | AC | 649 ms | 3484 KB |
subtask2-07.txt | AC | 774 ms | 3488 KB |
subtask2-08.txt | AC | 855 ms | 3480 KB |
subtask2-09.txt | AC | 861 ms | 3484 KB |
subtask2-10.txt | AC | 761 ms | 3476 KB |
subtask2-11.txt | AC | 404 ms | 3472 KB |
subtask2-12.txt | AC | 863 ms | 3476 KB |
subtask2-13.txt | AC | 818 ms | 3476 KB |
subtask2-14.txt | AC | 853 ms | 3472 KB |
subtask2-15.txt | AC | 857 ms | 3464 KB |