oj.uz

Submission #760371

# Submission time Handle Problem Language Result Execution time Memory
760371 2023-06-17T14:05:33 Z GrindMachine Horses (IOI15_horses) C++17
54 / 100
 1500 ms 33356 KB 
// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 5e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "horses.h"

template<typename T>
struct segtree {
    // https://codeforces.com/blog/entry/18051

    /*=======================================================*/

    struct data {
    	ll a;
    };

    data neutral = {1};

    data merge(data &left, data &right) {
    	data curr;
    	curr.a = left.a * right.a % MOD;
    	return curr;
    }

    void create(int i, T v) {
    	tr[i].a = v;
    }

    void modify(int i, T v) {
    	tr[i].a = v;
    }

    /*=======================================================*/

    int n;
    vector<data> tr;

    segtree() {

    }

    segtree(int siz) {
        init(siz);
    }

    void init(int siz) {
        n = siz;
        tr.assign(2 * n, neutral);
    }

    void build(vector<T> &a, int siz) {
        rep(i, siz) create(i + n, a[i]);
        rev(i, n - 1, 1) tr[i] = merge(tr[i << 1], tr[i << 1 | 1]);
    }

    void pupd(int i, T v) {
        modify(i + n, v);
        for (i = (i + n) >> 1; i; i >>= 1) tr[i] = merge(tr[i << 1], tr[i << 1 | 1]);
    }

    data query(int l, int r) {
        data resl = neutral, resr = neutral;

        for (l += n, r += n; l <= r; l >>= 1, r >>= 1) {
            if (l & 1) resl = merge(resl, tr[l++]);
            if (!(r & 1)) resr = merge(tr[r--], resr);
        }

        return merge(resl, resr);
    }
};

ll n;
vector<ll> a(N), b(N);
segtree<ll> st(N);

int get_ans(){
	// {
	// 	ll ans = 0;
	// 	ll curr = 1;
	// 	rep(i,n){
	// 		curr *= a[i];
	// 		amax(ans, curr * b[i]);
	// 	}

	// 	return ans;
	// }

	ll prod = 1;
	ll point = -1;

	rev(i,n-1,0){
		prod *= a[i];
		point = i;
		if(prod > inf1){
			break;
		}
	}

	ll befprod = st.query(0,point-1).a;
	__int128 curr = 1;
	__int128 best = 0;

	for(int i = point; i < n; ++i){
		curr *= a[i];
		amax(best, curr * b[i]);
	}

	ll ans = (best % MOD) * befprod % MOD;
	return ans;
}

int init(int n_, int X[], int Y[]) {
	n = n_;
	rep(i,n) a[i] = X[i], b[i] = Y[i];

	rep(i,n){
		st.pupd(i,a[i]);
	}

	return get_ans();
}

int updateX(int pos, int val) {
	st.pupd(pos,val);
	a[pos] = val;
	return get_ans();	
}

int updateY(int pos, int val) {
	b[pos] = val;
	return get_ans();
}

Compilation message

