oj.uz

Submission #1092004

# Submission time Handle Problem Language Result Execution time Memory
1092004 2024-09-22T19:54:29 Z triplem5ds Horses (IOI15_horses) C++14
100 / 100
 776 ms 48508 KB 
#include "horses.h"
#include "bits/stdc++.h"
using namespace std;


const int MOD = 1e9 + 7;
const int N = 5e5 + 5;

struct segTreeNode
{
    int mulX;
    int maxY;
    segTreeNode(int _mulX = 0, int _maxY = 0) : mulX(_mulX), maxY(_maxY) {}
    friend segTreeNode operator + (segTreeNode a, segTreeNode b) {
        return segTreeNode(
            1ll * a.mulX * b.mulX % MOD,
            max(a.maxY, b.maxY)
        );
    }
};

int x[N], y[N], n;
segTreeNode tree[N << 2];
set<int> hotPoints;

void build(int node, int s, int e) {
    if (s == e) {
        tree[node] = segTreeNode(x[s], y[s]);
        return;
    }
    int md = (s + e) >> 1;
    build(node << 1, s, md);
    build(node << 1 | 1, md + 1, e);
    tree[node] = tree[node << 1] + tree[node << 1 | 1];
}

segTreeNode query(int node, int s, int e, int l, int r) {
    if (r < s || e < l)  return segTreeNode(1, 0);
    if (l <= s && e <= r)
        return tree[node];
    int md = (s + e) >> 1;
    return query(node << 1, s, md, l, r) + query(node << 1 | 1, md + 1, e, l, r);
}

void update(int node, int s, int e, int index) {
    if (s == e) {
        tree[node] = segTreeNode(x[s], y[s]);
        return;
    }
    int md = (s + e) >> 1;
    if (index <= md)
        update(node << 1, s, md, index);
    else
        update(node << 1 | 1, md + 1, e, index);
    tree[node] = tree[node << 1] + tree[node << 1 | 1];
}

int calcAnswer() {
    hotPoints.insert(0);
    vector<array<int, 3>> vec; ///(x, y)
    int prv = n;

    ///Extract last 30 elements
    for (auto it = hotPoints.rbegin(); it != hotPoints.rend() && vec.size() < 30; it++) {
        vec.push_back({
            x[*it],
            query(1, 0, n - 1, *it, prv - 1).maxY,
            *it
            });
        prv = *it;
    }

    reverse(begin(vec), end(vec));  ///reorder to go from first to last

    ///I want to get the best Y
    int choosen = 0;
    long long cur = 1;
    for (int i = 1; i < vec.size(); i++) {
        /*
            I want to get the first j > i such that
            x[i + 1] * ... * x[j] * y[j] > y[i]
        */
        cur = cur * vec[i][0];
        if (cur > vec[choosen][1] || cur * vec[i][1] > vec[choosen][1]) { ///to avoid overflow
            choosen = i;
            cur = 1;
        }
    }

    return 1ll * query(1, 0, n - 1, 0, vec[choosen][2]).mulX * vec[choosen][1] % MOD;
}

int init(int N, int X[], int Y[]) {
    copy(X, X + N, x);
    copy(Y, Y + N, y);
    n = N;
    build(1, 0, N - 1);
    for (int i = 0; i < N; i++) {
        if (X[i] > 1) hotPoints.insert(i);
    }
    return calcAnswer();
}

int updateX(int pos, int val) {
    if (x[pos] > 1)hotPoints.erase(pos);
    x[pos] = val;
    if (x[pos] > 1)hotPoints.insert(pos);
    update(1, 0, n - 1, pos);
    return calcAnswer();
}

int updateY(int pos, int val) {
    y[pos] = val;
    update(1, 0, n - 1, pos);
    return calcAnswer();
}


// int main() {
//     int n = 3;
//     int x[] = { 2,1,3 };
//     int y[] = { 3,4,1 };
//     cout << init(n, x, y) << "\n";
//     cout << updateY(1, 2) << "\n";

// }

Compilation message

horses.cpp: In function 'segTreeNode operator+(segTreeNode, segTreeNode)':
horses.cpp:16:35: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   16 |             1ll * a.mulX * b.mulX % MOD,
      |             ~~~~~~~~~~~~~~~~~~~~~~^~~~~
