Submission #1023308

#	Time	Username	Problem	Language	Result	Execution time	Memory
1023308		bad_in_physics	Mobile (BOI12_mobile)	C++17	0 / 100	1074 ms	40256 KiB

mobile

//#pragma GCC optimize("O3,unroll-loops")

#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<set>
#include<unordered_set>
#include<numeric>
#include<map>
#include<unordered_map>
#include<queue>
#include<stack>
#include<math.h>
#include<iomanip>
#include<array>
#include<climits>
//#include<bits/stdc++.h>
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>

#define ll long long
#define double long double
#define str string
#define ins insert
#define fi first
#define se second
#define pb push_back
#define pii pair<int,int>
#define pll pair<ll,ll>
#define sqr(x) (x)*(x)
 
using namespace std;
//using namespace __gnu_pbds;
//template <typename T>
//using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

void solve() {
    int n;
    cin >> n;
    vector<int> x(n),r(n);
    for (int i=0; i<n; i++) {
        cin >> x[i] >> r[i];
    } vector<double> ans(n);
    ans[0]=r[0]; 
    for (int i=1; i<n; i++) {
        double fori=r[i];
        for (int j=0; j<i; j++) {
            fori=min(fori,sqr(x[i]-x[j])/(4*ans[j]));
        } ans[i]=fori;
    } for (int i=0; i<n; i++) {
        cout << ans[i] << "\n";
    }
}
 
int main() {
    //freopen("sleepy.in", "r", stdin);
    //freopen("sleepy.out", "w", stdout);
    ios::sync_with_stdio(0);
    cin.tie(0);
    int tt=1;
    //cin >> tt;
    cout << fixed << setprecision(3);
    for (int i=1; i<=tt; i++) {
        //cout << "Case#" << i << ":\n";
        solve();
    }
    return 0;
}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 4
• Subtask 3: 0 / 4
• Subtask 4: 0 / 4
• Subtask 5: 0 / 4
• Subtask 6: 0 / 5
• Subtask 7: 0 / 5
• Subtask 8: 0 / 5
• Subtask 9: 0 / 5
• Subtask 10: 0 / 5
• Subtask 11: 0 / 5
• Subtask 12: 0 / 5
• Subtask 13: 0 / 5
• Subtask 14: 0 / 5
• Subtask 15: 0 / 5
• Subtask 16: 0 / 5
• Subtask 17: 0 / 5
• Subtask 18: 0 / 5
• Subtask 19: 0 / 5
• Subtask 20: 0 / 5
• Subtask 21: 0 / 5