Submission #401365
Source Code Expand
/* attention to overflow */ #include <iostream> #include <vector> #include <algorithm> #include <string> #include <cstdio> #include <queue> #include <sstream> #include <set> #include <map> #include <cmath> #include <numeric> #include <tuple> #include <iomanip> #define dump(x) cerr<< #x << " = " << x <<endl #define ALL(container) (container).begin(),(container).end() using namespace std; const int INF = 1 << 25; void io() { cin.tie(0); ios::sync_with_stdio(false);} template <class S,class T> ostream& operator<<(ostream& os, const pair <S,T> &s){return os<<'('<<s.first<<','<<s.second<<')';} /*printf("%.9Lf\n",cf);*/ const int MOD = 1000000007; const double EPS=1e-8; int N; bool check(long long mid,vector <long long> &height, vector <long long> &up){ map <long long,int> cnt; for(int i=0;i<N;i++){ long long tmp=(mid-height[i])/up[i]; cnt[tmp]++; } long long num=0; for(auto it:cnt){ num+=it.second; if(it.first<num-1){ return 0; } } return 1; } int main() { io(); cin>>N; vector <long long> height(N); vector <long long> up(N); for(int i=0;i<N;i++){ cin>>height[i]>>up[i]; } long long left=0; long long right=1000000000000000000; while(left+1<right){ long long mid=(left+right)/2; if(check(mid,height,up)){ right=mid; }else{ left=mid; } } cout<<right<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - 射撃王 |
User | dussel |
Language | C++11 (GCC 4.9.2) |
Score | 0 |
Code Size | 1402 Byte |
Status | WA |
Exec Time | 3616 ms |
Memory | 8612 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 30 | 0 / 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 | 27 ms | 924 KB |
subtask0-sample02.txt | AC | 23 ms | 808 KB |
subtask1-01.txt | AC | 24 ms | 804 KB |
subtask1-02.txt | AC | 24 ms | 928 KB |
subtask1-03.txt | WA | 24 ms | 804 KB |
subtask1-04.txt | AC | 24 ms | 924 KB |
subtask1-05.txt | AC | 24 ms | 928 KB |
subtask1-06.txt | WA | 24 ms | 912 KB |
subtask1-07.txt | WA | 28 ms | 804 KB |
subtask1-08.txt | AC | 24 ms | 932 KB |
subtask1-09.txt | AC | 23 ms | 924 KB |
subtask1-10.txt | AC | 25 ms | 804 KB |
subtask1-11.txt | AC | 24 ms | 932 KB |
subtask1-12.txt | WA | 25 ms | 928 KB |
subtask1-13.txt | AC | 81 ms | 768 KB |
subtask1-14.txt | AC | 26 ms | 804 KB |
subtask1-15.txt | WA | 26 ms | 924 KB |
subtask2-01.txt | AC | 28 ms | 920 KB |
subtask2-02.txt | AC | 46 ms | 932 KB |
subtask2-03.txt | WA | 89 ms | 1184 KB |
subtask2-04.txt | AC | 529 ms | 2336 KB |
subtask2-05.txt | AC | 1577 ms | 4644 KB |
subtask2-06.txt | AC | 2497 ms | 6568 KB |
subtask2-07.txt | AC | 3112 ms | 7844 KB |
subtask2-08.txt | AC | 3612 ms | 8608 KB |
subtask2-09.txt | AC | 3417 ms | 8612 KB |
subtask2-10.txt | AC | 1693 ms | 2972 KB |
subtask2-11.txt | AC | 209 ms | 2332 KB |
subtask2-12.txt | AC | 3482 ms | 8612 KB |
subtask2-13.txt | AC | 3616 ms | 8356 KB |
subtask2-14.txt | AC | 3485 ms | 8612 KB |
subtask2-15.txt | AC | 3493 ms | 8612 KB |