horses.cpp: In function 'int get_ans()':
horses.cpp:149:9: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
  149 |  rev(i,n-1,0){
      |        ~^~
horses.cpp:32:34: note: in definition of macro 'rev'
   32 | #define rev(i, s, e) for(int i = s; i >= e; --i)
      |                                  ^
horses.cpp:157:31: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
  157 |  ll befprod = st.query(0,point-1).a;
      |                          ~~~~~^~
horses.cpp:161:14: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
  161 |  for(int i = point; i < n; ++i){
      |              ^~~~~
horses.cpp:166:34: warning: conversion from '__int128' to 'll' {aka 'long long int'} may change value [-Wconversion]
  166 |  ll ans = (best % MOD) * befprod % MOD;
      |           ~~~~~~~~~~~~~~~~~~~~~~~^~~~~
horses.cpp:167:9: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
  167 |  return ans;
      |         ^~~

Subtask #1
17.0 / 17.0

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

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 15956 KB Output is correct
2 Correct 5 ms 15956 KB Output is correct
3 Correct 6 ms 15956 KB Output is correct
4 Correct 6 ms 15940 KB Output is correct
5 Correct 6 ms 15956 KB Output is correct
6 Correct 6 ms 15956 KB Output is correct
7 Correct 6 ms 15956 KB Output is correct
8 Correct 6 ms 15956 KB Output is correct
9 Correct 6 ms 15956 KB Output is correct
10 Correct 6 ms 15924 KB Output is correct
11 Correct 6 ms 15956 KB Output is correct
12 Correct 6 ms 15900 KB Output is correct
13 Correct 6 ms 15956 KB Output is correct
14 Correct 6 ms 15956 KB Output is correct
15 Correct 6 ms 15896 KB Output is correct
16 Correct 6 ms 15956 KB Output is correct
17 Correct 6 ms 15956 KB Output is correct
18 Correct 6 ms 15956 KB Output is correct
19 Correct 6 ms 15956 KB Output is correct
20 Correct 8 ms 15956 KB Output is correct
21 Correct 6 ms 15956 KB Output is correct
22 Correct 7 ms 15940 KB Output is correct
23 Correct 7 ms 15956 KB Output is correct
24 Correct 7 ms 15956 KB Output is correct
25 Correct 7 ms 15956 KB Output is correct
26 Correct 6 ms 15944 KB Output is correct
27 Correct 7 ms 15956 KB Output is correct
28 Correct 6 ms 15980 KB Output is correct
29 Correct 10 ms 15980 KB Output is correct
30 Correct 7 ms 15956 KB Output is correct
31 Correct 10 ms 15984 KB Output is correct
32 Correct 8 ms 15956 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 20764 KB Output is correct
2 Correct 122 ms 20828 KB Output is correct
3 Correct 96 ms 20780 KB Output is correct
4 Correct 112 ms 28420 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 15956 KB Output is correct
2 Correct 6 ms 16000 KB Output is correct
3 Correct 5 ms 15956 KB Output is correct
4 Correct 6 ms 15956 KB Output is correct
5 Correct 6 ms 15956 KB Output is correct
6 Correct 7 ms 15956 KB Output is correct
7 Correct 6 ms 15956 KB Output is correct
8 Correct 6 ms 15908 KB Output is correct
9 Correct 6 ms 15956 KB Output is correct
10 Correct 6 ms 15956 KB Output is correct
11 Correct 6 ms 15956 KB Output is correct
12 Correct 6 ms 15956 KB Output is correct
13 Correct 6 ms 15956 KB Output is correct
14 Correct 6 ms 15860 KB Output is correct
15 Correct 6 ms 15956 KB Output is correct
16 Correct 6 ms 15956 KB Output is correct
17 Correct 6 ms 15956 KB Output is correct
18 Correct 6 ms 15956 KB Output is correct
19 Correct 6 ms 15900 KB Output is correct
20 Correct 6 ms 15956 KB Output is correct
21 Correct 7 ms 15956 KB Output is correct
22 Correct 6 ms 15956 KB Output is correct
23 Correct 7 ms 15988 KB Output is correct
24 Correct 9 ms 15956 KB Output is correct
25 Correct 6 ms 15988 KB Output is correct
26 Correct 6 ms 16084 KB Output is correct
27 Correct 7 ms 15952 KB Output is correct
28 Correct 6 ms 15956 KB Output is correct
29 Correct 9 ms 15956 KB Output is correct
30 Correct 7 ms 15928 KB Output is correct
31 Correct 10 ms 15956 KB Output is correct
32 Correct 8 ms 15956 KB Output is correct
33 Correct 171 ms 23840 KB Output is correct
34 Correct 75 ms 23808 KB Output is correct
35 Correct 97 ms 30844 KB Output is correct
36 Correct 95 ms 30652 KB Output is correct
37 Correct 790 ms 22056 KB Output is correct
38 Correct 68 ms 22888 KB Output is correct
39 Execution timed out 1576 ms 21932 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 15956 KB Output is correct
2 Correct 6 ms 15956 KB Output is correct
3 Correct 6 ms 15868 KB Output is correct
4 Correct 5 ms 15956 KB Output is correct
5 Correct 6 ms 15968 KB Output is correct
6 Correct 6 ms 15900 KB Output is correct
7 Correct 6 ms 15956 KB Output is correct
8 Correct 7 ms 15956 KB Output is correct
9 Correct 6 ms 15956 KB Output is correct
10 Correct 6 ms 15956 KB Output is correct
11 Correct 6 ms 15956 KB Output is correct
12 Correct 6 ms 15956 KB Output is correct
13 Correct 6 ms 15956 KB Output is correct
14 Correct 7 ms 15956 KB Output is correct
15 Correct 5 ms 15932 KB Output is correct
16 Correct 7 ms 15856 KB Output is correct
17 Correct 6 ms 15956 KB Output is correct
18 Correct 6 ms 15956 KB Output is correct
19 Correct 7 ms 15956 KB Output is correct
20 Correct 6 ms 15956 KB Output is correct
21 Correct 6 ms 15956 KB Output is correct
22 Correct 6 ms 15956 KB Output is correct
23 Correct 6 ms 15924 KB Output is correct
24 Correct 6 ms 15956 KB Output is correct
25 Correct 6 ms 15956 KB Output is correct
26 Correct 6 ms 15960 KB Output is correct
27 Correct 7 ms 15988 KB Output is correct
28 Correct 6 ms 15956 KB Output is correct
29 Correct 10 ms 15936 KB Output is correct
30 Correct 7 ms 15908 KB Output is correct
31 Correct 9 ms 15984 KB Output is correct
32 Correct 8 ms 15984 KB Output is correct
33 Correct 91 ms 24652 KB Output is correct
34 Correct 125 ms 33356 KB Output is correct
35 Correct 93 ms 24576 KB Output is correct
36 Correct 120 ms 28400 KB Output is correct
37 Correct 175 ms 23812 KB Output is correct
38 Correct 71 ms 23884 KB Output is correct
39 Correct 98 ms 30796 KB Output is correct
40 Correct 94 ms 30688 KB Output is correct
41 Correct 786 ms 22176 KB Output is correct
42 Correct 68 ms 22892 KB Output is correct
43 Execution timed out 1581 ms 21872 KB Time limit exceeded
44 Halted 0 ms 0 KB -