Submission #2661347
Source Code Expand
#include <cstdio> #include <cstring> #include <string> #include <iostream> #include <vector> #include <map> #include <set> #include <queue> #include <deque> #include <algorithm> #define INF 200000000000000LL using namespace std; typedef long long int ll; int main() { int n; scanf("%d", &n); ll h[100000], s[100000]; for(int i=0; i<n; i++){ scanf("%lld %lld", &h[i], &s[i]); } ll h1=1, h2=INF; while(h1!=h2){ ll hmid=(h1+h2)/2; int c1[100000]={}, c[100000]; int e=0; for(int i=0; i<n; i++){ if(hmid<h[i]){ e=1; break; } ll t=(hmid-h[i])/s[i]; if(t>=(ll)(n-1)) t=(ll)(n-1); c1[t]++; } c[0]=c1[0]; for(int i=1; i<n; i++){ c[i]=c[i-1]+c1[i]; if(c[i]>=i+2){ e=1; break; } } if(e==0){ h2=hmid; }else{ h1=hmid+1; } } printf("%lld\n", h1); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - 射撃王 |
User | chocorusk |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 958 Byte |
Status | WA |
Exec Time | 90 ms |
Memory | 2560 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:18:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &n); ^ ./Main.cpp:21:37: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%lld %lld", &h[i], &s[i]); ^
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 | 2 ms | 640 KB |
subtask0-sample02.txt | AC | 2 ms | 2304 KB |
subtask1-01.txt | AC | 2 ms | 640 KB |
subtask1-02.txt | AC | 2 ms | 640 KB |
subtask1-03.txt | AC | 2 ms | 640 KB |
subtask1-04.txt | AC | 2 ms | 640 KB |
subtask1-05.txt | WA | 2 ms | 640 KB |
subtask1-06.txt | AC | 2 ms | 640 KB |
subtask1-07.txt | AC | 2 ms | 640 KB |
subtask1-08.txt | AC | 2 ms | 640 KB |
subtask1-09.txt | AC | 2 ms | 2432 KB |
subtask1-10.txt | AC | 2 ms | 640 KB |
subtask1-11.txt | AC | 2 ms | 640 KB |
subtask1-12.txt | AC | 2 ms | 640 KB |
subtask1-13.txt | AC | 2 ms | 640 KB |
subtask1-14.txt | AC | 2 ms | 640 KB |
subtask1-15.txt | AC | 2 ms | 2432 KB |
subtask2-01.txt | AC | 2 ms | 640 KB |
subtask2-02.txt | AC | 3 ms | 640 KB |
subtask2-03.txt | AC | 5 ms | 2432 KB |
subtask2-04.txt | AC | 19 ms | 1024 KB |
subtask2-05.txt | AC | 45 ms | 2560 KB |
subtask2-06.txt | AC | 68 ms | 2560 KB |
subtask2-07.txt | AC | 80 ms | 2432 KB |
subtask2-08.txt | AC | 89 ms | 2560 KB |
subtask2-09.txt | AC | 87 ms | 2560 KB |
subtask2-10.txt | AC | 81 ms | 2560 KB |
subtask2-11.txt | AC | 88 ms | 2560 KB |
subtask2-12.txt | AC | 90 ms | 2560 KB |
subtask2-13.txt | AC | 85 ms | 2560 KB |
subtask2-14.txt | AC | 90 ms | 2560 KB |
subtask2-15.txt | AC | 90 ms | 2560 KB |