oj.uz

답안 #968211

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
968211 2024-04-23T08:30:50 Z gaga999 Real Mountains (CCO23_day1problem2) C++17
18 / 25
 1731 ms 107536 KB 
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx,avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
#define lowbit(x) ((x) & -(x))
#define ml(a, b) ((1ll * (a) * (b)) % M)
#define tml(a, b) (a) = ((1ll * (a) * (b)) % M)
#define ad(a, b) ((0ll + (a) + (b)) % M)
#define tad(a, b) (a) = ((0ll + (a) + (b)) % M)
#define mi(a, b) ((0ll + M + (a) - (b)) % M)
#define tmi(a, b) (a) = ((0ll + M + (a) - (b)) % M)
#define tmin(a, b) (a) = min((a), (b))
#define tmax(a, b) (a) = max((a), (b))
#define iter(a) (a).begin(), (a).end()
#define riter(a) (a).rbegin(), (a).rend()
#define init(a, b) memset((a), (b), sizeof(a))
#define cpy(a, b) memcpy((a), (b), sizeof(a))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define size(x) (int)x.size()
#define pb emplace_back
#define mpr make_pair
#define ls(i) ((i) << 1)
#define rs(i) ((i) << 1 | 1)
#define INF 0x3f3f3f3f
#define NIF 0xc0c0c0c0
#define eps 1e-9
#define F first
#define S second
#define AC cin.tie(0)->sync_with_stdio(0)
using namespace std;
typedef long long llt;
typedef __int128_t lll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<llt, llt> pll;
typedef complex<double> cd;
const int M = 1e6 + 3;

// random_device rm;
// mt19937 rg(rm());
// default_random_engine rg(rm());
// uniform_int_distribution<int> rd(INT_MIN, INT_MAX);
// uniform_real_distribution<double> rd(0, M_PI);

void db() { cerr << "\n"; }
template <class T, class... U>
void db(T a, U... b) { cerr << a << " ", db(b...); }

inline char gc()
{
    const static int SZ = 1 << 16;
    static char buf[SZ], *p1, *p2;
    if (p1 == p2 && (p2 = buf + fread(p1 = buf, 1, SZ, stdin), p1 == p2))
        return -1;
    return *p1++;
}
void rd() {}
template <typename T, typename... U>
void rd(T &x, U &...y)
{
    x = 0;
    bool f = 0;
    char c = gc();
    while (!isdigit(c))
        f ^= !(c ^ 45), c = gc();
    while (isdigit(c))
        x = (x << 1) + (x << 3) + (c ^ 48), c = gc();
    f && (x = -x), rd(y...);
}

template <typename T>
void prt(T x)
{
    if (x < 0)
        putchar('-'), x = -x;
    if (x > 9)
        prt(x / 10);
    putchar((x % 10) ^ 48);
}

const int N = 1e6 + 6;
int h[N], tr[N << 1], ln;
vector<int> po;
vector<int> pl[N];
bool vd[N];

inline int fd(int x)
{
    return lower_bound(iter(po), x) - po.begin();
}

