Submission #1000222

# Submission time Handle Problem Language Result Execution time Memory
1000222 2024-06-17T06:38:40 Z vicvic Snowball (JOI21_ho_t2) C++11
100 / 100
179 ms 13904 KB
#include <iostream>
#include <climits>
#include <algorithm>
using namespace std;
const int nmax=2e5;
long long int n, nrq, mx[nmax+5], mn[nmax+5], poz[nmax+5], rez[nmax+5];
int main()
{
    cin >> n >> nrq;
    for (int i=1;i<=n;i++)
    {
        cin >> poz[i];
    }
    sort (poz+1, poz+n+1);
    long long int dep=0;
    for (int i=1;i<=nrq;i++)
    {
        long long int val;
        cin >> val;
        dep+=val;
        mn[i]=min (mn[i-1], dep);
        mx[i]=max (mx[i-1], dep);
    }
    rez[1]+=abs (mn[nrq]);
    rez[n]+=mx[nrq];
    for (int i=2;i<=n;i++)
    {
        long long int st=1, dr=nrq, ret=0;
        while (st<=dr)
        {
            int mij = (st+dr) >> 1;
            if (poz[i]-poz[i-1]>mx[mij]-mn[mij])
            {
                ret=mij;
                st=mij+1;
            }
            else dr=mij-1;
        }
        rez[i-1]+=mx[ret];
        if (ret+1<=nrq && mx[ret+1]>mx[ret])
        {
            rez[i-1]+=poz[i]-poz[i-1]-(mx[ret]-mn[ret]);
        }
        else if (ret+1<=nrq)
        {
            rez[i]+=poz[i]-poz[i-1]-(mx[ret]-mn[ret]);
        }
        rez[i]+=abs (mn[ret]);
    }
    for (int i=1;i<=n;i++)
    {
        cout << rez[i] << "\n";
    }
    return 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 464 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 1 ms 500 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 1 ms 456 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 448 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 2 ms 548 KB Output is correct
16 Correct 2 ms 504 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
# 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 464 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 1 ms 500 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 1 ms 456 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 448 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 2 ms 548 KB Output is correct
16 Correct 2 ms 504 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 53 ms 5460 KB Output is correct
21 Correct 51 ms 5244 KB Output is correct
22 Correct 45 ms 5204 KB Output is correct
23 Correct 45 ms 5052 KB Output is correct
24 Correct 48 ms 5712 KB Output is correct
25 Correct 149 ms 11860 KB Output is correct
26 Correct 147 ms 11904 KB Output is correct
27 Correct 138 ms 11344 KB Output is correct
28 Correct 141 ms 11500 KB Output is correct
29 Correct 137 ms 11128 KB Output is correct
30 Correct 120 ms 10576 KB Output is correct
31 Correct 122 ms 9880 KB Output is correct
32 Correct 98 ms 10064 KB Output is correct
33 Correct 14 ms 1628 KB Output is correct
34 Correct 179 ms 12116 KB Output is correct
35 Correct 141 ms 11600 KB Output is correct
36 Correct 139 ms 11856 KB Output is correct
37 Correct 150 ms 11600 KB Output is correct
38 Correct 143 ms 11348 KB Output is correct
39 Correct 134 ms 11600 KB Output is correct
40 Correct 125 ms 11772 KB Output is correct
41 Correct 67 ms 6108 KB Output is correct
42 Correct 105 ms 10020 KB Output is correct
43 Correct 168 ms 13396 KB Output is correct
44 Correct 62 ms 5968 KB Output is correct
45 Correct 110 ms 11576 KB Output is correct
46 Correct 139 ms 13396 KB Output is correct
47 Correct 148 ms 13696 KB Output is correct
48 Correct 143 ms 13904 KB Output is correct