oj.uz

답안 #1051089

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1051089 2024-08-09T19:33:12 Z ArthuroWich 말 (IOI15_horses) C++17
100 / 100
 499 ms 76488 KB 
#include "horses.h"
#include<bits/stdc++.h>
#define int long long int
using namespace std;
int segp[4*500005], mod = 1e9+7;
int32_t x[500005], y[500005], segm[4*500005];
long double calcx[500005], calcy[500005];
void buildp(int n, int l, int r) {
    if (l == r) {
        segp[n] = x[l];
    } else {
        int m = (l+r)/2;
        buildp(2*n, l, m);
        buildp(2*n+1, m+1, r);
        segp[n] = segp[2*n] * segp[2*n+1];
        segp[n] %= mod;
    }
}
void buildm(int n, int l, int r) {
    if (l == r) {
        segm[n] = y[l];
    } else {
        int m = (l+r)/2;
        buildm(2*n, l, m);
        buildm(2*n+1, m+1, r);
        segm[n] = max(segm[2*n], segm[2*n+1]);
    }
}
void updatep(int n, int l, int r, int i, int v) {
    if (l == r) {
        segp[n] = v;
    } else {
        int m = (l+r)/2;
        if (l <= i && i <= m) {
            updatep(2*n, l, m, i, v);
        } else {
            updatep(2*n+1, m+1, r, i, v);
        }
        segp[n] = segp[2*n] * segp[2*n+1];
        segp[n] %= mod;
    }
}
void updatem(int n, int l, int r, int i, int v) {
    if (l == r) {
        segm[n] = v;
    } else {
        int m = (l+r)/2;
        if (l <= i && i <= m) {
            updatem(2*n, l, m, i, v);
        } else {
            updatem(2*n+1, m+1, r, i, v);
        }
        segm[n] = max(segm[2*n], segm[2*n+1]);
    }
}
int queryp(int n, int l, int r, int a, int b) {
    if (b < l || r < a) {
        return 1;
    } else if (a <= l && r <= b) {
        return segp[n];
    } else {
        int m = (l+r)/2;
        return (queryp(2*n, l, m, a, b)*queryp(2*n+1, m+1, r, a, b))%mod;
    }
}
int querym(int n, int l, int r, int a, int b) {
    if (b < l || r < a) {
        return 0;
    } else if (a <= l && r <= b) {
        return segm[n];
    } else {
        int m = (l+r)/2;
        return max(querym(2*n, l, m, a, b), querym(2*n+1, m+1, r, a, b));
    }
}
int n;
set<pair<int32_t, int32_t>> segs;
int32_t calc() {
    int ind = 0, indl = 0, indr = 0, co = 0;
    auto j = segs.end();
    while(j != segs.begin()) {
        if (co > 63) {
            break;
        }
        co++;
        j--;
    }
    long double v = 0, a = 0, b = 0;
    bool f = 0;
    for (; j != segs.end(); j++) {
        auto [l, r] = *j;
        if (l == r) {
            a += calcx[l];
            if (a+calcy[l] > v) {
                f = 0;
                v = a+calcy[l];
                ind = l;
            }
        } else {
            int mx = querym(1, 0, n-1, l, r);
            if (a+log2(mx) > v) {
                v = a+log2(mx);
                indl = l;
                indr = r;
                f = 1;
            }
        }
    
    }
    if (f) {
        return (queryp(1, 0, n-1, 0, indl)*querym(1, 0, n-1, indl, indr)) % mod;
    }
    return (queryp(1, 0, n-1, 0, ind)*y[ind]) % mod;
}
int32_t init(int32_t N, int32_t X[], int32_t Y[]) {
    n = N;
    int l = -1, r = 0;
    for (int i = 0; i < n; i++) {
        x[i] = X[i];
        calcx[i] = log2(x[i]);
        y[i] = Y[i];
        calcy[i] = log2(y[i]);
        if (x[i] == 1) {
            if (l == -1) {
                l = i;
            } 
            r = i;
        } else {
            if (l != -1) {
                segs.insert({l, r});
            }
            l = -1;
            segs.insert({i, i});
        }
    }
    if (l != -1) {
        segs.insert({l, r});
    }
    buildp(1, 0, n-1);
    buildm(1, 0, n-1);
    return calc();
}
int32_t updateX(int32_t pos, int32_t val) {	
    if (x[pos] == 1 && val != 1) {
        auto i = segs.upper_bound({pos, INT_MAX});
        i--;
        auto [l, r] = *i;
        segs.erase({l, r});
        if (l != pos) {
            segs.insert({l, pos-1});
        }
        segs.insert({pos, pos});
        if (r != pos) {
            segs.insert({pos+1, r});
        }
    } else if (x[pos] != 1 && val == 1) {
        auto i = segs.find({pos, pos});
        set<pair<int, int>> todel;
        todel.insert({pos, pos});
        int ll = pos, rr = pos;
        if (pos != 0 && x[pos-1] == 1) {
            i--;
            auto [l, r] = *i;
            ll = l;
            todel.insert({l, r});
            i++;
        }
        if (pos != n-1 && x[pos+1] == 1) {
            i++;
            auto [l, r] = *i;
            rr = r;
            todel.insert({l, r});
        }
        for (auto c : todel) {
            segs.erase(c);
        }
        segs.insert({ll, rr});
    }
    x[pos] = val;
    calcx[pos] = log2(val);
    updatep(1, 0, n-1, pos, val);
    return calc();
}
int32_t updateY(int32_t pos, int32_t val) {
    y[pos] = val;
    calcy[pos] = log2(val);
    updatem(1, 0, n-1, pos, val);
    return calc();
}

