제출 #471327

#제출 시각아이디문제언어결과실행 시간메모리
471327XIIMobile (BOI12_mobile)C++17
0 / 100
639 ms24628 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; #define fi first #define se second #define mp make_pair #define eb emplace_back #define ALL(x) (x).begin(), (x).end() #define FOR(i, a, b) for(int i = (a); i < (b); ++i) #define FORU(i, a, b) for(int i = (a); i <= (b); ++i) #define FORD(i, a, b) for(int i = (a); i >= (b); --i) #define IOS cin.tie(0)->sync_with_stdio(false); #define PROB "BOI12_mobile" void Fi(){ if(fopen(PROB".inp", "r")){ freopen(PROB".inp", "r", stdin); freopen(PROB".out", "w", stdout); } } template<typename T> T SQ(const T &x){ return x * x; } const ll NONE = -2e9; ll Round(const double &x){ return (x * 1000 + 0.5); } double firstTrue(double lo, double hi, function<bool(double)> f){ while(Round(lo) < Round(hi)){ double mid = lo + (hi - lo) / 2; if(f(mid)) hi = mid; else lo = mid; } return hi; } int main(){ IOS; Fi(); int n, l; cin >> n >> l; vector<int> x(n), y(n); FOR(i, 0, n) cin >> x[i] >> y[i]; const auto check = [&](const double &r) -> bool{ double L = NONE, R = NONE; FOR(i, 0, n) if(abs(y[i]) <= r){ double D = sqrt(SQ(r) - SQ(1LL * y[i])); if(L == NONE){ L = x[i] - D; R = x[i] + D; } else{ L = min(L, x[i] - D); if(x[i] - D <= R) R = x[i] + D; } } return (L <= 0 && l <= R); }; cout << fixed << setprecision(3) << firstTrue(0, 2e9, check); return 0; }

컴파일 시 표준 에러 (stderr) 메시지

mobile.cpp: In function 'void Fi()':
mobile.cpp:20:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |         freopen(PROB".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
mobile.cpp:21:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |         freopen(PROB".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...