oj.uz

답안 #99189

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
99189 2019-03-01T15:27:26 Z eriksuenderhauf 말 (IOI15_horses) C++11
100 / 100
 1191 ms 58736 KB 
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include "horses.h"
#define pii pair<int, int>
#define pll pair<long long, long long>
#define vii vector<pii>
#define vi vector<int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const ll INF = 1e9 + 7;
const int MAXN = 1e6 + 5;
ll pr[MAXN], x[MAXN], y[MAXN], tree[MAXN * 2], BIT[MAXN];
int n = 0;

ll qry(int ind) {
    ll ret = 1;
    ind++;
    while (ind > 0) {
        ret = (BIT[ind] * ret) % MOD;
        ind -= ind & -ind;
    }
    return ret;
}

void upd(int ind, ll val) {
    ind++;
    while (ind <= n) {
        BIT[ind] = (BIT[ind] * val) % MOD;
        ind += ind & -ind;
    }
}

ll pw(ll a, ll b) {
    ll ret = 1;
    while (b > 0) {
        if (b & 1)
            ret = (ret * a) % MOD, b--;
        else
            a = (a * a) % MOD, b /= 2ll;
    }
    return ret;
}

void build(int l, int r, int k) {
    if (l == r) {
        tree[k] = y[l];
        return;
    }
    int m = (l + r) / 2;
    build(l, m, k * 2);
    build(m + 1, r, k * 2 + 1);
    tree[k] = max(tree[k * 2], tree[k * 2 + 1]);
}

void upd(int l, int r, int k, int a, ll val) {
    if (a < l || r < a)
        return;
    if (a <= l && r <= a) {
        tree[k] = val;
        return;
    }
    int m = (l + r) / 2;
    upd(l, m, k * 2, a, val);
    upd(m + 1, r, k * 2 + 1, a, val);
    tree[k] = max(tree[k * 2], tree[k * 2 + 1]);
}

ll qry(int l, int r, int k, int a, int b) {
    if (b < l || r < a)
        return 0;
    if (a <= l && r <= b)
        return tree[k];
    int m = (l + r) / 2;
    return max(qry(l, m, k * 2, a, b), qry(m + 1, r, k * 2 + 1, a, b));
}

set<pii> rng;

ll getAns() {
    auto it = rng.begin();
    ll cur = 1, y = qry(0, n - 1, 1, it->fi, it->se);
    ll prod = qry(n - 1);
    ll ans = (prod * y) % MOD;
    int cnt = 0;
    while (cur < INF && it != rng.end() && cnt <= 60) {
        cnt++;
        ll ny = qry(0, n - 1, 1, it->fi, it->se);
        if (cur * y < ny) {
            ans = (prod * pw(qry(it->fi - 1), MOD - 2) % MOD) * ny % MOD;
            cur = 1;
            y = ny;
        }
        cur *= 1ll * (ll) x[it->fi];
        it = next(it);
    }
    return ans;
}

int updateX(int pos, int val) {
    pos = n-pos-1;
    if (val == 1 && x[pos] != 1) {
        auto it = rng.lower_bound({pos, -1});
        pii nx = {pos, pos};
        auto a = it, b = it;
        pii flA = {-1, -1}, flB = {-1, -1};
        if (it != rng.begin()) {
            a = prev(a);
            if (x[a->fi] == 1) {
                nx.fi = a->fi;
                flA = {a->fi, a->se};
            }
        }
        if (it != (--rng.end())) {
            b = next(b);
            if (x[b->se] == 1) {
                nx.se = b->se;
                flB = {b->fi, b->se};
            }
        }
        rng.erase(it);
        if (flA.fi != -1)
            rng.erase(flA);
        if (flB.fi != -1)
            rng.erase(flB);
        rng.insert(nx);
    } else if (x[pos] == 1 && val != 1) {
        auto it = rng.lower_bound({pos, -1});
        pii nx = {pos, pos};
        if (it == rng.end() || it->fi > pos)
            it = prev(it);
        pii l = {it->fi, pos - 1};
        pii r = {pos + 1, it->se};
        rng.erase(it);
        if (l.fi <= l.se)
            rng.insert(l);
        if (r.fi <= r.se)
            rng.insert(r);
        rng.insert(nx);
    }
    ll up = val;
    up = (up * pw(x[pos], MOD - 2)) % MOD;
    upd(pos, up);
    x[pos] = val;
    return (int) getAns();
}

int updateY(int pos, int val) {
    pos = n-pos-1;
    ll up = val;
    up = (up * pw(y[pos], MOD - 2)) % MOD;
    upd(0, n - 1, 1, pos, val);
    y[pos] = val;
    return (int) getAns();
}

int init(int n, int x[], int y[]) {
    ::n = n;
    fill(BIT, BIT + n + 10, 1);
    pr[n] = 1;
    for (int i = 0; i < n; i++) {
        pr[n-i-1] = (pr[n-i] * 1ll * (ll) x[n-i-1]) % MOD;
        ::y[n-i-1] = y[i];
        ::x[n-i-1] = x[i];
        upd(n-i-1, x[i]);
    }
    for (int i = 0; i < n; i++) {
        int j = i;
        for (; j < n && ::x[j] == 1; j++);
        if (j != i)
            j--;
        rng.insert({i, j});
        i = j;
    }
    build(0, n - 1, 1);
    return (int) getAns();
}