signed main()
{
    int n;
    rd(n);
    for (int i = 1; i <= n; i++)
        rd(h[i]), tr[i + n - 1] = h[i];
#define pul(x) tr[x] = min(tr[ls(x)], tr[rs(x)])
    for (int i = n - 1; i > 0; i--)
        pul(i);
    auto cg = [&](int p, int v) -> void
    {
        p += n - 1, tr[p] = v;
        for (p >>= 1; p; p >>= 1)
            pul(p);
    };
    auto qy = [&](int l, int r) -> int
    {
        int mn = INF;
        for (l += n - 1, r += n - 1; l <= r; l >>= 1, r >>= 1)
        {
            if (l & 1)
                tmin(mn, tr[l++]);
            if (~r & 1)
                tmin(mn, tr[r--]);
        }
        return mn;
    };
    po = vector<int>(h + 1, h + n + 1);
    sort(iter(po)), uni(po);
    ln = size(po);
    for (int i = 1; i <= n; i++)
        h[i] = fd(h[i]), pl[h[i]].pb(i);
    int vl = 1, vr = n;
    set<int> st;
    llt ans = 0;
    for (int i = 0; i < ln; i++)
    {
        for (int j : pl[i])
            vd[j] = 1, st.insert(j), cg(j, INF);
        while (vd[vl])
            vl++;
        while (vd[vr])
            vr--;
        while (!st.empty() && vl >= *st.begin())
            st.erase(st.begin());
        while (!st.empty() && vr <= *st.rbegin())
            st.erase(prev(st.end()));
        if (st.empty())
            continue;
        int num = size(st), d = po[i + 1] - po[i];
        llt sum = ((po[i + 1] - 1ll + po[i]) * d) >> 1;
        int v0 = qy(1, *st.begin()), v2 = qy(*st.rbegin(), n);
        if (num == 1)
        {
            ans += (v0 + v2) * d + sum;
        }
        else
        {
            ans += sum * num;
            sum += po[i + 1] - po[i];
            ans += sum * ((num << 1) - 3ll);
            int v1 = qy(*st.begin(), *st.rbegin());
            ans += (0ll + v0 + v2 + min({v0, v1, v2})) * d;
        }
    }
    prt(ans % M), putchar('\n');
}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 26968 KB Output is correct
2 Correct 6 ms 26972 KB Output is correct
3 Correct 6 ms 27072 KB Output is correct
4 Correct 7 ms 27228 KB Output is correct
5 Correct 7 ms 27228 KB Output is correct
6 Correct 9 ms 27388 KB Output is correct
7 Correct 7 ms 27396 KB Output is correct
8 Correct 9 ms 27224 KB Output is correct
9 Correct 7 ms 26972 KB Output is correct
10 Correct 6 ms 26972 KB Output is correct
11 Correct 7 ms 27228 KB Output is correct
12 Correct 7 ms 27224 KB Output is correct

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 26968 KB Output is correct
2 Correct 6 ms 26972 KB Output is correct
3 Correct 6 ms 27072 KB Output is correct
4 Correct 7 ms 27228 KB Output is correct
5 Correct 7 ms 27228 KB Output is correct
6 Correct 9 ms 27388 KB Output is correct
7 Correct 7 ms 27396 KB Output is correct
8 Correct 9 ms 27224 KB Output is correct
9 Correct 7 ms 26972 KB Output is correct
10 Correct 6 ms 26972 KB Output is correct
11 Correct 7 ms 27228 KB Output is correct
12 Correct 7 ms 27224 KB Output is correct
13 Correct 8 ms 27228 KB Output is correct
14 Correct 7 ms 26972 KB Output is correct
15 Correct 6 ms 26972 KB Output is correct
16 Correct 8 ms 27352 KB Output is correct
17 Correct 7 ms 27228 KB Output is correct
18 Correct 7 ms 27324 KB Output is correct
19 Correct 7 ms 27224 KB Output is correct
20 Correct 7 ms 27228 KB Output is correct
21 Correct 7 ms 27228 KB Output is correct
22 Correct 7 ms 27228 KB Output is correct
23 Correct 7 ms 27228 KB Output is correct
24 Correct 7 ms 27420 KB Output is correct
25 Correct 7 ms 27228 KB Output is correct
26 Correct 7 ms 27156 KB Output is correct
27 Correct 7 ms 27228 KB Output is correct
28 Correct 7 ms 27348 KB Output is correct
29 Correct 6 ms 26968 KB Output is correct
30 Correct 6 ms 26972 KB Output is correct
31 Correct 6 ms 26972 KB Output is correct
32 Correct 7 ms 26972 KB Output is correct
33 Correct 6 ms 26972 KB Output is correct
34 Correct 5 ms 26972 KB Output is correct

Subtask #3
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 26968 KB Output is correct
2 Correct 6 ms 26972 KB Output is correct
3 Correct 6 ms 27072 KB Output is correct
4 Correct 7 ms 27228 KB Output is correct
5 Correct 7 ms 27228 KB Output is correct
6 Correct 9 ms 27388 KB Output is correct
7 Correct 7 ms 27396 KB Output is correct
8 Correct 9 ms 27224 KB Output is correct
9 Correct 7 ms 26972 KB Output is correct
10 Correct 6 ms 26972 KB Output is correct
11 Correct 7 ms 27228 KB Output is correct
12 Correct 7 ms 27224 KB Output is correct
13 Correct 8 ms 27228 KB Output is correct
14 Correct 7 ms 26972 KB Output is correct
15 Correct 6 ms 26972 KB Output is correct
16 Correct 8 ms 27352 KB Output is correct
17 Correct 7 ms 27228 KB Output is correct
18 Correct 7 ms 27324 KB Output is correct
19 Correct 7 ms 27224 KB Output is correct
20 Correct 7 ms 27228 KB Output is correct
21 Correct 7 ms 27228 KB Output is correct
22 Correct 7 ms 27228 KB Output is correct
23 Correct 7 ms 27228 KB Output is correct
24 Correct 7 ms 27420 KB Output is correct
25 Correct 7 ms 27228 KB Output is correct
26 Correct 7 ms 27156 KB Output is correct
27 Correct 7 ms 27228 KB Output is correct
28 Correct 7 ms 27348 KB Output is correct
29 Correct 6 ms 26968 KB Output is correct
30 Correct 6 ms 26972 KB Output is correct
31 Correct 6 ms 26972 KB Output is correct
32 Correct 7 ms 26972 KB Output is correct
33 Correct 6 ms 26972 KB Output is correct
34 Correct 5 ms 26972 KB Output is correct
35 Correct 8 ms 27484 KB Output is correct
36 Correct 8 ms 27480 KB Output is correct
37 Correct 10 ms 27484 KB Output is correct
38 Correct 9 ms 27484 KB Output is correct
39 Correct 8 ms 27484 KB Output is correct
40 Correct 8 ms 27356 KB Output is correct
41 Correct 7 ms 27224 KB Output is correct
42 Correct 8 ms 27228 KB Output is correct
43 Correct 8 ms 27484 KB Output is correct
44 Correct 8 ms 27484 KB Output is correct
45 Correct 8 ms 27484 KB Output is correct
46 Correct 10 ms 27484 KB Output is correct
47 Correct 8 ms 27484 KB Output is correct
48 Correct 8 ms 27332 KB Output is correct

