oj.uz

Submission #915474

# Submission time Handle Problem Language Result Execution time Memory
915474 2024-01-24T02:58:35 Z HorizonWest Snowball (JOI21_ho_t2) C++17
33 / 100
 110 ms 12252 KB 
#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define db double
#define ll __int128
#define int long long
#define pb push_back
#define fs first
#define sd second
#define Mod long(1e9 + 7)
#define all(x) x.begin(), x.end()
#define unvisited long(-1)
#define Eps double(1e-9)
#define _for(i, n) for(int i = 0; i < (n); i++)
#define dbg(x) cout << #x ": " << x << endl;

const int Max = 1e6 + 7, Inf = 1e17 + 7;

void print(bool x) { cout << (x ? "YES" : "NO") << endl; }

string tostring (__int128 x)
{
    string ans = "";
    while(x > 0)
    {
        ans += (x % 10 + '0');
        x /= 10;
    }
    reverse(all(ans));
    return ans;
}

void solve()
{
    int n, q; cin >> n >> q; 
    vector <int> v(n); 
    for(auto& u : v) cin >> u;

    vector <int> s(q), mx(q), mn(q); 
    for(int i = 0; i < q; i++)
    {
        cin >> s[i]; 
        if(i != 0)
        {
            s[i] += s[i-1];
            mn[i] = min(s[i], mn[i-1]);
            mx[i] = max(s[i], mx[i-1]);
        }
        else 
        {        
            mn[i] = mx[i] = s[i];
        }
    }

    for(int i = 0; i < n; i++)
    {
        int a = -1, b = q, ans = 0, x, y;

        x = v[i]; y = (i+1 != n ? v[i+1] : Inf);
        while(abs(a - b) != 1)
        {
            int c = (a + b) / 2; 

            if(mx[c] + x < mn[c] + y)
                a = c; 
            else 
                b = c;
        }  

        if(a != -1) 
        {
            int temp = 0, t = a;
            for(int j = 0; j + t < q && j < 5; j++)
            {
                temp = max(temp, min(min((y + mn[a]), (x + mx[a])) - x, abs(x - y))); 
                //cerr << min((y + mn[a]), (x + mx[a])) - x << " " << min((y + mn[a]), (x + mx[a])) << " "<< temp << endl;
                a++;
            }
            ans += temp; //cerr << "A: " << mx[a] << " " << temp << endl;
        }

        a = -1; b = q; 

        x = v[i]; y = (i != 0 ? v[i-1] : -Inf);
        
        while(abs(a - b) != 1)
        {
            int c = (a + b) / 2;//cerr << mx[c] + x << " " << mn[c] + y << endl;

            if(mn[c] + x > mx[c] + y)
                a = c; 
            else 
                b = c;
        }   //cerr << a << " " << mn[a] << endl;

        if(a != -1)
        {
            int temp = 0, t = a; //cerr << a << " " << x - mn[a] << " " << mx[a] << endl;
            for(int j = 0; j + t < q && j < 5; j++)
            {      //cerr << max((x + mn[a]), (y + mx[a])) << endl;
                temp = max(temp, min(x - max((x + mn[a]), (y + mx[a])), abs(x - y)));
                a++;
            }
            ans += temp; //cerr << "B: " << mx[a] << " " << temp << endl;
        }

        cout << ans << endl;    
    }
}

int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int Q = 1; //cin >> Q;

    while (Q--)
    {
        solve();
    }

    return 0;
}

Subtask #1
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 488 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 552 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 572 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct

Subtask #2
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 488 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 552 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 572 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 20 ms 7248 KB Output is correct
21 Correct 20 ms 7004 KB Output is correct
22 Correct 22 ms 6868 KB Output is correct
23 Correct 19 ms 6748 KB Output is correct
24 Correct 25 ms 7004 KB Output is correct
25 Correct 107 ms 11996 KB Output is correct
26 Correct 104 ms 11880 KB Output is correct
27 Correct 104 ms 11604 KB Output is correct
28 Correct 103 ms 11756 KB Output is correct
29 Correct 101 ms 11096 KB Output is correct
30 Correct 110 ms 10768 KB Output is correct
31 Correct 82 ms 10064 KB Output is correct
32 Correct 75 ms 10068 KB Output is correct
33 Correct 9 ms 1624 KB Output is correct
34 Correct 107 ms 12252 KB Output is correct
35 Correct 104 ms 11956 KB Output is correct
36 Correct 103 ms 11860 KB Output is correct
37 Correct 103 ms 11784 KB Output is correct
38 Correct 102 ms 11600 KB Output is correct
39 Correct 100 ms 11604 KB Output is correct
40 Correct 88 ms 11604 KB Output is correct
41 Incorrect 21 ms 7768 KB Output isn't correct
42 Halted 0 ms 0 KB -