Compilation message

horses.cpp: In function 'll getAns()':
horses.cpp:86:17: warning: declaration of 'y' shadows a global declaration [-Wshadow]
     ll cur = 1, y = qry(0, n - 1, 1, it->fi, it->se);
                 ^
horses.cpp:17:23: note: shadowed declaration is here
 ll pr[MAXN], x[MAXN], y[MAXN], tree[MAXN * 2], BIT[MAXN];
                       ^
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:161:33: warning: declaration of 'y' shadows a global declaration [-Wshadow]
 int init(int n, int x[], int y[]) {
                                 ^
horses.cpp:17:23: note: shadowed declaration is here
 ll pr[MAXN], x[MAXN], y[MAXN], tree[MAXN * 2], BIT[MAXN];
                       ^
horses.cpp:161:33: warning: declaration of 'x' shadows a global declaration [-Wshadow]
 int init(int n, int x[], int y[]) {
                                 ^
horses.cpp:17:14: note: shadowed declaration is here
 ll pr[MAXN], x[MAXN], y[MAXN], tree[MAXN * 2], BIT[MAXN];
              ^
horses.cpp:161:33: warning: declaration of 'n' shadows a global declaration [-Wshadow]
 int init(int n, int x[], int y[]) {
                                 ^
horses.cpp:18:5: note: shadowed declaration is here
 int n = 0;
     ^

Subtask #1
17.0 / 17.0

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

Subtask #2
17.0 / 17.0

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

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1114 ms 56568 KB Output is correct
2 Correct 396 ms 58436 KB Output is correct
3 Correct 389 ms 56380 KB Output is correct
4 Correct 453 ms 58736 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 2 ms 428 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 3 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 3 ms 512 KB Output is correct
24 Correct 4 ms 384 KB Output is correct
25 Correct 3 ms 512 KB Output is correct
26 Correct 5 ms 512 KB Output is correct
27 Correct 8 ms 512 KB Output is correct
28 Correct 5 ms 512 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 4 ms 512 KB Output is correct
31 Correct 6 ms 512 KB Output is correct
32 Correct 7 ms 384 KB Output is correct
33 Correct 99 ms 32524 KB Output is correct
34 Correct 94 ms 32404 KB Output is correct
35 Correct 279 ms 57848 KB Output is correct
36 Correct 276 ms 57464 KB Output is correct
37 Correct 200 ms 30584 KB Output is correct
38 Correct 272 ms 54776 KB Output is correct
39 Correct 94 ms 30328 KB Output is correct
40 Correct 248 ms 57576 KB Output is correct
41 Correct 84 ms 30200 KB Output is correct
42 Correct 148 ms 30452 KB Output is correct
43 Correct 267 ms 57648 KB Output is correct
44 Correct 269 ms 57308 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 3 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 3 ms 384 KB Output is correct
24 Correct 3 ms 384 KB Output is correct
25 Correct 5 ms 512 KB Output is correct
26 Correct 5 ms 512 KB Output is correct
27 Correct 18 ms 384 KB Output is correct
28 Correct 6 ms 512 KB Output is correct
29 Correct 4 ms 384 KB Output is correct
30 Correct 4 ms 512 KB Output is correct
31 Correct 4 ms 384 KB Output is correct
32 Correct 10 ms 512 KB Output is correct
33 Correct 1191 ms 56660 KB Output is correct
34 Correct 445 ms 58412 KB Output is correct
35 Correct 380 ms 56412 KB Output is correct
36 Correct 375 ms 58668 KB Output is correct
37 Correct 79 ms 32376 KB Output is correct
38 Correct 77 ms 32380 KB Output is correct
39 Correct 312 ms 57456 KB Output is correct
40 Correct 274 ms 57464 KB Output is correct
41 Correct 186 ms 30524 KB Output is correct
42 Correct 274 ms 54776 KB Output is correct
43 Correct 76 ms 30224 KB Output is correct
44 Correct 283 ms 57592 KB Output is correct
45 Correct 92 ms 30200 KB Output is correct
46 Correct 191 ms 30328 KB Output is correct
47 Correct 248 ms 57516 KB Output is correct
48 Correct 256 ms 57412 KB Output is correct
49 Correct 367 ms 36560 KB Output is correct
50 Correct 252 ms 36460 KB Output is correct
51 Correct 537 ms 58488 KB Output is correct
52 Correct 403 ms 58504 KB Output is correct
53 Correct 1146 ms 34680 KB Output is correct
54 Correct 591 ms 56608 KB Output is correct
55 Correct 273 ms 31224 KB Output is correct
56 Correct 369 ms 58444 KB Output is correct
57 Correct 474 ms 32024 KB Output is correct
58 Correct 1133 ms 32760 KB Output is correct
59 Correct 262 ms 57336 KB Output is correct