Subtask #4
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 26968 KB Output is correct
2 Correct 6 ms 26972 KB Output is correct
3 Correct 6 ms 27072 KB Output is correct
4 Correct 7 ms 27228 KB Output is correct
5 Correct 7 ms 27228 KB Output is correct
6 Correct 9 ms 27388 KB Output is correct
7 Correct 7 ms 27396 KB Output is correct
8 Correct 9 ms 27224 KB Output is correct
9 Correct 7 ms 26972 KB Output is correct
10 Correct 6 ms 26972 KB Output is correct
11 Correct 7 ms 27228 KB Output is correct
12 Correct 7 ms 27224 KB Output is correct
13 Correct 8 ms 27228 KB Output is correct
14 Correct 7 ms 26972 KB Output is correct
15 Correct 6 ms 26972 KB Output is correct
16 Correct 8 ms 27352 KB Output is correct
17 Correct 7 ms 27228 KB Output is correct
18 Correct 7 ms 27324 KB Output is correct
19 Correct 7 ms 27224 KB Output is correct
20 Correct 7 ms 27228 KB Output is correct
21 Correct 7 ms 27228 KB Output is correct
22 Correct 7 ms 27228 KB Output is correct
23 Correct 7 ms 27228 KB Output is correct
24 Correct 7 ms 27420 KB Output is correct
25 Correct 7 ms 27228 KB Output is correct
26 Correct 7 ms 27156 KB Output is correct
27 Correct 7 ms 27228 KB Output is correct
28 Correct 7 ms 27348 KB Output is correct
29 Correct 6 ms 26968 KB Output is correct
30 Correct 6 ms 26972 KB Output is correct
31 Correct 6 ms 26972 KB Output is correct
32 Correct 7 ms 26972 KB Output is correct
33 Correct 6 ms 26972 KB Output is correct
34 Correct 5 ms 26972 KB Output is correct
35 Correct 8 ms 27484 KB Output is correct
36 Correct 8 ms 27480 KB Output is correct
37 Correct 10 ms 27484 KB Output is correct
38 Correct 9 ms 27484 KB Output is correct
39 Correct 8 ms 27484 KB Output is correct
40 Correct 8 ms 27356 KB Output is correct
41 Correct 7 ms 27224 KB Output is correct
42 Correct 8 ms 27228 KB Output is correct
43 Correct 8 ms 27484 KB Output is correct
44 Correct 8 ms 27484 KB Output is correct
45 Correct 8 ms 27484 KB Output is correct
46 Correct 10 ms 27484 KB Output is correct
47 Correct 8 ms 27484 KB Output is correct
48 Correct 8 ms 27332 KB Output is correct
49 Incorrect 8 ms 27356 KB Output isn't correct
50 Halted 0 ms 0 KB -

