oj.uz

Submission #1005260

# Submission time Handle Problem Language Result Execution time Memory
1005260 2024-06-22T09:23:54 Z coolboy19521 Horses (IOI15_horses) C++17
57 / 100
 1500 ms 175444 KB 
#include "bits/stdc++.h"
#include "horses.h"
#define ld long double
#define i64 __int128

using namespace std;

const i64 sz = 1e6 + 25;
const i64 md = 1e9 + 7;

i64 lz1m[sz * 4], lz1d[sz * 4];
i64 st1[sz * 4];
ld lz2m[sz * 4], lz2d[sz * 4];
pair<ld, i64> st2[sz * 4];
ld d[sz];
i64 a[sz], b[sz], c[sz];
i64 n;

i64 bp(i64 x, i64 b) {
    if (0 == b) return 1;
    i64 r = bp(x, b / 2) % md;
    if (b % 2) return (r * r % md) * x % md;
    return r * r % md;
}

void build1(i64 le, i64 ri, i64 v) {
    lz1m[v] = 1;
    lz1d[v] = 1;
    if (le == ri) {
        st1[v] = c[le] * b[le] % md;
        return;
    }
    i64 mi = le + (ri - le) / 2;
    build1(le, mi, v * 2);
    build1(mi + 1, ri, v * 2 + 1);
    st1[v] = (st1[v * 2] + st1[v * 2 + 1]) % md; // Combine segments
}

void relax1(i64 v, i64 le, i64 ri) {
    if (lz1m[v] != 1 || lz1d[v] != 1) {
        (st1[v] *= lz1m[v]) %= md;
        (st1[v] *= bp(lz1d[v], md - 2)) %= md;
        if (le != ri) {
            lz1m[v * 2] = (lz1m[v * 2] * lz1m[v]) % md;
            lz1m[v * 2 + 1] = (lz1m[v * 2 + 1] * lz1m[v]) % md;
            lz1d[v * 2] = (lz1d[v * 2] * lz1d[v]) % md;
            lz1d[v * 2 + 1] = (lz1d[v * 2 + 1] * lz1d[v]) % md;
        }
        lz1m[v] = 1;
        lz1d[v] = 1;
    }
}

void rupdate1(i64 le, i64 ri, i64 ql, i64 qr, i64 v, i64 m, i64 d) {
    relax1(v, le, ri);
    if (le > qr || ri < ql) return;
    if (ql <= le && ri <= qr) {
        lz1m[v] = (lz1m[v] * m) % md;
        lz1d[v] = (lz1d[v] * d) % md;
        relax1(v, le, ri);
        return;
    }
    i64 mi = le + (ri - le) / 2;
    rupdate1(le, mi, ql, qr, v * 2, m, d);
    rupdate1(mi + 1, ri, ql, qr, v * 2 + 1, m, d);
    st1[v] = (st1[v * 2] + st1[v * 2 + 1]) % md;
}

void pupdate1(i64 le, i64 ri, i64 ix, i64 v, i64 m, i64 d) {
    relax1(v, le, ri);
    if (le > ix || ri < ix) return;
    if (le == ix && ix == ri) {
        (st1[v] *= m) %= md;
        (st1[v] *= bp(d, md - 2)) %= md;
        return;
    }
    i64 mi = le + (ri - le) / 2;
    pupdate1(le, mi, ix, v * 2, m, d);
    pupdate1(mi + 1, ri, ix, v * 2 + 1, m, d);
    st1[v] = (st1[v * 2] + st1[v * 2 + 1]) % md;
}

i64 query1(i64 le, i64 ri, i64 ix, i64 v) {
    relax1(v, le, ri);
    if (le > ix || ri < ix) return 0;
    if (le == ix && ix == ri) {
        return st1[v] % md;
    }
    i64 mi = le + (ri - le) / 2;
    i64 lq = query1(le, mi, ix, v * 2);
    i64 rq = query1(mi + 1, ri, ix, v * 2 + 1);
    return (lq + rq) % md;
}

pair<ld, i64> marj(i64 v) {
    auto le = st2[v * 2];
    auto ri = st2[v * 2 + 1];
    if (le.first >= ri.first) {
        return le;
    }
    return ri;
}

void build2(i64 le, i64 ri, i64 v) {
    if (le == ri) {
        st2[v] = make_pair(d[le] + log10l(b[le]), le);
        return;
    }
    i64 mi = le + (ri - le) / 2;
    build2(le, mi, v * 2);
    build2(mi + 1, ri, v * 2 + 1);
    st2[v] = marj(v);
}

