oj.uz

Submission #1017146

# Submission time Handle Problem Language Result Execution time Memory
1017146 2024-07-08T23:38:58 Z magikarp23 Horses (IOI15_horses) C++17
100 / 100
 594 ms 59712 KB 
#include "horses.h"
 
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define pll pair <ll,ll>
#define fi first
#define se second
#define MP make_pair
#define sz(a) (ll((a).size()))
#define BIT(mask,i) (((mask) >> (i))&1)
#define MASK(i) (1LL << (i))
set <ll> bigX;
const ll MAXN = 5e5+100;
const ll MOD = 1e9 + 7;
ll n;
set <ll> s;
namespace X{
    ll tree[MAXN*4];
    ll a[MAXN];
    void build(ll id,ll l,ll r){
        if (l==r)tree[id] = a[l];
        else{
            ll mid = (l + r) >> 1;
            build(id<<1,l,mid);
            build(id<<1|1,mid+1,r);
            tree[id] = tree[id<<1] * tree[id<<1|1] % MOD;
        }
    }
    void update(ll id,ll l,ll r,ll i){
        if (l > i || r < i)return;
        if (l == r){
            tree[id] = a[l];
            return;
        }
        ll mid = (l + r) >> 1;
        update(id<<1,l,mid,i);
        update(id<<1|1,mid+1,r,i);
        tree[id] = tree[id<<1] * tree[id<<1|1] % MOD;
    }
    ll get(ll id,ll l,ll r,ll i){
        if (l > i)return 1;
        if (r <= i)return tree[id];
        ll mid = (l + r) >> 1;
        return get(id<<1,l,mid,i)*get(id<<1|1,mid+1,r,i)%MOD;
    }
    void init(int X[]){
        for (ll i = 0;i < n;i ++)a[i] = X[i];
        for (ll i = 0;i < n;i ++){
            if (a[i] > 1)s.insert(i);
        }
        build(1,0,n-1);
    }
    void update(ll pos,ll val){
        s.erase(pos);
        a[pos]=val;
        if (val > 1)s.insert(pos);
        update(1,0,n-1,pos);
    }
    ll get(ll x){
        return get(1,0,n-1,x);
    }
}
namespace Y{
    ll a[MAXN];
    ll tree[MAXN*4];
    ll better(ll x,ll y){
        if (x==-1)return y;
        if (y==-1)return x;
        if (a[x] > a[y])return x;
        return y;
    }
    void build(ll id,ll l,ll r){
        if (l==r)tree[id] = l;
        else{
            ll mid = (l + r) >> 1;
            build(id<<1,l,mid);
            build(id<<1|1,mid+1,r);
            tree[id] = better(tree[id<<1],tree[id<<1|1]);
        }
    }
    void update(ll id,ll l,ll r,ll i){
        if (l > i || r < i)return;
        if (l == r){
            return;
        }
        ll mid = (l + r) >> 1;
        update(id<<1,l,mid,i);
        update(id<<1|1,mid+1,r,i);
        tree[id] = better(tree[id<<1],tree[id<<1|1]);
    }
    ll get(ll id,ll l,ll r,ll l1,ll r1){
        if (l > r1 || l1 > r)return -1;
        if (l1 <= l && r <= r1)return tree[id];
        ll mid = (l + r) >> 1;
        return better(get(id<<1,l,mid,l1,r1),get(id<<1|1,mid+1,r,l1,r1));
    }
    void init(int Y[]){
        for (ll i = 0;i < n;i ++)a[i] = Y[i];
        build(1,0,n-1);
    }
    void update(ll pos,ll val){
        a[pos] = val;
        update(1,0,n-1,pos);
    }
    ll get(ll l,ll r){
        return get(1,0,n-1,l,r);
    }
}
ll solve(){
    ll best = 0;
    ll best_id = -1;
    ll last = n;
    s.insert(0);
    for (auto it = s.rbegin();it != s.rend();it ++){
        ll tmp = Y::get(*it,last-1);
        if (Y::a[tmp] > best){
            best = Y::a[tmp];
            best_id = tmp;
        }
        best *= X::a[*it];
        const static ll INF = 1e9;
        if (best > INF){
            break;
        }
        last = *it;
    }
//    if (X::a[0]==1)s.erase(0);
//    cout<<best_id<<'\n';
    return Y::a[best_id] * X::get(best_id) % MOD;
}
int init(int N, int X[], int Y[]) {
    n=N;
    X::init(X);
    Y::init(Y);
	return solve();
}
 
