Submission #2572615
Source Code Expand
#include <iostream> using namespace std; typedef long long ll; const int MAX_N = 100010; ll h[MAX_N], s[MAX_N]; bool used[MAX_N]; int main() { int n; cin >> n; for (int i=0;i<n;i++) { cin >> h[i] >> s[i]; } ll tmp = 0; for (int i=0;i<n;i++) { int index = 0; for (int j=0;j<n;j++) { if (!used[j] && h[index] + s[index] * (i+1) < h[j] + s[j] * (i+1)) { index = j; } } tmp = max(tmp, h[index] + s[index] * i); used[index] = true; } cout << tmp << endl; }
Submission Info
Submission Time | |
---|---|
Task | D - 射撃王 |
User | hashmup |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 599 Byte |
Status | WA |
Exec Time | 5255 ms |
Memory | 1920 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 | 1 ms | 256 KB |
subtask0-sample02.txt | AC | 1 ms | 256 KB |
subtask1-01.txt | WA | 1 ms | 256 KB |
subtask1-02.txt | WA | 1 ms | 256 KB |
subtask1-03.txt | AC | 1 ms | 256 KB |
subtask1-04.txt | WA | 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 | WA | 1 ms | 256 KB |
subtask1-11.txt | WA | 1 ms | 256 KB |
subtask1-12.txt | AC | 1 ms | 256 KB |
subtask1-13.txt | WA | 1 ms | 256 KB |
subtask1-14.txt | WA | 1 ms | 256 KB |
subtask1-15.txt | AC | 1 ms | 256 KB |
subtask2-01.txt | AC | 2 ms | 256 KB |
subtask2-02.txt | WA | 8 ms | 256 KB |
subtask2-03.txt | AC | 36 ms | 256 KB |
subtask2-04.txt | WA | 1439 ms | 640 KB |
subtask2-05.txt | TLE | 5255 ms | 1024 KB |
subtask2-06.txt | TLE | 5255 ms | 1536 KB |
subtask2-07.txt | TLE | 5255 ms | 1792 KB |
subtask2-08.txt | TLE | 5255 ms | 1920 KB |
subtask2-09.txt | TLE | 5255 ms | 1920 KB |
subtask2-10.txt | TLE | 5255 ms | 1920 KB |
subtask2-11.txt | TLE | 5255 ms | 1920 KB |
subtask2-12.txt | TLE | 5255 ms | 1920 KB |
subtask2-13.txt | TLE | 5255 ms | 1920 KB |
subtask2-14.txt | TLE | 5255 ms | 1920 KB |
subtask2-15.txt | TLE | 5255 ms | 1920 KB |