Submission #409036
Source Code Expand
#include <iostream> #include <vector> #include <algorithm> using namespace std; int N; long long res,ma,mi; struct bal{ int h; int s; }; int main(int argc, const char * argv[]) { cin>>N; mi=0; vector<bal> bSet(N,{0,0}); vector<long long> time(N,0); for(int i=0;i<N;i++){ cin>>bSet[i].h>>bSet[i].s; mi=max(mi,(long long)bSet[i].h); ma=max(ma,(long long)bSet[i].h+N*bSet[i].s); } res=(mi+ma)/2; //とりま真ん中 while(1){ for(int i=0;i<N;i++){ time[i]=(res-bSet[i].h)/bSet[i].s; //res点を取るには何秒以内に割らなきゃいけないか } if(ma-mi<1){ //last cout<<res<<"\n"; return 0; } sort(time.begin(),time.end()); for(int i=0;i<N;i++){ //ダメな条件 if(i>time[i]){ mi=res+1; res=(mi+ma)/2; break; //間に合わない(割れない) } //以下は抜けきれたら動く if(i==N-1){ //もっと下を探す ma=res; //ここは+=ではダメ res=(mi+ma)/2; //割れたらreswを小さくする } } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - 射撃王 |
User | saboten012 |
Language | C++ (GCC 4.9.2) |
Score | 30 |
Code Size | 1501 Byte |
Status | WA |
Exec Time | 506 ms |
Memory | 2464 KB |
Compile Error
./Main.cpp: In function ‘int main(int, const char**)’: ./Main.cpp:20:24: warning: extended initializer lists only available with -std=c++11 or -std=gnu++11 vector<bal> bSet(N,{0,0}); ^ ./Main.cpp:20:29: warning: extended initializer lists only available with -std=c++11 or -std=gnu++11 vector<bal> bSet(N,{0,0}); ^
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 30 / 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 | 25 ms | 920 KB |
subtask0-sample02.txt | AC | 24 ms | 924 KB |
subtask1-01.txt | AC | 28 ms | 784 KB |
subtask1-02.txt | AC | 29 ms | 932 KB |
subtask1-03.txt | AC | 29 ms | 920 KB |
subtask1-04.txt | AC | 26 ms | 796 KB |
subtask1-05.txt | AC | 28 ms | 800 KB |
subtask1-06.txt | AC | 26 ms | 800 KB |
subtask1-07.txt | AC | 27 ms | 796 KB |
subtask1-08.txt | AC | 26 ms | 788 KB |
subtask1-09.txt | AC | 27 ms | 920 KB |
subtask1-10.txt | AC | 24 ms | 932 KB |
subtask1-11.txt | AC | 26 ms | 804 KB |
subtask1-12.txt | AC | 26 ms | 804 KB |
subtask1-13.txt | AC | 30 ms | 800 KB |
subtask1-14.txt | AC | 26 ms | 804 KB |
subtask1-15.txt | AC | 24 ms | 800 KB |
subtask2-01.txt | WA | 27 ms | 924 KB |
subtask2-02.txt | WA | 32 ms | 812 KB |
subtask2-03.txt | AC | 34 ms | 844 KB |
subtask2-04.txt | WA | 92 ms | 1056 KB |
subtask2-05.txt | WA | 195 ms | 1572 KB |
subtask2-06.txt | AC | 390 ms | 1952 KB |
subtask2-07.txt | WA | 349 ms | 2148 KB |
subtask2-08.txt | WA | 377 ms | 2276 KB |
subtask2-09.txt | WA | 359 ms | 2344 KB |
subtask2-10.txt | AC | 388 ms | 2464 KB |
subtask2-11.txt | WA | 298 ms | 2340 KB |
subtask2-12.txt | WA | 367 ms | 2344 KB |
subtask2-13.txt | AC | 506 ms | 2268 KB |
subtask2-14.txt | WA | 371 ms | 2336 KB |
subtask2-15.txt | WA | 373 ms | 2324 KB |