oj.uz

답안 #1016051

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1016051 2024-07-07T10:29:24 Z ByeWorld Balloons (CEOI11_bal) C++14
10 / 100
 135 ms 9652 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
#define ll long long
#define int long long
#define pb push_back
#define fi first
#define se second
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)/2)
#define ld long double
using namespace std;
typedef pair<int,int> pii;
typedef pair<pii, int> ipii;
const int MAXN = 2e5+10;
const int MAXA = 1e6+10;
const int INF = 1e9+10;
// const int INF2 = 1e18+10;
const int LOG = 19;
const int MOD = 1e9+7;
const int SQRT = 450;
const vector<int> NOL = {};
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const vector<int> dx = {1, -1, 0, 0};
const vector<int> dy = {0, 0, 1, -1};
void chmn(ld &a, ld b){ a = min(a, b); }
void chmx(ld &a, ld b){ a = max(a, b); }

int n;
int x[MAXN], mx[MAXN];
ld r[MAXN];

ld dis(int j, int i){
    return (ld)((x[j]-x[i])*(x[j]-x[i]) / (4*r[j]));
}
signed main(){
    cin >> n;
    for(int i=1; i<=n; i++){
        cin >> x[i] >> mx[i];
    }
    vector <int> stac; stac.pb(1);
    r[1] = mx[1];
    for(int i=2; i<=n; i++){
        ld mn = (ld)mx[i];
        int idx = -1;
        for(auto j : stac){
            if(mn > dis(j, i)) idx = j;
            else break;
            chmn(mn, dis(j, i));
        }
        r[i] = mn; 
        while(!stac.empty() && r[stac.back()] < r[i]) stac.pop_back();
        stac.pb(i);
    }
    for(int i=1; i<=n; i++) cout << fixed << setprecision(3) << r[i] << '\n';
}

Compilation message

bal.cpp: In function 'int main()':
bal.cpp:45:13: warning: variable 'idx' set but not used [-Wunused-but-set-variable]
   45 |         int idx = -1;
      |             ^~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB 7th numbers differ - expected: '11.4400000000', found: '81.0000000000', error = '69.5600000000'
2 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB 2 numbers

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB 7th numbers differ - expected: '0.0010000000', found: '9.0000000000', error = '8.9990000000'
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 600 KB 3rd numbers differ - expected: '121.0000000000', found: '123.0000000000', error = '2.0000000000'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 14 ms 1116 KB 3rd numbers differ - expected: '211.0000000000', found: '213.0000000000', error = '2.0000000000'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 38 ms 2828 KB 5th numbers differ - expected: '15395.0000000000', found: '15396.0000000000', error = '1.0000000000'
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 79 ms 5264 KB 3rd numbers differ - expected: '7936.0000000000', found: '10352.0000000000', error = '2416.0000000000'
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 85 ms 5948 KB 5th numbers differ - expected: '5054.0000000000', found: '5055.0000000000', error = '1.0000000000'
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 115 ms 7800 KB 3rd numbers differ - expected: '1872.0000000000', found: '1874.0000000000', error = '2.0000000000'
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 135 ms 9652 KB 3rd numbers differ - expected: '2960.0000000000', found: '2962.0000000000', error = '2.0000000000'
2 Halted 0 ms 0 KB -