oj.uz

답안 #730134

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
730134 2023-04-25T10:15:07 Z baojiaopisu Measures (CEOI22_measures) C++14
24 / 100
 1434 ms 8664 KB 
#include<bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;
using ull = unsigned long long;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;

#define fi first
#define se second
#define left BAO
#define right ANH
#define pb push_back
#define pf push_front
#define mp make_pair
#define ins insert
#define btpc __builtin_popcount
#define btclz __builtin_clz

#define sz(x) (int)(x.size());
#define all(x) x.begin(), x.end()
#define debug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int d4x[4] = {1, 0, -1, 0}; int d4y[4] = {0, 1, 0, -1};
int d8x[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int d8y[8] = {1, 1, 0, -1, -1, -1, 0, 1};

template<class X, class Y>
    bool minimize(X &x, const Y &y) {
        if (x > y)
        {
            x = y;
            return true;
        }
        return false;
    }
template<class X, class Y>
    bool maximize(X &x, const Y &y) {
        if (x < y)
        {
            x = y;
            return true;
        }
        return false;
    }

const int MOD = 1e9 + 7; //998244353

template<class X, class Y>
	void add(X &x, const Y &y) {
		x = (x + y);
		if(x >= MOD) x -= MOD;
	}

template<class X, class Y> 
	void sub(X &x, const Y &y) {
		x = (x - y);
		if(x < 0) x += MOD;
	}

/* Author : Le Ngoc Bao Anh, 12A5, LQD High School for Gifted Student*/

const ll INF = 1e9;
const int N = 5e5 + 10;

ld a[N], p[N], b[N];

void BaoJiaoPisu() {
	int n, m; ld d; cin >> n >> m >> d;
	for(int i = 1; i <= n; i++) cin >> a[i];
	for(int i = 1; i <= m; i++) cin >> b[i];
	cout << fixed;
	cout << setprecision(1);
	if(m <= 10) {
		for(int t = 1; t <= m; t++) {
			a[++n] = b[t];
			sort(a + 1, a + 1 + n);
			ld l = 0, r = 1e15, ans = 0;
			for(int rep = 1; rep <= 60; rep++) {
				bool ok = true;
				ld mid = (l + r) / 2;
				p[1] = a[1] - mid;
				for(int i = 2; i <= n; i++) {
					p[i] = max(p[i - 1] + d, a[i] - mid);
					if(p[i] > a[i] + mid) {
						ok = false;
						break;
					}
				}

				if(ok) {
					ans = mid;
					r = mid;
				} else l = mid;
			}
			ll res = ans;
			ld tt = ans - res;
			if(tt < 1.0 / 2) cout << res << " ";
			else cout << ans << ' ';
		}
	}
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int tc = 1, ddd = 0;
    // cin >> tc;
    while(tc--) {
        //ddd++;
        //cout << "Case #" << ddd << ": ";
        BaoJiaoPisu();
    }
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:114:17: warning: unused variable 'ddd' [-Wunused-variable]
  114 |     int tc = 1, ddd = 0;
      |                 ^~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 428 KB Output is correct
2 Correct 11 ms 424 KB Output is correct
3 Correct 11 ms 424 KB Output is correct
4 Correct 12 ms 340 KB Output is correct
5 Correct 11 ms 424 KB Output is correct
6 Correct 10 ms 424 KB Output is correct
7 Correct 10 ms 340 KB Output is correct
8 Correct 16 ms 424 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 428 KB Output is correct
2 Correct 11 ms 424 KB Output is correct
3 Correct 11 ms 424 KB Output is correct
4 Correct 12 ms 340 KB Output is correct
5 Correct 11 ms 424 KB Output is correct
6 Correct 10 ms 424 KB Output is correct
7 Correct 10 ms 340 KB Output is correct
8 Correct 16 ms 424 KB Output is correct
9 Correct 1434 ms 7396 KB Output is correct
10 Correct 1229 ms 8536 KB Output is correct
11 Correct 999 ms 8564 KB Output is correct
12 Correct 1383 ms 8540 KB Output is correct
13 Correct 944 ms 8080 KB Output is correct
14 Correct 1037 ms 8572 KB Output is correct
15 Correct 1133 ms 7864 KB Output is correct
16 Correct 1045 ms 8664 KB Output is correct

Subtask #3
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 55 ms 3428 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 55 ms 3428 KB Output isn't correct
2 Halted 0 ms 0 KB -