oj.uz

Submission #830465

# Submission time Handle Problem Language Result Execution time Memory
830465 2023-08-19T06:53:00 Z RaresFelix Snowball (JOI21_ho_t2) C++17
100 / 100
 177 ms 17044 KB 
#include <bits/stdc++.h>

using namespace std;
const int MN = 200001;
const int MQ = 200001;
using ll = long long;
ll P[MN], A[MQ], St[MN], Dr[MN];
int n, q;

vector<pair<ll, int> > Dist;

int main() {
    cin >> n >> q;
    for(int i = 1; i <= n; ++i) {
        cin >> P[i];
        St[i] = Dr[i] = -1;
    }
    for(int i = 1; i < n; ++i) {
        Dist.push_back(make_pair(P[i + 1] - P[i], i));
    }
    sort(Dist.begin(), Dist.end());
    ll itD = 0, st = 0, dr = 0, p = 0;
    for(int i = 1; i <= q; ++i) {
        cin >> A[i];
        p += A[i];
        if(p > dr) {
            while(itD != Dist.size() && Dist[itD].first <= st + p) {
                int acum = Dist[itD].second;
                if(St[acum + 1] == -1)
                    St[acum + 1] = st;
                if(Dr[acum] == -1)
                    Dr[acum] = Dist[itD].first - st;
                ++itD;
            }
            dr = p;
        }
        if(-p > st) {
            while(itD != Dist.size() && Dist[itD].first <= dr - p) {
                int acum = Dist[itD].second;
                if(Dr[acum] == -1)
                    Dr[acum] = dr;
                if(St[acum + 1] == -1)
                    St[acum + 1] = Dist[itD].first - dr;
                ++itD;
            } 
            st = -p;
        }
    }
    for(int i = 1; i <= n; ++i) {
        if(St[i] == -1) St[i] = st;
        if(Dr[i] == -1) Dr[i] = dr;
        cout << St[i] + Dr[i] << "\n";
    }
    
    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:27:23: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |             while(itD != Dist.size() && Dist[itD].first <= st + p) {
      |                   ~~~~^~~~~~~~~~~~~~
Main.cpp:38:23: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |             while(itD != Dist.size() && Dist[itD].first <= dr - p) {
      |                   ~~~~^~~~~~~~~~~~~~

Subtask #1
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 312 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 2 ms 500 KB Output is correct
17 Correct 2 ms 448 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 2 ms 364 KB Output is correct

Subtask #2
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 312 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 2 ms 500 KB Output is correct
17 Correct 2 ms 448 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 2 ms 364 KB Output is correct
20 Correct 62 ms 3984 KB Output is correct
21 Correct 58 ms 3744 KB Output is correct
22 Correct 53 ms 3560 KB Output is correct
23 Correct 50 ms 3512 KB Output is correct
24 Correct 54 ms 4544 KB Output is correct
25 Correct 143 ms 15136 KB Output is correct
26 Correct 146 ms 15060 KB Output is correct
27 Correct 152 ms 14648 KB Output is correct
28 Correct 140 ms 14776 KB Output is correct
29 Correct 135 ms 14360 KB Output is correct
30 Correct 127 ms 13748 KB Output is correct
31 Correct 120 ms 13120 KB Output is correct
32 Correct 128 ms 13256 KB Output is correct
33 Correct 15 ms 1916 KB Output is correct
34 Correct 149 ms 15400 KB Output is correct
35 Correct 137 ms 14816 KB Output is correct
36 Correct 141 ms 15084 KB Output is correct
37 Correct 139 ms 14820 KB Output is correct
38 Correct 148 ms 14648 KB Output is correct
39 Correct 140 ms 14904 KB Output is correct
40 Correct 143 ms 14900 KB Output is correct
41 Correct 71 ms 4496 KB Output is correct
42 Correct 120 ms 13268 KB Output is correct
43 Correct 156 ms 16592 KB Output is correct
44 Correct 71 ms 4376 KB Output is correct
45 Correct 137 ms 14820 KB Output is correct
46 Correct 160 ms 16736 KB Output is correct
47 Correct 167 ms 17016 KB Output is correct
48 Correct 177 ms 17044 KB Output is correct