void relax2(i64 v, i64 le, i64 ri) {
    if (lz2m[v] != 0 || lz2d[v] != 0) {
        st2[v].first += lz2m[v];
        st2[v].first -= lz2d[v];
        if (le != ri) {
            lz2m[v * 2] += lz2m[v];
            lz2m[v * 2 + 1] += lz2m[v];
            lz2d[v * 2] += lz2d[v];
            lz2d[v * 2 + 1] += lz2d[v];
        }
        lz2m[v] = 0;
        lz2d[v] = 0;
    }
}

void rupdate2(i64 le, i64 ri, i64 ql, i64 qr, i64 v, ld m, ld d) {
    relax2(v, le, ri);
    if (le > qr || ri < ql) return;
    if (ql <= le && ri <= qr) {
        lz2m[v] += m;
        lz2d[v] += d;
        relax2(v, le, ri);
        return;
    }
    i64 mi = le + (ri - le) / 2;
    rupdate2(le, mi, ql, qr, v * 2, m, d);
    rupdate2(mi + 1, ri, ql, qr, v * 2 + 1, m, d);
    st2[v] = marj(v);
}

void pupdate2(i64 le, i64 ri, i64 ix, i64 v, ld m, ld d) {
    relax2(v, le, ri);
    if (le > ix || ri < ix) return;
    if (le == ix && ri == ix) {
        st2[v].first += m;
        st2[v].first -= d;
        return;
    }
    i64 mi = le + (ri - le) / 2;
    pupdate2(le, mi, ix, v * 2, m, d);
    pupdate2(mi + 1, ri, ix, v * 2 + 1, m, d);
    st2[v] = marj(v);
}

int init(int N, int x[], int y[]) {
    n = N;
    c[0] = 1;
    d[0] = 0;

    for (i64 i = 1; i <= n; i++) {
        a[i] = x[i - 1];
        b[i] = y[i - 1];
        c[i] = c[i - 1] * a[i] % md;
        d[i] = d[i - 1] + log10l(a[i]);
    }

    build1(1, n, 1);
    build2(1, n, 1);

    i64 ix = st2[1].second;

    return query1(1, n, ix, 1);
}

int updateX(int pos, int val) {
    pos++;
    rupdate1(1, n, pos, n, 1, val, a[pos]);
    rupdate2(1, n, pos, n, 1, log10l(val), log10l(a[pos]));
    a[pos] = val;
    relax2(1, 1, n);
    i64 ix = st2[1].second;

    return query1(1, n, ix, 1);
}

int updateY(int pos, int val) {
    pos++;
    pupdate1(1, n, pos, 1, val, b[pos]);
    pupdate2(1, n, pos, 1, log10l(val), log10l(b[pos]));
    b[pos] = val;
    relax2(1, 1, n);
    i64 ix = st2[1].second;

    return query1(1, n, ix, 1);
}

Compilation message

