Submission #3211505
Source Code Expand
#include <iostream> #include <cstdio> #include <cstring> #include <cstdlib> #include <cassert> #include <climits> #include <algorithm> #include <string> #include <sstream> #include <complex> #include <vector> #include <list> #include <queue> #include <deque> #include <stack> #include <map> #include <set> #include <fstream> using namespace std; #define TOSTRING(x) #x #define SZ(x) (int)(x).size() #define REP(i,n) for(int i=0;i<(n);i++) #define FOR(i,a,b) for(int i=(a);i<(b);i++) #define REPR(i,n) for(int i=(n)-1;i>=0;i--) #define ALL(s) (s).begin(), (s).end() #define so(V) sort(ALL(V)) #define rev(V) reverse(ALL(V)) #define uni(v) v.erase( unique(ALL(v)) , v.end()); #define PAU system("pause") typedef long long unsigned int llu; typedef long long ll; typedef vector<int> vi; typedef vector<ll> vll; typedef vector<bool> vb; typedef vector<vi> vvi; typedef vector<vll> vvll; typedef vector<vb> vvb; const double EPS = 1e-9; const int MOD = 1e9 + 7; const int INF = (1 << 28); const double PI = acos(-1); typedef pair<ll, ll> Balloon; bool check(ll c, vector<Balloon> B) { int N = SZ(B); vll S(N,0); REP(i, N) { if (c < B[i].first)return false; S[i] = (c - B[i].first) / B[i].second; } so(S); REP(i, N) { if (S[i] < (ll)i)return false; } return true; } int main() { cin.tie(0); ios::sync_with_stdio(false); int N; cin >> N; vector<Balloon> B(N); REP(i, N) { ll h, s; cin >> h >> s; B[i] = Balloon(h, s); } ll ok = 10e16; ll ng = 0; // cerr << abs(ok - ng) << endl; while (abs(ok - ng) > 1) { ll mid = (ok + ng) / 2; // cerr << mid; if (check(mid, B)) { ok = mid; // cerr << " O"; } else ng = mid; // cerr << endl; } cout << ok << endl; PAU; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - 射撃王 |
User | Daylight |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1805 Byte |
Status | AC |
Exec Time | 469 ms |
Memory | 4428 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:87:5: warning: ignoring return value of ‘int system(const char*)’, declared with attribute warn_unused_result [-Wunused-result] PAU; ^
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 | 5 ms | 504 KB |
subtask0-sample02.txt | AC | 2 ms | 504 KB |
subtask1-01.txt | AC | 2 ms | 504 KB |
subtask1-02.txt | AC | 2 ms | 504 KB |
subtask1-03.txt | AC | 2 ms | 504 KB |
subtask1-04.txt | AC | 2 ms | 504 KB |
subtask1-05.txt | AC | 2 ms | 504 KB |
subtask1-06.txt | AC | 2 ms | 504 KB |
subtask1-07.txt | AC | 2 ms | 504 KB |
subtask1-08.txt | AC | 2 ms | 504 KB |
subtask1-09.txt | AC | 2 ms | 504 KB |
subtask1-10.txt | AC | 2 ms | 500 KB |
subtask1-11.txt | AC | 2 ms | 504 KB |
subtask1-12.txt | AC | 2 ms | 504 KB |
subtask1-13.txt | AC | 2 ms | 504 KB |
subtask1-14.txt | AC | 2 ms | 500 KB |
subtask1-15.txt | AC | 2 ms | 504 KB |
subtask2-01.txt | AC | 2 ms | 504 KB |
subtask2-02.txt | AC | 6 ms | 512 KB |
subtask2-03.txt | AC | 11 ms | 632 KB |
subtask2-04.txt | AC | 85 ms | 1308 KB |
subtask2-05.txt | AC | 223 ms | 2408 KB |
subtask2-06.txt | AC | 360 ms | 3616 KB |
subtask2-07.txt | AC | 421 ms | 4024 KB |
subtask2-08.txt | AC | 465 ms | 4428 KB |
subtask2-09.txt | AC | 468 ms | 4428 KB |
subtask2-10.txt | AC | 431 ms | 4428 KB |
subtask2-11.txt | AC | 180 ms | 4428 KB |
subtask2-12.txt | AC | 469 ms | 4428 KB |
subtask2-13.txt | AC | 467 ms | 4428 KB |
subtask2-14.txt | AC | 463 ms | 4428 KB |
subtask2-15.txt | AC | 467 ms | 4428 KB |