oj.uz

Submission #1050719

# Submission time Handle Problem Language Result Execution time Memory
1050719 2024-08-09T13:17:46 Z ArthuroWich Horses (IOI15_horses) C++17
57 / 100
 1500 ms 62848 KB 
#include "horses.h"
#pragma optimize("Ofast")
#pragma target("avx2")
#include<bits/stdc++.h>
#define int long long int
using namespace std;
int x[500005], y[500005], segp[4*500005], segm[4*500005], mod = 1e9+7;
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<int, int>> segs;
int32_t calc() {
    int ind = 0, indl = 0, indr = 0, co = 0;
    auto j = segs.end();
    while(j != segs.begin()) {
        if (co > 1200) {
            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 += log2(x[l]);
            if (a+log2(y[l]) > v) {
                f = 0;
                v = a+log2(y[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];
        y[i] = 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, pos});
        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.lower_bound({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;
    updatep(1, 0, n-1, pos, val);
    return calc();
}
int32_t updateY(int32_t pos, int32_t val) {
    y[pos] = val;
    updatem(1, 0, n-1, pos, val);
    return calc();
}

Compilation message

horses.cpp:2: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    2 | #pragma optimize("Ofast")
      | 
horses.cpp:3: warning: ignoring '#pragma target ' [-Wunknown-pragmas]
    3 | #pragma target("avx2")
      | 
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

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

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 1 ms 8540 KB Output is correct
8 Correct 1 ms 8540 KB Output is correct
9 Correct 1 ms 8540 KB Output is correct
10 Correct 1 ms 8536 KB Output is correct
11 Correct 1 ms 8540 KB Output is correct
12 Correct 1 ms 8540 KB Output is correct
13 Correct 1 ms 8540 KB Output is correct
14 Correct 1 ms 8540 KB Output is correct
15 Correct 1 ms 8540 KB Output is correct
16 Correct 1 ms 8540 KB Output is correct
17 Correct 1 ms 8540 KB Output is correct
18 Correct 1 ms 8540 KB Output is correct
19 Correct 1 ms 8540 KB Output is correct
20 Correct 1 ms 8540 KB Output is correct
21 Correct 1 ms 8540 KB Output is correct
22 Correct 1 ms 8540 KB Output is correct
23 Correct 12 ms 8672 KB Output is correct
24 Correct 15 ms 8792 KB Output is correct
25 Correct 33 ms 8716 KB Output is correct
26 Correct 33 ms 8536 KB Output is correct
27 Correct 7 ms 8540 KB Output is correct
28 Correct 29 ms 8716 KB Output is correct
29 Correct 3 ms 8540 KB Output is correct
30 Correct 14 ms 8724 KB Output is correct
31 Correct 2 ms 8540 KB Output is correct
32 Correct 2 ms 8540 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1592 ms 62548 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 1 ms 8616 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 1 ms 8540 KB Output is correct
8 Correct 1 ms 8540 KB Output is correct
9 Correct 1 ms 8540 KB Output is correct
10 Correct 1 ms 8540 KB Output is correct
11 Correct 1 ms 8540 KB Output is correct
12 Correct 1 ms 8540 KB Output is correct
13 Correct 1 ms 8540 KB Output is correct
14 Correct 1 ms 8540 KB Output is correct
15 Correct 1 ms 8540 KB Output is correct
16 Correct 1 ms 8540 KB Output is correct
17 Correct 1 ms 8540 KB Output is correct
18 Correct 1 ms 8552 KB Output is correct
19 Correct 1 ms 8540 KB Output is correct
20 Correct 1 ms 8540 KB Output is correct
21 Correct 1 ms 8540 KB Output is correct
22 Correct 1 ms 8540 KB Output is correct
23 Correct 16 ms 8540 KB Output is correct
24 Correct 12 ms 8684 KB Output is correct
25 Correct 32 ms 8724 KB Output is correct
26 Correct 33 ms 8540 KB Output is correct
27 Correct 7 ms 8540 KB Output is correct
28 Correct 28 ms 8720 KB Output is correct
29 Correct 2 ms 8536 KB Output is correct
30 Correct 14 ms 8540 KB Output is correct
31 Correct 1 ms 8540 KB Output is correct
32 Correct 2 ms 8540 KB Output is correct
33 Correct 1247 ms 31572 KB Output is correct
34 Correct 1152 ms 31332 KB Output is correct
35 Correct 507 ms 62248 KB Output is correct
36 Correct 509 ms 62172 KB Output is correct
37 Correct 1040 ms 31316 KB Output is correct
38 Correct 460 ms 62240 KB Output is correct
39 Correct 230 ms 30812 KB Output is correct
40 Correct 480 ms 62288 KB Output is correct
41 Correct 21 ms 31068 KB Output is correct
42 Correct 27 ms 31064 KB Output is correct
43 Correct 137 ms 62140 KB Output is correct
44 Correct 142 ms 62236 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8536 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 1 ms 8540 KB Output is correct
8 Correct 1 ms 8540 KB Output is correct
9 Correct 1 ms 8540 KB Output is correct
10 Correct 1 ms 8540 KB Output is correct
11 Correct 1 ms 8540 KB Output is correct
12 Correct 1 ms 8540 KB Output is correct
13 Correct 1 ms 8616 KB Output is correct
14 Correct 1 ms 8540 KB Output is correct
15 Correct 1 ms 8540 KB Output is correct
16 Correct 1 ms 8540 KB Output is correct
17 Correct 1 ms 8540 KB Output is correct
18 Correct 1 ms 8540 KB Output is correct
19 Correct 1 ms 8540 KB Output is correct
20 Correct 1 ms 8540 KB Output is correct
21 Correct 1 ms 8576 KB Output is correct
22 Correct 1 ms 8540 KB Output is correct
23 Correct 17 ms 8672 KB Output is correct
24 Correct 12 ms 8540 KB Output is correct
25 Correct 33 ms 8540 KB Output is correct
26 Correct 33 ms 8536 KB Output is correct
27 Correct 7 ms 8540 KB Output is correct
28 Correct 28 ms 8728 KB Output is correct
29 Correct 2 ms 8540 KB Output is correct
30 Correct 13 ms 8716 KB Output is correct
31 Correct 1 ms 8540 KB Output is correct
32 Correct 2 ms 8540 KB Output is correct
33 Execution timed out 1598 ms 62848 KB Time limit exceeded
34 Halted 0 ms 0 KB -