horses.cpp: In function '__int128 bp(__int128, __int128)':
horses.cpp:19:19: warning: declaration of 'b' shadows a global declaration [-Wshadow]
   19 | i64 bp(i64 x, i64 b) {
      |                   ^
horses.cpp:16:12: note: shadowed declaration is here
   16 | i64 a[sz], b[sz], c[sz];
      |            ^
horses.cpp: In function 'void rupdate1(__int128, __int128, __int128, __int128, __int128, __int128, __int128)':
horses.cpp:54:65: warning: declaration of 'd' shadows a global declaration [-Wshadow]
   54 | void rupdate1(i64 le, i64 ri, i64 ql, i64 qr, i64 v, i64 m, i64 d) {
      |                                                                 ^
horses.cpp:15:4: note: shadowed declaration is here
   15 | ld d[sz];
      |    ^
horses.cpp: In function 'void pupdate1(__int128, __int128, __int128, __int128, __int128, __int128)':
horses.cpp:69:57: warning: declaration of 'd' shadows a global declaration [-Wshadow]
   69 | void pupdate1(i64 le, i64 ri, i64 ix, i64 v, i64 m, i64 d) {
      |                                                         ^
horses.cpp:15:4: note: shadowed declaration is here
   15 | ld d[sz];
      |    ^
horses.cpp: In function 'void build2(__int128, __int128, __int128)':
horses.cpp:106:47: warning: conversion from '__int128' to 'long double' may change value [-Wconversion]
  106 |         st2[v] = make_pair(d[le] + log10l(b[le]), le);
      |                                           ~~~~^
horses.cpp: In function 'void rupdate2(__int128, __int128, __int128, __int128, __int128, long double, long double)':
horses.cpp:130:63: warning: declaration of 'd' shadows a global declaration [-Wshadow]
  130 | void rupdate2(i64 le, i64 ri, i64 ql, i64 qr, i64 v, ld m, ld d) {
      |                                                               ^
horses.cpp:15:4: note: shadowed declaration is here
   15 | ld d[sz];
      |    ^
horses.cpp: In function 'void pupdate2(__int128, __int128, __int128, __int128, long double, long double)':
horses.cpp:145:55: warning: declaration of 'd' shadows a global declaration [-Wshadow]
  145 | void pupdate2(i64 le, i64 ri, i64 ix, i64 v, ld m, ld d) {
      |                                                       ^
horses.cpp:15:4: note: shadowed declaration is here
   15 | ld d[sz];
      |    ^
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:168:37: warning: conversion from '__int128' to 'long double' may change value [-Wconversion]
  168 |         d[i] = d[i - 1] + log10l(a[i]);
      |                                  ~~~^
horses.cpp:176:18: warning: conversion from '__int128' to 'int' may change value [-Wconversion]
  176 |     return query1(1, n, ix, 1);
      |            ~~~~~~^~~~~~~~~~~~~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:182:56: warning: conversion from '__int128' to 'long double' may change value [-Wconversion]
  182 |     rupdate2(1, n, pos, n, 1, log10l(val), log10l(a[pos]));
      |                                                   ~~~~~^
horses.cpp:187:18: warning: conversion from '__int128' to 'int' may change value [-Wconversion]
  187 |     return query1(1, n, ix, 1);
      |            ~~~~~~^~~~~~~~~~~~~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:193:53: warning: conversion from '__int128' to 'long double' may change value [-Wconversion]
  193 |     pupdate2(1, n, pos, 1, log10l(val), log10l(b[pos]));
      |                                                ~~~~~^
horses.cpp:198:18: warning: conversion from '__int128' to 'int' may change value [-Wconversion]
  198 |     return query1(1, n, ix, 1);
      |            ~~~~~~^~~~~~~~~~~~~

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Correct 1 ms 14684 KB Output is correct
3 Correct 1 ms 14684 KB Output is correct
4 Correct 1 ms 14684 KB Output is correct
5 Correct 1 ms 14684 KB Output is correct
6 Correct 2 ms 14684 KB Output is correct
7 Correct 2 ms 14684 KB Output is correct
8 Correct 2 ms 14684 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 2 ms 14936 KB Output is correct
11 Correct 2 ms 14684 KB Output is correct
12 Correct 1 ms 14684 KB Output is correct
13 Correct 2 ms 14684 KB Output is correct
14 Correct 2 ms 14680 KB Output is correct
15 Correct 2 ms 14684 KB Output is correct
16 Correct 1 ms 14680 KB Output is correct
17 Correct 1 ms 14684 KB Output is correct
18 Correct 2 ms 14684 KB Output is correct
19 Correct 2 ms 14684 KB Output is correct
20 Correct 1 ms 14680 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Correct 1 ms 14684 KB Output is correct
3 Correct 2 ms 14680 KB Output is correct
4 Correct 2 ms 14696 KB Output is correct
5 Correct 2 ms 14684 KB Output is correct
6 Correct 1 ms 14684 KB Output is correct
7 Correct 1 ms 14684 KB Output is correct
8 Correct 1 ms 14684 KB Output is correct
9 Correct 1 ms 14684 KB Output is correct
10 Correct 1 ms 14684 KB Output is correct
11 Correct 2 ms 14680 KB Output is correct
12 Correct 1 ms 14684 KB Output is correct
13 Correct 2 ms 14680 KB Output is correct
14 Correct 2 ms 14684 KB Output is correct
15 Correct 1 ms 14684 KB Output is correct
16 Correct 2 ms 14748 KB Output is correct
17 Correct 1 ms 14684 KB Output is correct
18 Correct 2 ms 14684 KB Output is correct
19 Correct 1 ms 14684 KB Output is correct
20 Correct 2 ms 14684 KB Output is correct
21 Correct 2 ms 14804 KB Output is correct
22 Correct 2 ms 14684 KB Output is correct
23 Correct 8 ms 14916 KB Output is correct
24 Correct 8 ms 14936 KB Output is correct
25 Correct 4 ms 14684 KB Output is correct
26 Correct 6 ms 14900 KB Output is correct
27 Correct 7 ms 14684 KB Output is correct
28 Correct 8 ms 14940 KB Output is correct
29 Correct 10 ms 14684 KB Output is correct
30 Correct 12 ms 14944 KB Output is correct
31 Correct 3 ms 14940 KB Output is correct
32 Correct 5 ms 14684 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 267 ms 132692 KB Output is correct
2 Execution timed out 1552 ms 165296 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Correct 1 ms 14684 KB Output is correct
3 Correct 2 ms 14680 KB Output is correct
4 Correct 2 ms 14684 KB Output is correct
5 Correct 2 ms 14684 KB Output is correct
6 Correct 1 ms 14684 KB Output is correct
7 Correct 1 ms 14684 KB Output is correct
8 Correct 2 ms 14684 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 2 ms 14684 KB Output is correct
11 Correct 2 ms 14680 KB Output is correct
12 Correct 1 ms 14684 KB Output is correct
13 Correct 2 ms 14684 KB Output is correct
14 Correct 2 ms 14684 KB Output is correct
15 Correct 2 ms 14684 KB Output is correct
16 Correct 1 ms 14684 KB Output is correct
17 Correct 1 ms 14684 KB Output is correct
18 Correct 2 ms 14684 KB Output is correct
19 Correct 2 ms 14684 KB Output is correct
20 Correct 1 ms 14684 KB Output is correct
21 Correct 2 ms 14684 KB Output is correct
22 Correct 2 ms 14684 KB Output is correct
23 Correct 11 ms 14916 KB Output is correct
24 Correct 9 ms 14940 KB Output is correct
25 Correct 4 ms 14684 KB Output is correct
26 Correct 9 ms 14904 KB Output is correct
27 Correct 6 ms 14940 KB Output is correct
28 Correct 7 ms 14832 KB Output is correct
29 Correct 12 ms 14828 KB Output is correct
30 Correct 12 ms 14940 KB Output is correct
31 Correct 4 ms 14936 KB Output is correct
32 Correct 6 ms 14684 KB Output is correct
33 Correct 275 ms 167592 KB Output is correct
34 Correct 257 ms 167760 KB Output is correct
35 Correct 145 ms 140128 KB Output is correct
36 Correct 190 ms 140368 KB Output is correct
37 Correct 194 ms 150132 KB Output is correct
38 Correct 203 ms 135024 KB Output is correct
39 Correct 231 ms 134088 KB Output is correct
40 Correct 267 ms 137304 KB Output is correct
41 Correct 105 ms 135764 KB Output is correct
42 Correct 123 ms 133856 KB Output is correct
43 Correct 100 ms 136756 KB Output is correct
44 Correct 110 ms 136844 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Correct 2 ms 14684 KB Output is correct
3 Correct 1 ms 14684 KB Output is correct
4 Correct 1 ms 14680 KB Output is correct
5 Correct 1 ms 14684 KB Output is correct
6 Correct 2 ms 14684 KB Output is correct
7 Correct 2 ms 14684 KB Output is correct
8 Correct 2 ms 14684 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 1 ms 14684 KB Output is correct
11 Correct 1 ms 14808 KB Output is correct
12 Correct 1 ms 14684 KB Output is correct
13 Correct 1 ms 14684 KB Output is correct
14 Correct 1 ms 14808 KB Output is correct
15 Correct 1 ms 14680 KB Output is correct
16 Correct 1 ms 14684 KB Output is correct
17 Correct 2 ms 14684 KB Output is correct
18 Correct 2 ms 14684 KB Output is correct
19 Correct 2 ms 14684 KB Output is correct
20 Correct 2 ms 14680 KB Output is correct
21 Correct 1 ms 14776 KB Output is correct
22 Correct 1 ms 14684 KB Output is correct
23 Correct 7 ms 14932 KB Output is correct
24 Correct 8 ms 14836 KB Output is correct
25 Correct 4 ms 14684 KB Output is correct
26 Correct 7 ms 14852 KB Output is correct
27 Correct 6 ms 14684 KB Output is correct
28 Correct 9 ms 14940 KB Output is correct
29 Correct 10 ms 14684 KB Output is correct
30 Correct 11 ms 14940 KB Output is correct
31 Correct 4 ms 14940 KB Output is correct
32 Correct 5 ms 14684 KB Output is correct
33 Correct 257 ms 135764 KB Output is correct
34 Execution timed out 1547 ms 175444 KB Time limit exceeded
35 Halted 0 ms 0 KB -