oj.uz

Submission #362176

# Submission time Handle Problem Language Result Execution time Memory
362176 2021-02-02T00:37:03 Z ignaciocanta Mobile (BOI12_mobile) C++14
100 / 100
 842 ms 51124 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
using tint = long long;
using ld = long double;
 
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)
 
using pi = pair<tint,int>;
using pl = pair<tint,tint>;
using vi = vector<int>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vvi = vector<vi>;
using vl = vector<tint>;
using vb = vector<bool>;

#define pb push_back
#define pf push_front
#define rsz resize
#define all(x) begin(x), end(x)
#define rall(x) x.rbegin(), x.rend() 
#define sz(x) (int)(x).size()
#define ins insert

#define f first
#define s second
#define mp make_pair
 
#define DBG(x) cerr << #x << " = " << x << endl;
 
const int MOD = 1e9+7;
const tint mod = 998244353;
const int MX = 515;
const tint INF = 1e18; 
const int inf = 2e9;
const ld PI = acos(ld(-1)); 
const ld eps = 1e-8;
 
const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, 1, -1};
 
template<class T> void remDup(vector<T> &v){ 
    sort(all(v)); v.erase(unique(all(v)),end(v));
}

template<class T> bool ckmin(T& a, const T& b) {
    return b < a ? a = b, 1 : 0; 
} 
template<class T> bool ckmax(T& a, const T& b) {
    return a < b ? a = b, 1 : 0; 
}
 
bool valid(int x, int y, int n, int m){
    return (0<=x && x<n && 0<=y && y<m);
}
 
int cdiv(int a, int b) { return a/b+((a^b)>0&&a%b); } //redondea p arriba
int fdiv(int a, int b) { return a/b-((a^b)<0&&a%b); } //redondea p abajo
 
void NACHO(string name = ""){
    ios_base::sync_with_stdio(0); cin.tie(0);
    if(sz(name)){
		freopen((name+".in").c_str(), "r", stdin);
		freopen((name+".out").c_str(), "w", stdout);
	}
}

int main(){
	NACHO();
	int n; tint l; cin >> n >> l;
	vpl a (n);
	F0R(i, n) cin >> a[i].f >> a[i].s;
	double low = 0, high = double(5e9);
	F0R(assa, 50){
		double mid = low+(high-low)/2;
		vector<pair<double, double>> ran (n);
		F0R(i, n){
			// mid*mid = p.y*p.y+x*x
			double dist = sqrt(mid*mid-a[i].s*a[i].s);
			ran[i] = mp(a[i].f-dist, a[i].f+dist);
		}
		double ri = 0;
		F0R(i, n){
			if(ran[i].f <= ri) ri = max(ri, ran[i].s);
		}
		if(ri >= l) high = mid;
		else low = mid;
	}
	cout << fixed << setprecision(4) << high << "\n";
}

Compilation message

