oj.uz

답안 #1006395

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1006395 2024-06-24T00:50:52 Z Joshua_Andersson Snowball (JOI21_ho_t2) C++14
33 / 100
 2500 ms 12580 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define int ll
const int inf = int(1e18);

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> p2;

#define rep(i, high) for (int i = 0; i < high; i++)
#define repp(i, low, high) for (int i = low; i < high; i++)
#define repe(i, container) for (auto& i : container)
#define sz(container) ((int)container.size())
#define all(x) begin(x),end(x)
#define ceildiv(x,y) (((x) + (y) - 1) / (y))

inline void fast() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); }

#if _LOCAL
#define assert(x) if (!(x)) __debugbreak()
#endif

signed main()
{
    fast();

    int n, q;
    cin >> n >> q;
    vi balls(n);
    rep(i, n) cin >> balls[i];
    vi delta(q);
    rep(i, q) cin >> delta[i];
    n += 2;
    balls.insert(balls.begin(), - inf);
    balls.push_back(inf);


    bool posfirst = delta[0] > 0;
    vi pref(delta);
    repp(i, 1, q) pref[i] += pref[i - 1];
    vi prefmax(pref);
    vi prefmin(pref);
    prefmax.insert(prefmax.begin(), 0LL);
    prefmin.insert(prefmin.begin(), 0LL);
    q++;
    repp(i, 1, q) prefmax[i] = max(prefmax[i], prefmax[i - 1]);
    repp(i, 1, q) prefmin[i] = min(prefmin[i], prefmin[i - 1]);
    delta.insert(delta.begin(), 0LL);

    repp(i, 1, n - 1)
    {
        int l = 0;
        rep(j, q)
        {
            int mlo = balls[i] + prefmin[j];
            int phi = balls[i - 1] + prefmax[j];
            if (phi>=mlo)
            {
                if (delta[j] > 0) l = balls[i] - mlo;
                else l = balls[i] - phi;
                break;
            }
            else
            {
                l = max(l, balls[i] - mlo);
            }
        }

        int r = 0;
        rep(j, q)
        {
            int mhi = balls[i] + prefmax[j];
            int plo = balls[i + 1] + prefmin[j];
            if (mhi>=plo)
            {
                if (delta[j] > 0) r = plo-balls[i];
                else r = mhi-balls[i];
                break;
            }
            else
            {
                r = max(r, mhi - balls[i]);
            }
        }

        cout << l + r << "\n";
    }

    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:40:10: warning: unused variable 'posfirst' [-Wunused-variable]
   40 |     bool posfirst = delta[0] > 0;
      |          ^~~~~~~~

Subtask #1
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 444 KB Output is correct
4 Correct 4 ms 592 KB Output is correct
5 Correct 4 ms 348 KB Output is correct
6 Correct 4 ms 348 KB Output is correct
7 Correct 6 ms 344 KB Output is correct
8 Correct 4 ms 604 KB Output is correct
9 Correct 4 ms 604 KB Output is correct
10 Correct 4 ms 604 KB Output is correct
11 Correct 4 ms 604 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 4 ms 604 KB Output is correct
16 Correct 4 ms 604 KB Output is correct
17 Correct 3 ms 508 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 7 ms 604 KB Output is correct

Subtask #2
0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 444 KB Output is correct
4 Correct 4 ms 592 KB Output is correct
5 Correct 4 ms 348 KB Output is correct
6 Correct 4 ms 348 KB Output is correct
7 Correct 6 ms 344 KB Output is correct
8 Correct 4 ms 604 KB Output is correct
9 Correct 4 ms 604 KB Output is correct
10 Correct 4 ms 604 KB Output is correct
11 Correct 4 ms 604 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 4 ms 604 KB Output is correct
16 Correct 4 ms 604 KB Output is correct
17 Correct 3 ms 508 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 7 ms 604 KB Output is correct
20 Correct 22 ms 12580 KB Output is correct
21 Correct 24 ms 11812 KB Output is correct
22 Correct 47 ms 11812 KB Output is correct
23 Correct 308 ms 11100 KB Output is correct
24 Execution timed out 2503 ms 10684 KB Time limit exceeded
25 Halted 0 ms 0 KB -