Compilation message

horses.cpp: In function 'void updatem(long long int, long long int, long long int, long long int, long long int)':
horses.cpp:45:19: warning: conversion from 'long long int' to 'int32_t' {aka 'int'} may change value [-Wconversion]
   45 |         segm[n] = v;
      |                   ^
horses.cpp: In function 'int32_t calc()':
horses.cpp:111:75: warning: conversion from 'long long int' to 'int32_t' {aka 'int'} may change value [-Wconversion]
  111 |         return (queryp(1, 0, n-1, 0, indl)*querym(1, 0, n-1, indl, indr)) % mod;
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
horses.cpp:113:47: warning: conversion from 'long long int' to 'int32_t' {aka 'int'} may change value [-Wconversion]
  113 |     return (queryp(1, 0, n-1, 0, ind)*y[ind]) % mod;
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
horses.cpp:88:31: warning: unused variable 'b' [-Wunused-variable]
   88 |     long double v = 0, a = 0, b = 0;
      |                               ^

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 10588 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 1 ms 10588 KB Output is correct
6 Correct 1 ms 10588 KB Output is correct
7 Correct 1 ms 10588 KB Output is correct
8 Correct 1 ms 10588 KB Output is correct
9 Correct 1 ms 10588 KB Output is correct
10 Correct 1 ms 10588 KB Output is correct
11 Correct 1 ms 10588 KB Output is correct
12 Correct 1 ms 10588 KB Output is correct
13 Correct 1 ms 10588 KB Output is correct
14 Correct 1 ms 10588 KB Output is correct
15 Correct 1 ms 10588 KB Output is correct
16 Correct 1 ms 10588 KB Output is correct
17 Correct 1 ms 10588 KB Output is correct
18 Correct 1 ms 10588 KB Output is correct
19 Correct 1 ms 10588 KB Output is correct
20 Correct 1 ms 10688 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 10584 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 1 ms 10844 KB Output is correct
6 Correct 1 ms 10584 KB Output is correct
7 Correct 1 ms 10588 KB Output is correct
8 Correct 1 ms 10588 KB Output is correct
9 Correct 1 ms 10688 KB Output is correct
10 Correct 1 ms 10588 KB Output is correct
11 Correct 1 ms 10588 KB Output is correct
12 Correct 1 ms 10588 KB Output is correct
13 Correct 1 ms 10588 KB Output is correct
14 Correct 1 ms 10588 KB Output is correct
15 Correct 1 ms 10588 KB Output is correct
16 Correct 1 ms 10588 KB Output is correct
17 Correct 1 ms 10588 KB Output is correct
18 Correct 1 ms 10588 KB Output is correct
19 Correct 1 ms 10584 KB Output is correct
20 Correct 1 ms 10588 KB Output is correct
21 Correct 1 ms 10588 KB Output is correct
22 Correct 1 ms 10588 KB Output is correct
23 Correct 4 ms 10584 KB Output is correct
24 Correct 2 ms 10588 KB Output is correct
25 Correct 2 ms 10588 KB Output is correct
26 Correct 2 ms 10588 KB Output is correct
27 Correct 3 ms 10588 KB Output is correct
28 Correct 2 ms 10588 KB Output is correct
29 Correct 1 ms 10588 KB Output is correct
30 Correct 2 ms 10588 KB Output is correct
31 Correct 1 ms 10588 KB Output is correct
32 Correct 2 ms 10588 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 196 ms 67664 KB Output is correct
2 Correct 224 ms 76376 KB Output is correct
3 Correct 195 ms 67588 KB Output is correct
4 Correct 235 ms 71460 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 10588 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 1 ms 10588 KB Output is correct
6 Correct 1 ms 10588 KB Output is correct
7 Correct 1 ms 10588 KB Output is correct
8 Correct 1 ms 10704 KB Output is correct
9 Correct 1 ms 10588 KB Output is correct
10 Correct 1 ms 10588 KB Output is correct
11 Correct 1 ms 10588 KB Output is correct
12 Correct 1 ms 10588 KB Output is correct
13 Correct 1 ms 10588 KB Output is correct
14 Correct 1 ms 10588 KB Output is correct
15 Correct 1 ms 10588 KB Output is correct
16 Correct 1 ms 10588 KB Output is correct
17 Correct 1 ms 10588 KB Output is correct
18 Correct 1 ms 10588 KB Output is correct
19 Correct 1 ms 10588 KB Output is correct
20 Correct 1 ms 10588 KB Output is correct
21 Correct 1 ms 10588 KB Output is correct
22 Correct 1 ms 10588 KB Output is correct
23 Correct 4 ms 10588 KB Output is correct
24 Correct 2 ms 10764 KB Output is correct
25 Correct 2 ms 10588 KB Output is correct
26 Correct 2 ms 10588 KB Output is correct
27 Correct 3 ms 10588 KB Output is correct
28 Correct 2 ms 10588 KB Output is correct
29 Correct 1 ms 10692 KB Output is correct
30 Correct 2 ms 10800 KB Output is correct
31 Correct 1 ms 10696 KB Output is correct
32 Correct 2 ms 10584 KB Output is correct
33 Correct 85 ms 43660 KB Output is correct
34 Correct 42 ms 43600 KB Output is correct
35 Correct 136 ms 73824 KB Output is correct
36 Correct 131 ms 73552 KB Output is correct
37 Correct 75 ms 41812 KB Output is correct
38 Correct 109 ms 65772 KB Output is correct
39 Correct 24 ms 41368 KB Output is correct
40 Correct 117 ms 68912 KB Output is correct
41 Correct 22 ms 41552 KB Output is correct
42 Correct 27 ms 41524 KB Output is correct
43 Correct 105 ms 69204 KB Output is correct
44 Correct 107 ms 69076 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 10588 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 1 ms 10588 KB Output is correct
6 Correct 1 ms 10588 KB Output is correct
7 Correct 1 ms 10588 KB Output is correct
8 Correct 2 ms 10584 KB Output is correct
9 Correct 1 ms 10588 KB Output is correct
10 Correct 1 ms 10588 KB Output is correct
11 Correct 1 ms 10588 KB Output is correct
12 Correct 1 ms 10588 KB Output is correct
13 Correct 1 ms 10584 KB Output is correct
14 Correct 1 ms 10588 KB Output is correct
15 Correct 1 ms 10588 KB Output is correct
16 Correct 1 ms 10588 KB Output is correct
17 Correct 1 ms 10588 KB Output is correct
18 Correct 1 ms 10588 KB Output is correct
19 Correct 1 ms 10588 KB Output is correct
20 Correct 1 ms 10692 KB Output is correct
21 Correct 1 ms 10588 KB Output is correct
22 Correct 1 ms 10588 KB Output is correct
23 Correct 3 ms 10588 KB Output is correct
24 Correct 2 ms 10588 KB Output is correct
25 Correct 4 ms 10584 KB Output is correct
26 Correct 3 ms 10588 KB Output is correct
27 Correct 4 ms 10588 KB Output is correct
28 Correct 2 ms 10588 KB Output is correct
29 Correct 1 ms 10588 KB Output is correct
30 Correct 2 ms 10588 KB Output is correct
31 Correct 2 ms 10588 KB Output is correct
32 Correct 2 ms 10588 KB Output is correct
33 Correct 204 ms 67476 KB Output is correct
34 Correct 232 ms 76488 KB Output is correct
35 Correct 193 ms 67584 KB Output is correct
36 Correct 212 ms 71304 KB Output is correct
37 Correct 74 ms 43720 KB Output is correct
38 Correct 37 ms 43600 KB Output is correct
39 Correct 129 ms 73812 KB Output is correct
40 Correct 130 ms 73788 KB Output is correct
41 Correct 60 ms 41724 KB Output is correct
42 Correct 123 ms 65924 KB Output is correct
43 Correct 24 ms 41300 KB Output is correct
44 Correct 120 ms 68688 KB Output is correct
45 Correct 26 ms 41532 KB Output is correct
46 Correct 27 ms 41564 KB Output is correct
47 Correct 117 ms 69080 KB Output is correct
48 Correct 105 ms 69196 KB Output is correct
49 Correct 499 ms 47700 KB Output is correct
50 Correct 140 ms 47376 KB Output is correct
51 Correct 255 ms 75600 KB Output is correct
52 Correct 224 ms 75160 KB Output is correct
53 Correct 431 ms 45616 KB Output is correct
54 Correct 228 ms 67664 KB Output is correct
55 Correct 93 ms 42540 KB Output is correct
56 Correct 254 ms 70496 KB Output is correct
57 Correct 89 ms 43144 KB Output is correct
58 Correct 125 ms 43604 KB Output is correct
59 Correct 105 ms 69268 KB Output is correct