mobile.cpp: In function 'void NACHO(std::string)':
mobile.cpp:69:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   69 |   freopen((name+".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mobile.cpp:70:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   70 |   freopen((name+".out").c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 492 KB Output is correct
2 Correct 4 ms 492 KB Output is correct
3 Correct 3 ms 492 KB Output is correct
4 Correct 4 ms 492 KB Output is correct

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 512 KB Output is correct
2 Correct 4 ms 492 KB Output is correct
3 Correct 3 ms 492 KB Output is correct
4 Correct 4 ms 492 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 492 KB Output is correct
2 Correct 3 ms 492 KB Output is correct
3 Correct 3 ms 492 KB Output is correct
4 Correct 4 ms 492 KB Output is correct
5 Correct 3 ms 492 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 2668 KB Output is correct
2 Correct 42 ms 2748 KB Output is correct
3 Correct 29 ms 2028 KB Output is correct
4 Correct 51 ms 2668 KB Output is correct
5 Correct 28 ms 1900 KB Output is correct

Subtask #8
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 2796 KB Output is correct
2 Correct 45 ms 2588 KB Output is correct
3 Correct 55 ms 2932 KB Output is correct
4 Correct 53 ms 2824 KB Output is correct
5 Correct 67 ms 3104 KB Output is correct

Subtask #9
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 3084 KB Output is correct
2 Correct 45 ms 2924 KB Output is correct
3 Correct 53 ms 3008 KB Output is correct
4 Correct 83 ms 3436 KB Output is correct
5 Correct 56 ms 3068 KB Output is correct

Subtask #10
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 3436 KB Output is correct
2 Correct 54 ms 3436 KB Output is correct
3 Correct 57 ms 3564 KB Output is correct
4 Correct 73 ms 3564 KB Output is correct
5 Correct 63 ms 3436 KB Output is correct

Subtask #11
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 3436 KB Output is correct
2 Correct 55 ms 3436 KB Output is correct
3 Correct 54 ms 3436 KB Output is correct
4 Correct 72 ms 3436 KB Output is correct
5 Correct 64 ms 3436 KB Output is correct

Subtask #12
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 285 ms 15980 KB Output is correct
2 Correct 310 ms 15980 KB Output is correct
3 Correct 297 ms 15980 KB Output is correct
4 Correct 371 ms 16108 KB Output is correct
5 Correct 352 ms 16108 KB Output is correct

Subtask #13
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 309 ms 15980 KB Output is correct
2 Correct 468 ms 16108 KB Output is correct
3 Correct 298 ms 15980 KB Output is correct
4 Correct 361 ms 16108 KB Output is correct
5 Correct 345 ms 16108 KB Output is correct

Subtask #14
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 330 ms 19148 KB Output is correct
2 Correct 374 ms 19148 KB Output is correct
3 Correct 355 ms 19148 KB Output is correct
4 Correct 448 ms 19148 KB Output is correct
5 Correct 408 ms 19276 KB Output is correct

Subtask #15
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 377 ms 19148 KB Output is correct
2 Correct 532 ms 19148 KB Output is correct
3 Correct 354 ms 19148 KB Output is correct
4 Correct 467 ms 19180 KB Output is correct
5 Correct 433 ms 19148 KB Output is correct

Subtask #16
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 390 ms 22300 KB Output is correct
2 Correct 430 ms 22320 KB Output is correct
3 Correct 452 ms 22320 KB Output is correct
4 Correct 529 ms 22320 KB Output is correct
5 Correct 489 ms 22320 KB Output is correct

Subtask #17
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 435 ms 22332 KB Output is correct
2 Correct 610 ms 22320 KB Output is correct
3 Correct 433 ms 30700 KB Output is correct
4 Correct 521 ms 35692 KB Output is correct
5 Correct 498 ms 32492 KB Output is correct

Subtask #18
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 441 ms 25364 KB Output is correct
2 Correct 507 ms 25620 KB Output is correct
3 Correct 484 ms 25492 KB Output is correct
4 Correct 596 ms 25492 KB Output is correct
5 Correct 563 ms 25492 KB Output is correct

Subtask #19
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 496 ms 25364 KB Output is correct
2 Correct 675 ms 25368 KB Output is correct
3 Correct 489 ms 34964 KB Output is correct
4 Correct 625 ms 40940 KB Output is correct
5 Correct 624 ms 37012 KB Output is correct

Subtask #20
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 582 ms 31712 KB Output is correct
2 Correct 631 ms 31724 KB Output is correct
3 Correct 617 ms 31724 KB Output is correct
4 Correct 757 ms 31724 KB Output is correct
5 Correct 718 ms 45348 KB Output is correct

Subtask #21
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 620 ms 31712 KB Output is correct
2 Correct 842 ms 31712 KB Output is correct
3 Correct 639 ms 44032 KB Output is correct
4 Correct 758 ms 51124 KB Output is correct
5 Correct 711 ms 46444 KB Output is correct