제출 #862911

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
862911		Trisanu_Das	Measures (CEOI22_measures)	C++17	59 / 100	184 ms	7792 KiB

Main

#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
#define pb       push_back
#define mp       make_pair
#define all(x)   x.begin(), x.end()
#define ff       first
#define ss       second
 
ll d, a[500005];
 
ll solve(int n){
    sort(a, a + n);
    ll lastpos = a[0], tim = 0;
    for(int i = 1; i < n; i++){
        if(a[i] - lastpos >= d) lastpos = max(lastpos + d, a[i] - tim);
        else if(a[i] + tim - lastpos >= d) lastpos += d;
        else{
            ll need = d - (a[i] - lastpos) - tim, x = a[i] + tim;
            need /= 2;
            tim += need;
            lastpos = x + need;
        }
    }
    return tim;
}
 
 
int main(){
    ios_base::sync_with_stdio(false); cin.tie(0);
    int n, m; cin >> n >> m >> d;
    d *= 2;
    for(int i = 0; i < n; i++){
        cin >> a[i];
        a[i] *= 2;
    }
    sort(a, a + n);
    ll lastpos, tim;
    for(int i = 0; i < m; i++){
        cin >> a[i + n];
        a[i + n] *= 2;
        ll ans;
        if(m > 10){
            if(i == 0) lastpos = a[0], tim = 0;
            else{
                if(a[i] - lastpos >= d) lastpos = max(lastpos + d, a[i] - tim);
                else if(a[i] + tim - lastpos >= d) lastpos += d;
                else{
                    ll need = d - (a[i] - lastpos) - tim, x = a[i] + tim;
                    need /= 2;
                    tim += need;
                    lastpos = x + need;
                }
            }
            ans = tim;
        }
        else ans = solve(i + n + 1);
        cout << ans / 2 << (ans & 1 ? ".5 " : " ");
    }
}

• Subtask 1: 10 / 10
• Subtask 2: 14 / 14
• Subtask 3: 35 / 35
• Subtask 4: 0 / 41