oj.uz

Submission #793572

# Submission time Handle Problem Language Result Execution time Memory
793572 2023-07-26T03:54:09 Z Jarif_Rahman Horses (IOI15_horses) C++17
54 / 100
 1500 ms 29876 KB 
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;

const ll md = 1e9+7;
const ll L = 1e9+5;

struct segtree{
    int k = 1;
    vector<ll> P;
    segtree(int n){
        while(k < n) k<<=1;
        P.assign(2*k, 1);
    }
    void update(int i, ll x){
        i+=k;
        P[i] = x%md;
        i>>=1;
        while(i){
            P[i] = (P[i<<1]*P[(i<<1)+1])%md;
            i>>=1;
        }
    }
    ll product(int l, int r, int nd, int a, int b){
        if(a > r || b < l) return 1;
        if(a >= l && b <= r) return P[nd];
        int mid = (a+b)>>1;
        return (product(l, r, nd<<1, a, mid)*product(l, r, (nd<<1)+1, mid+1, b))%md;
    }
    ll product(int l, int r){
        return product(l, r, 1, 0, k-1);
    }
};

int n;
vector<int> X, Y;
segtree seg(0);

int query(){
    int fi = 0;
    for(ll i = n-1, p = 1; i >= 0; i--){
        p*=X[i];
        if(i == 0 || p > L){
            fi = i;
            break;
        }
    }

    ll ans = 0;
    for(ll i = fi, p = 1; i < n; i++, p*=X[i]) ans = max(ans, p*Y[i]);
    ans%=md;
    ans*=seg.product(0, fi), ans%=md;
    return ans;
}

int init(int _n, int _X[], int _Y[]){
    swap(n, _n);
    X.resize(n), Y.resize(n);
    seg = segtree(n);
    for(int i = 0; i < n; i++) X[i] = _X[i], Y[i] = _Y[i], seg.update(i, X[i]);
    return query();
}

int updateX(int i, int x){
    X[i] = x;
    seg.update(i, x);
    return query();
}

int updateY(int i, int y){
    Y[i] = y;
    return query();
}

Compilation message

horses.cpp: In function 'int query()':
horses.cpp:48:18: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   48 |             fi = i;
      |                  ^
horses.cpp:57:12: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   57 |     return ans;
      |            ^~~

Subtask #1
17.0 / 17.0

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

Subtask #2
17.0 / 17.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 17236 KB Output is correct
2 Correct 144 ms 17248 KB Output is correct
3 Correct 112 ms 21052 KB Output is correct
4 Correct 136 ms 24928 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 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 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 3 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 3 ms 340 KB Output is correct
32 Correct 2 ms 340 KB Output is correct
33 Correct 150 ms 20300 KB Output is correct
34 Correct 89 ms 20272 KB Output is correct
35 Correct 112 ms 27200 KB Output is correct
36 Correct 110 ms 27220 KB Output is correct
37 Correct 517 ms 18440 KB Output is correct
38 Correct 86 ms 19364 KB Output is correct
39 Execution timed out 1580 ms 18356 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 352 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 312 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 3 ms 304 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 3 ms 312 KB Output is correct
32 Correct 2 ms 340 KB Output is correct
33 Correct 108 ms 21068 KB Output is correct
34 Correct 144 ms 29876 KB Output is correct
35 Correct 112 ms 21000 KB Output is correct
36 Correct 135 ms 24872 KB Output is correct
37 Correct 152 ms 20272 KB Output is correct
38 Correct 89 ms 20276 KB Output is correct
39 Correct 112 ms 27340 KB Output is correct
40 Correct 113 ms 27204 KB Output is correct
41 Correct 519 ms 18452 KB Output is correct
42 Correct 86 ms 19404 KB Output is correct
43 Execution timed out 1556 ms 18308 KB Time limit exceeded
44 Halted 0 ms 0 KB -