oj.uz

답안 #923576

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
923576 2024-02-07T12:25:50 Z GrindMachine Measures (CEOI22_measures) C++17
0 / 100
 1500 ms 488 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    ll n,m,d; cin >> n >> m >> d;
    d *= 2;

    multiset<ll> ms;
    rep1(i,n){
        ll x; cin >> x;
        ms.insert(x*2);
    }

    auto ok = [&](ll mid){
        vector<ll> a(all(ms));
        rep(i,sz(a)){
            rep(j,sz(a)){
                if(a[i]-d*i-a[j]+d*j > 2*mid){
                    return false;
                }
            }
        }

        // trav(x,ms){
        //     pos = max(pos+d,x-mid);
        //     if(pos-x > mid){
        //         return false;
        //     }
        // }

        return true;
    };

    while(m--){
        ll x; cin >> x;
        ms.insert(x*2);

        ll l = 0, r = inf2;
        ll ans = -1;

        while(l <= r){
            ll mid = (l+r) >> 1;
            if(ok(mid)){
                ans = mid;
                r = mid-1;
            }
            else{
                l = mid+1;
            }
        }

        assert(ans != -1);

        cout << ans/2;
        if(ans&1) cout << ".5";
        cout << " ";
    }

    cout << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1516 ms 344 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1516 ms 344 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1549 ms 488 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1549 ms 488 KB Time limit exceeded
2 Halted 0 ms 0 KB -