oj.uz

Submission #417072

# Submission time Handle Problem Language Result Execution time Memory
417072 2021-06-03T11:26:34 Z mat_v Snowball (JOI21_ho_t2) C++14
100 / 100
 157 ms 15308 KB 
#include <bits/stdc++.h>
#define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))

using namespace std;
typedef long long ll;

int n,m;

ll maks[200005];
ll mini[200005];
ll ans[200005];
ll niz[200005];
ll pref[200005];

ll get(int x, int idx){
    if(idx == 0){
        if(mini[x] >= 0)return 0;
        return -mini[x];
    }
    if(maks[x] <= 0)return 0;
    return maks[x];
}

int main()
{
    ios_base::sync_with_stdio(false);

    cin >> n >> m;
    ff(i,1,n)cin >> niz[i];
    ff(i,1,m){
        ll x;
        cin >> x;
        pref[i] = pref[i - 1] + x;
    }
    mini[1] = maks[1] = pref[1];
    ff(i,2,m){
        maks[i] = max(pref[i], maks[i - 1]);
        mini[i] = min(pref[i], mini[i - 1]);
    }

    ff(i,1,n-1){
        ll dif = niz[i + 1] - niz[i];
        int l = 1;
        int r = m;
        if(get(r,0) + get(r,1) < dif){
            ans[i] += get(r,1);
            ans[i + 1] += get(r,0);
            continue;
        }
        else{
            while(l < r){
                int mid = (l + r) / 2;
                if(get(mid,0) + get(mid,1) >= dif)r = mid;
                else l = mid + 1;
            }
        }

        //assert(get(l - 1,0) + get(l - 1, 1) < dif);

        if(pref[l] > 0){
            ans[i+1] += get(l,0);
            ans[i] += (dif - get(l,0));
        }
        else{
            ans[i] += get(l,1);
            ans[i + 1] += (dif - get(l,1));
        }
    }
    ans[1] += get(m,0);
    ans[n] += get(m,1);
    ff(i,1,n)cout << ans[i] << "\n";


    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:2:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    2 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
Main.cpp:29:5: note: in expansion of macro 'ff'
   29 |     ff(i,1,n)cin >> niz[i];
      |     ^~
Main.cpp:2:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    2 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
Main.cpp:30:5: note: in expansion of macro 'ff'
   30 |     ff(i,1,m){
      |     ^~
Main.cpp:2:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    2 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
Main.cpp:36:5: note: in expansion of macro 'ff'
   36 |     ff(i,2,m){
      |     ^~
Main.cpp:2:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    2 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
Main.cpp:41:5: note: in expansion of macro 'ff'
   41 |     ff(i,1,n-1){
      |     ^~
Main.cpp:2:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    2 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
Main.cpp:71:5: note: in expansion of macro 'ff'
   71 |     ff(i,1,n)cout << ans[i] << "\n";
      |     ^~

Subtask #1
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 380 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 2 ms 460 KB Output is correct
7 Correct 2 ms 460 KB Output is correct
8 Correct 2 ms 460 KB Output is correct
9 Correct 2 ms 460 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 324 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 2 ms 456 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 460 KB Output is correct

Subtask #2
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 380 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 2 ms 460 KB Output is correct
7 Correct 2 ms 460 KB Output is correct
8 Correct 2 ms 460 KB Output is correct
9 Correct 2 ms 460 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 324 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 2 ms 456 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 34 ms 7060 KB Output is correct
21 Correct 32 ms 6852 KB Output is correct
22 Correct 32 ms 6756 KB Output is correct
23 Correct 30 ms 6528 KB Output is correct
24 Correct 47 ms 7100 KB Output is correct
25 Correct 129 ms 13392 KB Output is correct
26 Correct 127 ms 13256 KB Output is correct
27 Correct 127 ms 12996 KB Output is correct
28 Correct 129 ms 13144 KB Output is correct
29 Correct 123 ms 12664 KB Output is correct
30 Correct 116 ms 12092 KB Output is correct
31 Correct 82 ms 11444 KB Output is correct
32 Correct 77 ms 11636 KB Output is correct
33 Correct 12 ms 1628 KB Output is correct
34 Correct 136 ms 13684 KB Output is correct
35 Correct 157 ms 13120 KB Output is correct
36 Correct 126 ms 13436 KB Output is correct
37 Correct 129 ms 13132 KB Output is correct
38 Correct 127 ms 12988 KB Output is correct
39 Correct 121 ms 13176 KB Output is correct
40 Correct 91 ms 13164 KB Output is correct
41 Correct 36 ms 7748 KB Output is correct
42 Correct 67 ms 11588 KB Output is correct
43 Correct 101 ms 14940 KB Output is correct
44 Correct 38 ms 7612 KB Output is correct
45 Correct 79 ms 13124 KB Output is correct
46 Correct 101 ms 15060 KB Output is correct
47 Correct 108 ms 15228 KB Output is correct
48 Correct 126 ms 15308 KB Output is correct