oj.uz

Submission #747478

# Submission time Handle Problem Language Result Execution time Memory
747478 2023-05-24T08:15:48 Z Desh03 Horses (IOI15_horses) C++17
54 / 100
 270 ms 36912 KB 
#include "horses.h"
#include <bits/stdc++.h>
using namespace std;
 
const int mod = 1000000007;
vector<int> x, y;
int n;
 
struct segtree1 {
    vector<double> st, lz;
    vector<int> id;
    int sz;
    void init(vector<double> a) {
        sz = a.size();
        while (sz & sz - 1) ++sz;
        st.resize(sz << 1), lz.resize(sz << 1), id.resize(sz << 1);
        for (int i = sz; i < (sz << 1); i++) id[i] = i - sz;
        for (int i = 0; i < a.size(); i++) st[i + sz] = a[i] + log(y[i]);
        for (int i = sz - 1; i; i--) pull(i);
    }
    void pull(int v) {
        if (st[v << 1] >= st[v << 1 | 1]) {
            st[v] = st[v << 1], id[v] = id[v << 1];
        } else {
            st[v] = st[v << 1 | 1], id[v] = id[v << 1 | 1];
        }
    }
    void push(int v) {
        st[v << 1] += lz[v];
        st[v << 1 | 1] += lz[v];
        lz[v << 1] += lz[v];
        lz[v << 1 | 1] += lz[v];
        lz[v] = 0;
    }
    void updx(int v, int l, int r, int ql, int qr, double x) {
        if (l > qr || r < ql) return;
        if (l >= ql && r <= qr) {
            st[v] += x, lz[v] += x;
            return;
        }
        push(v);
        int m = l + r >> 1;
        updx(v << 1, l, m, ql, qr, x);
        updx(v << 1 | 1, m + 1, r, ql, qr, x);
        pull(v);
    }
    void updy(int v, int l, int r, int u, double y) {
        if (l == r) {
            st[v] += y;
            return;
        }
        push(v);
        int m = l + r >> 1;
        if (u <= m) updy(v << 1, l, m, u, y);
        else updy(v << 1 | 1, m + 1, r, u, y);
        pull(v);
    }
    void updx(int l, int r, double x) {
        updx(1, 0, sz - 1, l, r, x);
    }
    void updy(int u, double y) {
        updy(1, 0, sz - 1, u, y);
    }
} st1;
 
struct segtree2 {
    vector<int> st;
    int sz;
    void init(int n) {
        sz = n;
        st.resize(sz << 1);
    }
    void upd(int id, int x) {
        for (st[id += sz] = x; id >>= 1;) st[id] = 1LL * st[id << 1] * st[id << 1 | 1] % mod;
    }
    int qry(int l, int r) {
        int s = 1;
        for (l += sz, r += sz + 1; l < r; l >>= 1, r >>= 1) {
            if (l & 1) s = 1LL * s * st[l++] % mod;
            if (r & 1) s = 1LL * s * st[--r] % mod;
        }
        return s;
    }
} st2;
 
int init(int N, int X[], int Y[]) {
    n = N, x.resize(n), y.resize(n);
    for (int i = 0; i < n; i++) x[i] = X[i], y[i] = Y[i];
    vector<double> p(n);
    p[0] = log(x[0]);
    for (int i = 1; i < n; i++) p[i] = p[i - 1] + log(x[i]);
    st1.init(p);
    st2.init(n);
    for (int i = 0; i < n; i++) st2.upd(i, x[i]);
    return 1LL * st2.qry(0, st1.id[1]) * y[st1.id[1]] % mod;
}
 
int updateX(int pos, int val) {
    st1.updx(pos, n - 1, log(val) - log(x[pos]));
    st2.upd(pos, val);
    x[pos] = val;
    return 1LL * st2.qry(0, st1.id[1]) * y[st1.id[1]] % mod;
}
 
int updateY(int pos, int val) {
    st1.updy(pos, log(val) - log(y[pos]));
    y[pos] = val;
    return 1LL * st2.qry(0, st1.id[1]) * y[st1.id[1]] % mod;
}

Compilation message

horses.cpp: In member function 'void segtree1::init(std::vector<double>)':
horses.cpp:14:20: warning: conversion from 'std::vector<double>::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   14 |         sz = a.size();
      |              ~~~~~~^~
horses.cpp:15:24: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   15 |         while (sz & sz - 1) ++sz;
      |                     ~~~^~~
horses.cpp:18:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<double>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |         for (int i = 0; i < a.size(); i++) st[i + sz] = a[i] + log(y[i]);
      |                         ~~^~~~~~~~~~
