oj.uz

답안 #923582

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
923582 2024-02-07T12:36:28 Z GrindMachine Measures (CEOI22_measures) C++17
35 / 100
 34 ms 5456 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;

    ll ans = 0;
    ll curr_mx = -inf2;

    rep1(i,m){
        ll x; cin >> x;
        x *= 2;

        amax(ans,curr_mx-x+d*i);
        amax(curr_mx,x-d*i);

        cout << ans/4;
        if((ans/2)&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 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

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

Subtask #3
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 3152 KB Output is correct
2 Correct 32 ms 5332 KB Output is correct
3 Correct 34 ms 5160 KB Output is correct
4 Correct 28 ms 3156 KB Output is correct
5 Correct 30 ms 4436 KB Output is correct
6 Correct 29 ms 3420 KB Output is correct
7 Correct 32 ms 4320 KB Output is correct
8 Correct 28 ms 3156 KB Output is correct
9 Correct 29 ms 2896 KB Output is correct
10 Correct 32 ms 5456 KB Output is correct
11 Correct 33 ms 3924 KB Output is correct
12 Correct 31 ms 4692 KB Output is correct
13 Correct 29 ms 3136 KB Output is correct
14 Correct 32 ms 4916 KB Output is correct
15 Correct 33 ms 4692 KB Output is correct
16 Correct 27 ms 2644 KB Output is correct
17 Correct 30 ms 4428 KB Output is correct

Subtask #4
0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 3152 KB Output is correct
2 Correct 32 ms 5332 KB Output is correct
3 Correct 34 ms 5160 KB Output is correct
4 Correct 28 ms 3156 KB Output is correct
5 Correct 30 ms 4436 KB Output is correct
6 Correct 29 ms 3420 KB Output is correct
7 Correct 32 ms 4320 KB Output is correct
8 Correct 28 ms 3156 KB Output is correct
9 Correct 29 ms 2896 KB Output is correct
10 Correct 32 ms 5456 KB Output is correct
11 Correct 33 ms 3924 KB Output is correct
12 Correct 31 ms 4692 KB Output is correct
13 Correct 29 ms 3136 KB Output is correct
14 Correct 32 ms 4916 KB Output is correct
15 Correct 33 ms 4692 KB Output is correct
16 Correct 27 ms 2644 KB Output is correct
17 Correct 30 ms 4428 KB Output is correct
18 Incorrect 30 ms 4424 KB Output isn't correct
19 Halted 0 ms 0 KB -