horses.cpp: In function 'int calcAnswer()':
horses.cpp:78:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<int, 3> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |     for (int i = 1; i < vec.size(); i++) {
      |                     ~~^~~~~~~~~~~~
horses.cpp:90:80: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   90 |     return 1ll * query(1, 0, n - 1, 0, vec[choosen][2]).mulX * vec[choosen][1] % MOD;
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:93:14: warning: declaration of 'N' shadows a global declaration [-Wshadow]
   93 | int init(int N, int X[], int Y[]) {
      |          ~~~~^
horses.cpp:7:11: note: shadowed declaration is here
    7 | const int N = 5e5 + 5;
      |           ^

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 15960 KB Output is correct
2 Correct 7 ms 15964 KB Output is correct
3 Correct 7 ms 15964 KB Output is correct
4 Correct 8 ms 15964 KB Output is correct
5 Correct 7 ms 15964 KB Output is correct
6 Correct 8 ms 15964 KB Output is correct
7 Correct 7 ms 15964 KB Output is correct
8 Correct 7 ms 15984 KB Output is correct
9 Correct 7 ms 15964 KB Output is correct
10 Correct 7 ms 15964 KB Output is correct
11 Correct 7 ms 16092 KB Output is correct
12 Correct 7 ms 16112 KB Output is correct
13 Correct 7 ms 15964 KB Output is correct
14 Correct 6 ms 15964 KB Output is correct
15 Correct 7 ms 15888 KB Output is correct
16 Correct 7 ms 15964 KB Output is correct
17 Correct 11 ms 15964 KB Output is correct
18 Correct 7 ms 15964 KB Output is correct
19 Correct 7 ms 15964 KB Output is correct
20 Correct 7 ms 15964 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 15964 KB Output is correct
2 Correct 6 ms 16112 KB Output is correct
3 Correct 6 ms 15912 KB Output is correct
4 Correct 7 ms 15960 KB Output is correct
5 Correct 6 ms 15976 KB Output is correct
6 Correct 7 ms 15960 KB Output is correct
7 Correct 7 ms 15964 KB Output is correct
8 Correct 7 ms 15924 KB Output is correct
9 Correct 7 ms 15964 KB Output is correct
10 Correct 7 ms 15964 KB Output is correct
11 Correct 7 ms 15964 KB Output is correct
12 Correct 10 ms 15964 KB Output is correct
13 Correct 9 ms 15964 KB Output is correct
14 Correct 7 ms 15964 KB Output is correct
15 Correct 10 ms 15964 KB Output is correct
16 Correct 8 ms 15964 KB Output is correct
17 Correct 7 ms 15876 KB Output is correct
18 Correct 7 ms 15964 KB Output is correct
19 Correct 7 ms 16216 KB Output is correct
20 Correct 7 ms 16068 KB Output is correct
21 Correct 7 ms 15856 KB Output is correct
22 Correct 7 ms 15964 KB Output is correct
23 Correct 10 ms 15940 KB Output is correct
24 Correct 10 ms 15964 KB Output is correct
25 Correct 10 ms 15964 KB Output is correct
26 Correct 10 ms 15964 KB Output is correct
27 Correct 10 ms 15964 KB Output is correct
28 Correct 10 ms 15960 KB Output is correct
29 Correct 8 ms 16076 KB Output is correct
30 Correct 11 ms 16020 KB Output is correct
31 Correct 9 ms 15960 KB Output is correct
32 Correct 11 ms 16136 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 634 ms 48468 KB Output is correct
2 Correct 724 ms 48208 KB Output is correct
3 Correct 673 ms 48244 KB Output is correct
4 Correct 727 ms 48208 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 15960 KB Output is correct
2 Correct 7 ms 15964 KB Output is correct
3 Correct 8 ms 15952 KB Output is correct
4 Correct 7 ms 15964 KB Output is correct
5 Correct 6 ms 15928 KB Output is correct
6 Correct 7 ms 15964 KB Output is correct
7 Correct 7 ms 15964 KB Output is correct
8 Correct 7 ms 15964 KB Output is correct
9 Correct 7 ms 15932 KB Output is correct
10 Correct 8 ms 15964 KB Output is correct
11 Correct 7 ms 15960 KB Output is correct
12 Correct 7 ms 15860 KB Output is correct
13 Correct 7 ms 15964 KB Output is correct
14 Correct 8 ms 15960 KB Output is correct
15 Correct 7 ms 15992 KB Output is correct
16 Correct 7 ms 15964 KB Output is correct
17 Correct 7 ms 15964 KB Output is correct
18 Correct 7 ms 15964 KB Output is correct
19 Correct 7 ms 15964 KB Output is correct
20 Correct 7 ms 15992 KB Output is correct
21 Correct 7 ms 15964 KB Output is correct
22 Correct 7 ms 15964 KB Output is correct
23 Correct 10 ms 15904 KB Output is correct
24 Correct 10 ms 15964 KB Output is correct
25 Correct 10 ms 16112 KB Output is correct
26 Correct 10 ms 15964 KB Output is correct
27 Correct 11 ms 15964 KB Output is correct
28 Correct 10 ms 16080 KB Output is correct
29 Correct 8 ms 15964 KB Output is correct
30 Correct 10 ms 16184 KB Output is correct
31 Correct 9 ms 15960 KB Output is correct
32 Correct 10 ms 15964 KB Output is correct
33 Correct 99 ms 23944 KB Output is correct
34 Correct 83 ms 23900 KB Output is correct
35 Correct 222 ms 47444 KB Output is correct
36 Correct 193 ms 47440 KB Output is correct
37 Correct 95 ms 23900 KB Output is correct
38 Correct 124 ms 35780 KB Output is correct
39 Correct 31 ms 23896 KB Output is correct
40 Correct 183 ms 47444 KB Output is correct
41 Correct 57 ms 23900 KB Output is correct
42 Correct 74 ms 23940 KB Output is correct
43 Correct 144 ms 47184 KB Output is correct
44 Correct 134 ms 47188 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 16216 KB Output is correct
2 Correct 8 ms 15960 KB Output is correct
3 Correct 7 ms 15964 KB Output is correct
4 Correct 8 ms 15964 KB Output is correct
5 Correct 7 ms 15964 KB Output is correct
6 Correct 6 ms 15964 KB Output is correct
7 Correct 7 ms 15964 KB Output is correct
8 Correct 7 ms 15964 KB Output is correct
9 Correct 7 ms 15948 KB Output is correct
10 Correct 7 ms 15960 KB Output is correct
11 Correct 7 ms 15964 KB Output is correct
12 Correct 6 ms 15964 KB Output is correct
13 Correct 7 ms 15964 KB Output is correct
14 Correct 7 ms 15964 KB Output is correct
15 Correct 6 ms 15964 KB Output is correct
16 Correct 7 ms 16004 KB Output is correct
17 Correct 7 ms 15960 KB Output is correct
18 Correct 7 ms 15964 KB Output is correct
19 Correct 8 ms 15960 KB Output is correct
20 Correct 7 ms 15964 KB Output is correct
21 Correct 8 ms 15964 KB Output is correct
22 Correct 6 ms 16064 KB Output is correct
23 Correct 10 ms 15964 KB Output is correct
24 Correct 10 ms 15960 KB Output is correct
25 Correct 17 ms 15960 KB Output is correct
26 Correct 12 ms 15960 KB Output is correct
27 Correct 10 ms 16136 KB Output is correct
28 Correct 10 ms 15964 KB Output is correct
29 Correct 12 ms 15964 KB Output is correct
30 Correct 10 ms 15960 KB Output is correct
31 Correct 9 ms 15960 KB Output is correct
32 Correct 10 ms 15960 KB Output is correct
33 Correct 625 ms 48356 KB Output is correct
34 Correct 739 ms 48468 KB Output is correct
35 Correct 710 ms 48212 KB Output is correct
36 Correct 776 ms 48384 KB Output is correct
37 Correct 103 ms 23988 KB Output is correct
38 Correct 82 ms 24064 KB Output is correct
39 Correct 222 ms 47400 KB Output is correct
40 Correct 201 ms 47288 KB Output is correct
41 Correct 103 ms 24148 KB Output is correct
42 Correct 128 ms 35804 KB Output is correct
43 Correct 34 ms 23896 KB Output is correct
44 Correct 194 ms 47440 KB Output is correct
45 Correct 58 ms 23900 KB Output is correct
46 Correct 74 ms 23896 KB Output is correct
47 Correct 137 ms 47164 KB Output is correct
48 Correct 142 ms 47188 KB Output is correct
49 Correct 740 ms 26020 KB Output is correct
50 Correct 596 ms 25960 KB Output is correct
51 Correct 673 ms 48468 KB Output is correct
52 Correct 645 ms 48208 KB Output is correct
53 Correct 619 ms 25936 KB Output is correct
54 Correct 592 ms 38844 KB Output is correct
55 Correct 126 ms 23900 KB Output is correct
56 Correct 695 ms 48508 KB Output is correct
57 Correct 383 ms 24912 KB Output is correct
58 Correct 549 ms 24704 KB Output is correct
59 Correct 156 ms 47188 KB Output is correct