int updateX(int pos, int val) {
    X::update(pos,val);
	return solve();
}
 
int updateY(int pos, int val) {
    Y::update(pos,val);
	return solve();
}

Compilation message

horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:136:14: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
  136 |  return solve();
      |         ~~~~~^~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:141:14: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
  141 |  return solve();
      |         ~~~~~^~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:146:14: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
  146 |  return solve();
      |         ~~~~~^~

Subtask #1
17.0 / 17.0

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

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 432 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 444 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 456 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 452 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 484 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 3 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 600 KB Output is correct
31 Correct 2 ms 348 KB Output is correct
32 Correct 3 ms 344 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 542 ms 55224 KB Output is correct
2 Correct 264 ms 59712 KB Output is correct
3 Correct 279 ms 55020 KB Output is correct
4 Correct 259 ms 57024 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 2500 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 2424 KB Output is correct
26 Correct 1 ms 2652 KB Output is correct
27 Correct 3 ms 348 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 3 ms 348 KB Output is correct
32 Correct 3 ms 348 KB Output is correct
33 Correct 40 ms 31000 KB Output is correct
34 Correct 35 ms 31056 KB Output is correct
35 Correct 161 ms 57680 KB Output is correct
36 Correct 157 ms 57968 KB Output is correct
37 Correct 78 ms 29960 KB Output is correct
38 Correct 84 ms 42452 KB Output is correct
39 Correct 28 ms 29716 KB Output is correct
40 Correct 138 ms 55380 KB Output is correct
41 Correct 49 ms 29848 KB Output is correct
42 Correct 60 ms 29776 KB Output is correct
43 Correct 151 ms 55436 KB Output is correct
44 Correct 129 ms 55180 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 0 ms 448 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 600 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 448 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 2396 KB Output is correct
22 Correct 0 ms 2396 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 464 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 3 ms 344 KB Output is correct
28 Correct 1 ms 600 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 3 ms 2396 KB Output is correct
32 Correct 3 ms 2504 KB Output is correct
33 Correct 487 ms 55040 KB Output is correct
34 Correct 254 ms 59560 KB Output is correct
35 Correct 265 ms 55000 KB Output is correct
36 Correct 274 ms 57028 KB Output is correct
37 Correct 36 ms 31136 KB Output is correct
38 Correct 35 ms 31060 KB Output is correct
39 Correct 152 ms 57660 KB Output is correct
40 Correct 151 ms 57788 KB Output is correct
41 Correct 76 ms 30036 KB Output is correct
42 Correct 97 ms 42280 KB Output is correct
43 Correct 33 ms 30036 KB Output is correct
44 Correct 133 ms 55376 KB Output is correct
45 Correct 49 ms 29872 KB Output is correct
46 Correct 64 ms 29940 KB Output is correct
47 Correct 129 ms 55360 KB Output is correct
48 Correct 133 ms 55412 KB Output is correct
49 Correct 126 ms 33304 KB Output is correct
50 Correct 96 ms 33364 KB Output is correct
51 Correct 286 ms 59220 KB Output is correct
52 Correct 219 ms 58940 KB Output is correct
53 Correct 594 ms 32632 KB Output is correct
54 Correct 226 ms 45812 KB Output is correct
55 Correct 98 ms 30508 KB Output is correct
56 Correct 200 ms 56516 KB Output is correct
57 Correct 317 ms 30952 KB Output is correct
58 Correct 442 ms 31352 KB Output is correct
59 Correct 135 ms 55324 KB Output is correct