horses.cpp: In member function 'void segtree1::updx(int, int, int, int, int, double)':
horses.cpp:35:59: warning: declaration of 'x' shadows a global declaration [-Wshadow]
   35 |     void updx(int v, int l, int r, int ql, int qr, double x) {
      |                                                    ~~~~~~~^
horses.cpp:6:13: note: shadowed declaration is here
    6 | vector<int> x, y;
      |             ^
horses.cpp:42:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   42 |         int m = l + r >> 1;
      |                 ~~^~~
horses.cpp: In member function 'void segtree1::updy(int, int, int, int, double)':
horses.cpp:47:50: warning: declaration of 'y' shadows a global declaration [-Wshadow]
   47 |     void updy(int v, int l, int r, int u, double y) {
      |                                           ~~~~~~~^
horses.cpp:6:16: note: shadowed declaration is here
    6 | vector<int> x, y;
      |                ^
horses.cpp:53:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   53 |         int m = l + r >> 1;
      |                 ~~^~~
horses.cpp: In member function 'void segtree1::updx(int, int, double)':
horses.cpp:58:36: warning: declaration of 'x' shadows a global declaration [-Wshadow]
   58 |     void updx(int l, int r, double x) {
      |                             ~~~~~~~^
horses.cpp:6:13: note: shadowed declaration is here
    6 | vector<int> x, y;
      |             ^
horses.cpp: In member function 'void segtree1::updy(int, double)':
horses.cpp:61:29: warning: declaration of 'y' shadows a global declaration [-Wshadow]
   61 |     void updy(int u, double y) {
      |                      ~~~~~~~^
horses.cpp:6:16: note: shadowed declaration is here
    6 | vector<int> x, y;
      |                ^
horses.cpp: In member function 'void segtree2::init(int)':
horses.cpp:69:19: warning: declaration of 'n' shadows a global declaration [-Wshadow]
   69 |     void init(int n) {
      |               ~~~~^
horses.cpp:7:5: note: shadowed declaration is here
    7 | int n;
      |     ^
horses.cpp: In member function 'void segtree2::upd(int, int)':
horses.cpp:73:26: warning: declaration of 'x' shadows a global declaration [-Wshadow]
   73 |     void upd(int id, int x) {
      |                      ~~~~^
horses.cpp:6:13: note: shadowed declaration is here
    6 | vector<int> x, y;
      |             ^
horses.cpp:74:88: warning: conversion from 'long long int' to '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} may change value [-Wconversion]
   74 |         for (st[id += sz] = x; id >>= 1;) st[id] = 1LL * st[id << 1] * st[id << 1 | 1] % mod;
      |                                                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
horses.cpp: In member function 'int segtree2::qry(int, int)':
horses.cpp:79:46: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   79 |             if (l & 1) s = 1LL * s * st[l++] % mod;
      |                            ~~~~~~~~~~~~~~~~~~^~~~~
horses.cpp:80:46: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   80 |             if (r & 1) s = 1LL * s * st[--r] % mod;
      |                            ~~~~~~~~~~~~~~~~~~^~~~~
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:95:55: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   95 |     return 1LL * st2.qry(0, st1.id[1]) * y[st1.id[1]] % mod;
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:102:55: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  102 |     return 1LL * st2.qry(0, st1.id[1]) * y[st1.id[1]] % mod;
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:108:55: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  108 |     return 1LL * st2.qry(0, st1.id[1]) * y[st1.id[1]] % mod;
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~

Subtask #1
17.0 / 17.0

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

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 304 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 304 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 308 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 304 KB Output is correct
23 Correct 1 ms 316 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 324 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 316 KB Output is correct
28 Correct 1 ms 312 KB Output is correct
29 Correct 1 ms 312 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 316 KB Output is correct
32 Correct 1 ms 340 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 149 ms 36912 KB Output is correct
2 Correct 224 ms 36732 KB Output is correct
3 Correct 210 ms 36904 KB Output is correct
4 Correct 257 ms 36876 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 304 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 1 ms 316 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 2 ms 312 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 1 ms 308 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 119 ms 36824 KB Output is correct
34 Correct 117 ms 36852 KB Output is correct
35 Correct 134 ms 36760 KB Output is correct
36 Correct 142 ms 36716 KB Output is correct
37 Correct 102 ms 36824 KB Output is correct
38 Correct 108 ms 36840 KB Output is correct
39 Correct 103 ms 36836 KB Output is correct
40 Correct 115 ms 36884 KB Output is correct
41 Correct 112 ms 36884 KB Output is correct
42 Correct 113 ms 36876 KB Output is correct
43 Incorrect 109 ms 36880 KB Output isn't correct
44 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 308 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 308 KB Output is correct
20 Correct 1 ms 304 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 2 ms 336 KB Output is correct
27 Correct 1 ms 292 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 3 ms 340 KB Output is correct
33 Correct 172 ms 36888 KB Output is correct
34 Correct 262 ms 36636 KB Output is correct
35 Correct 247 ms 36700 KB Output is correct
36 Correct 270 ms 36740 KB Output is correct
37 Correct 122 ms 36500 KB Output is correct
38 Correct 116 ms 36440 KB Output is correct
39 Correct 150 ms 36492 KB Output is correct
40 Correct 134 ms 36424 KB Output is correct
41 Correct 104 ms 36464 KB Output is correct
42 Correct 109 ms 36496 KB Output is correct
43 Correct 99 ms 36472 KB Output is correct
44 Correct 111 ms 36552 KB Output is correct
45 Correct 95 ms 36436 KB Output is correct
46 Correct 115 ms 36488 KB Output is correct
47 Incorrect 104 ms 36488 KB Output isn't correct
48 Halted 0 ms 0 KB -