oj.uz

답안 #529600

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
529600 2022-02-23T08:54:38 Z syl123456 Dungeon 3 (JOI21_ho_t5) C++17
11 / 100
 71 ms 5936 KB 
#include <bits/stdc++.h>
#define all(i) (i).begin(), (i).end()
using namespace std;
#define debug(args...) cout << '[' << #args << "] is [", DEBUG(false, args), cout << ']' << endl
template<typename T>
void DEBUG(bool _sp, T i) {
    if (_sp)
        cout << ' ';
    cout << i;
}
template<typename T, typename ...U>
void DEBUG(bool _sp, T i, U ...j) {
    if (_sp)
        cout << ' ';
    cout << i;
    DEBUG(true, j...);
}
template<typename T, typename U>
ostream& operator << (ostream &i, pair<T, U> j) {
    i << '(' << j.first << ", " << j.second << ')';
}
template<typename T>
ostream& operator << (ostream &i, vector<T> j) {
    i << '{' << j.size() << " :";
    for (T _i : j)
        i << ' ' << _i;
    i << '}';
}

typedef long long ll;
typedef pair<int, int> pi;
typedef double dd;

const int inf = 0x3f3f3f3f, lg = 20;
const ll mod = 1e9 + 7, INF = 0x3f3f3f3f3f3f3f3f;

signed main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int n, q;
    cin >> n >> q;
    int a[n], b[n];
    for (int &i : a)
        cin >> i;
    for (int &i : b)
        cin >> i;
    ll pre[n + 1];
    pre[0] = 0;
    for (int i = 0; i < n; ++i)
        pre[i + 1] = pre[i] + a[i];
    if (n <= 3000 && q <= 3000) {
        while (q--) {
            int s, t, u;
            cin >> s >> t >> u;
            --s, --t;
            ll res = 0;
            deque<pi> q;
            for (int i = s; i < t; ++i) {
                if (a[i] > u) {
                    res = -1;
                    break;
                }
                while (!q.empty() && q.back().first >= b[i])
                    q.pop_back();
                q.emplace_back(b[i], i);
                ll tmp = 0;
                while (tmp < a[i]) {
                    while (pre[i] + tmp - pre[q.front().second] >= u)
                        q.pop_front();
                    ll x = min(a[i] - tmp, u - (pre[i] + tmp - pre[q.front().second]));
                    res += x * q.front().first;
                    tmp += x;
                }
            }
            cout << res << '\n';
        }
    }
}

Compilation message

Main.cpp: In function 'std::ostream& operator<<(std::ostream&, std::pair<_T1, _T2>)':
Main.cpp:21:1: warning: no return statement in function returning non-void [-Wreturn-type]
   21 | }
      | ^
Main.cpp: In function 'std::ostream& operator<<(std::ostream&, std::vector<_Tp>)':
Main.cpp:28:1: warning: no return statement in function returning non-void [-Wreturn-type]
   28 | }
      | ^

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 448 KB Output is correct
2 Correct 51 ms 580 KB Output is correct
3 Correct 19 ms 468 KB Output is correct
4 Correct 45 ms 440 KB Output is correct
5 Correct 35 ms 480 KB Output is correct
6 Correct 21 ms 460 KB Output is correct
7 Correct 48 ms 452 KB Output is correct
8 Correct 42 ms 468 KB Output is correct
9 Correct 20 ms 460 KB Output is correct
10 Correct 42 ms 452 KB Output is correct
11 Correct 49 ms 448 KB Output is correct
12 Correct 19 ms 460 KB Output is correct
13 Correct 35 ms 452 KB Output is correct
14 Correct 19 ms 460 KB Output is correct
15 Correct 29 ms 440 KB Output is correct
16 Correct 30 ms 484 KB Output is correct
17 Correct 30 ms 440 KB Output is correct
18 Correct 43 ms 452 KB Output is correct
19 Correct 14 ms 460 KB Output is correct
20 Correct 71 ms 460 KB Output is correct

Subtask #2
0 / 14.0

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

Subtask #3
0 / 31.0

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

Subtask #4
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 448 KB Output is correct
2 Correct 51 ms 580 KB Output is correct
3 Correct 19 ms 468 KB Output is correct
4 Correct 45 ms 440 KB Output is correct
5 Correct 35 ms 480 KB Output is correct
6 Correct 21 ms 460 KB Output is correct
7 Correct 48 ms 452 KB Output is correct
8 Correct 42 ms 468 KB Output is correct
9 Correct 20 ms 460 KB Output is correct
10 Correct 42 ms 452 KB Output is correct
11 Correct 49 ms 448 KB Output is correct
12 Correct 19 ms 460 KB Output is correct
13 Correct 35 ms 452 KB Output is correct
14 Correct 19 ms 460 KB Output is correct
15 Correct 29 ms 440 KB Output is correct
16 Correct 30 ms 484 KB Output is correct
17 Correct 30 ms 440 KB Output is correct
18 Correct 43 ms 452 KB Output is correct
19 Correct 14 ms 460 KB Output is correct
20 Correct 71 ms 460 KB Output is correct
21 Incorrect 12 ms 1948 KB Output isn't correct
22 Halted 0 ms 0 KB -