Subtask #5
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 26968 KB Output is correct
2 Correct 6 ms 26972 KB Output is correct
3 Correct 6 ms 27072 KB Output is correct
4 Correct 7 ms 27228 KB Output is correct
5 Correct 7 ms 27228 KB Output is correct
6 Correct 9 ms 27388 KB Output is correct
7 Correct 7 ms 27396 KB Output is correct
8 Correct 9 ms 27224 KB Output is correct
9 Correct 7 ms 26972 KB Output is correct
10 Correct 6 ms 26972 KB Output is correct
11 Correct 7 ms 27228 KB Output is correct
12 Correct 7 ms 27224 KB Output is correct
13 Correct 8 ms 27228 KB Output is correct
14 Correct 7 ms 26972 KB Output is correct
15 Correct 6 ms 26972 KB Output is correct
16 Correct 8 ms 27352 KB Output is correct
17 Correct 7 ms 27228 KB Output is correct
18 Correct 7 ms 27324 KB Output is correct
19 Correct 7 ms 27224 KB Output is correct
20 Correct 7 ms 27228 KB Output is correct
21 Correct 7 ms 27228 KB Output is correct
22 Correct 7 ms 27228 KB Output is correct
23 Correct 7 ms 27228 KB Output is correct
24 Correct 7 ms 27420 KB Output is correct
25 Correct 7 ms 27228 KB Output is correct
26 Correct 7 ms 27156 KB Output is correct
27 Correct 7 ms 27228 KB Output is correct
28 Correct 7 ms 27348 KB Output is correct
29 Correct 6 ms 26968 KB Output is correct
30 Correct 6 ms 26972 KB Output is correct
31 Correct 6 ms 26972 KB Output is correct
32 Correct 7 ms 26972 KB Output is correct
33 Correct 6 ms 26972 KB Output is correct
34 Correct 5 ms 26972 KB Output is correct
35 Correct 714 ms 92924 KB Output is correct
36 Correct 763 ms 92660 KB Output is correct
37 Correct 900 ms 92636 KB Output is correct
38 Correct 753 ms 92752 KB Output is correct
39 Correct 802 ms 92768 KB Output is correct
40 Correct 6 ms 26972 KB Output is correct
41 Correct 6 ms 26972 KB Output is correct
42 Correct 297 ms 91480 KB Output is correct
43 Correct 311 ms 91272 KB Output is correct
44 Correct 313 ms 91300 KB Output is correct
45 Correct 234 ms 92752 KB Output is correct
46 Correct 233 ms 93076 KB Output is correct
47 Correct 233 ms 92752 KB Output is correct
48 Correct 316 ms 92764 KB Output is correct
49 Correct 330 ms 92956 KB Output is correct
50 Correct 335 ms 92656 KB Output is correct

Subtask #6
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 26968 KB Output is correct
2 Correct 6 ms 26972 KB Output is correct
3 Correct 6 ms 27072 KB Output is correct
4 Correct 7 ms 27228 KB Output is correct
5 Correct 7 ms 27228 KB Output is correct
6 Correct 9 ms 27388 KB Output is correct
7 Correct 7 ms 27396 KB Output is correct
8 Correct 9 ms 27224 KB Output is correct
9 Correct 7 ms 26972 KB Output is correct
10 Correct 6 ms 26972 KB Output is correct
11 Correct 7 ms 27228 KB Output is correct
12 Correct 7 ms 27224 KB Output is correct
13 Correct 8 ms 27228 KB Output is correct
14 Correct 7 ms 26972 KB Output is correct
15 Correct 6 ms 26972 KB Output is correct
16 Correct 8 ms 27352 KB Output is correct
17 Correct 7 ms 27228 KB Output is correct
18 Correct 7 ms 27324 KB Output is correct
19 Correct 7 ms 27224 KB Output is correct
20 Correct 7 ms 27228 KB Output is correct
21 Correct 7 ms 27228 KB Output is correct
22 Correct 7 ms 27228 KB Output is correct
23 Correct 7 ms 27228 KB Output is correct
24 Correct 7 ms 27420 KB Output is correct
25 Correct 7 ms 27228 KB Output is correct
26 Correct 7 ms 27156 KB Output is correct
27 Correct 7 ms 27228 KB Output is correct
28 Correct 7 ms 27348 KB Output is correct
29 Correct 6 ms 26968 KB Output is correct
30 Correct 6 ms 26972 KB Output is correct
31 Correct 6 ms 26972 KB Output is correct
32 Correct 7 ms 26972 KB Output is correct
33 Correct 6 ms 26972 KB Output is correct
34 Correct 5 ms 26972 KB Output is correct
35 Correct 8 ms 27484 KB Output is correct
36 Correct 8 ms 27480 KB Output is correct
37 Correct 10 ms 27484 KB Output is correct
38 Correct 9 ms 27484 KB Output is correct
39 Correct 8 ms 27484 KB Output is correct
40 Correct 8 ms 27356 KB Output is correct
41 Correct 7 ms 27224 KB Output is correct
42 Correct 8 ms 27228 KB Output is correct
43 Correct 8 ms 27484 KB Output is correct
44 Correct 8 ms 27484 KB Output is correct
45 Correct 8 ms 27484 KB Output is correct
46 Correct 10 ms 27484 KB Output is correct
47 Correct 8 ms 27484 KB Output is correct
48 Correct 8 ms 27332 KB Output is correct
49 Correct 714 ms 92924 KB Output is correct
50 Correct 763 ms 92660 KB Output is correct
51 Correct 900 ms 92636 KB Output is correct
52 Correct 753 ms 92752 KB Output is correct
53 Correct 802 ms 92768 KB Output is correct
54 Correct 6 ms 26972 KB Output is correct
55 Correct 6 ms 26972 KB Output is correct
56 Correct 297 ms 91480 KB Output is correct
57 Correct 311 ms 91272 KB Output is correct
58 Correct 313 ms 91300 KB Output is correct
59 Correct 234 ms 92752 KB Output is correct
60 Correct 233 ms 93076 KB Output is correct
61 Correct 233 ms 92752 KB Output is correct
62 Correct 316 ms 92764 KB Output is correct
63 Correct 330 ms 92956 KB Output is correct
64 Correct 335 ms 92656 KB Output is correct
65 Correct 1722 ms 107504 KB Output is correct
66 Correct 1611 ms 107364 KB Output is correct
67 Correct 1705 ms 107420 KB Output is correct
68 Correct 1731 ms 107140 KB Output is correct
69 Correct 1657 ms 107360 KB Output is correct
70 Correct 336 ms 91508 KB Output is correct
71 Correct 306 ms 91512 KB Output is correct
72 Correct 313 ms 91488 KB Output is correct
73 Correct 559 ms 107268 KB Output is correct
74 Correct 602 ms 107424 KB Output is correct
75 Correct 541 ms 107536 KB Output is correct
76 Correct 722 ms 107072 KB Output is correct
77 Correct 739 ms 107096 KB Output is correct
78 Correct 773 ms 106832 KB Output is correct

Subtask #7
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 26968 KB Output is correct
2 Correct 6 ms 26972 KB Output is correct
3 Correct 6 ms 27072 KB Output is correct
4 Correct 7 ms 27228 KB Output is correct
5 Correct 7 ms 27228 KB Output is correct
6 Correct 9 ms 27388 KB Output is correct
7 Correct 7 ms 27396 KB Output is correct
8 Correct 9 ms 27224 KB Output is correct
9 Correct 7 ms 26972 KB Output is correct
10 Correct 6 ms 26972 KB Output is correct
11 Correct 7 ms 27228 KB Output is correct
12 Correct 7 ms 27224 KB Output is correct
13 Correct 8 ms 27228 KB Output is correct
14 Correct 7 ms 26972 KB Output is correct
15 Correct 6 ms 26972 KB Output is correct
16 Correct 8 ms 27352 KB Output is correct
17 Correct 7 ms 27228 KB Output is correct
18 Correct 7 ms 27324 KB Output is correct
19 Correct 7 ms 27224 KB Output is correct
20 Correct 7 ms 27228 KB Output is correct
21 Correct 7 ms 27228 KB Output is correct
22 Correct 7 ms 27228 KB Output is correct
23 Correct 7 ms 27228 KB Output is correct
24 Correct 7 ms 27420 KB Output is correct
25 Correct 7 ms 27228 KB Output is correct
26 Correct 7 ms 27156 KB Output is correct
27 Correct 7 ms 27228 KB Output is correct
28 Correct 7 ms 27348 KB Output is correct
29 Correct 6 ms 26968 KB Output is correct
30 Correct 6 ms 26972 KB Output is correct
31 Correct 6 ms 26972 KB Output is correct
32 Correct 7 ms 26972 KB Output is correct
33 Correct 6 ms 26972 KB Output is correct
34 Correct 5 ms 26972 KB Output is correct
35 Correct 8 ms 27484 KB Output is correct
36 Correct 8 ms 27480 KB Output is correct
37 Correct 10 ms 27484 KB Output is correct
38 Correct 9 ms 27484 KB Output is correct
39 Correct 8 ms 27484 KB Output is correct
40 Correct 8 ms 27356 KB Output is correct
41 Correct 7 ms 27224 KB Output is correct
42 Correct 8 ms 27228 KB Output is correct
43 Correct 8 ms 27484 KB Output is correct
44 Correct 8 ms 27484 KB Output is correct
45 Correct 8 ms 27484 KB Output is correct
46 Correct 10 ms 27484 KB Output is correct
47 Correct 8 ms 27484 KB Output is correct
48 Correct 8 ms 27332 KB Output is correct
49 Incorrect 8 ms 27356 KB Output isn't correct
50 Halted 0 ms 0 KB -