oj.uz

Submission #206188

# Submission time Handle Problem Language Result Execution time Memory
206188 2020-03-02T16:11:10 Z awlintqaa Horses (IOI15_horses) C++14
54 / 100
 1500 ms 33912 KB 
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 200
#define mid (l+r)/2
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
typedef long long ll;
typedef short int si;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const ll mod=1e9+7;
const ll inf= 4e18;
const ld pai=acos(-1);
#include "horses.h"
ll n ;
ll a[500009],cost[500009];
ll tree[2000009];
ll merge ( ll x , ll y ){
        x%=mod;
        y%=mod;
        return (x*y)%mod;
}
void build(ll node,ll l,ll r){
        if ( l == r ){
                tree[node] = a[l];
                return ;
        }
        build(node*2,l,mid);
        build(node*2+1,mid+1,r);
        tree[node] = merge ( tree[node*2] , tree[node*2+1] ) ;
}
void upd(ll node,ll l,ll r,ll id){
        if ( l==r ){
                tree[node]=a[l];
                return ;
        }
        if ( id<=mid ) upd(node*2,l,mid,id);
        else upd(node*2+1,mid+1,r,id);
        tree[node] = merge ( tree[node*2] , tree[node*2+1] ) ;
}
ll query(ll node,ll l,ll r,ll s,ll e){
        if ( l>r || s>r || e<l ) return 1;
        if ( s<=l && e>=r ) return tree[node];
        return merge( query(node*2,l,mid,s,e) , query(node*2+1,mid+1,r,s,e) );
}
ll solve(){
        ll st = 0;
        ll crnt =1 ;
        for ( int i =n-1 ;i>=0 ;i-- ){
                crnt*=a[i];
                if ( crnt > (ll)2e9 ) break;
                st = i ;
        }crnt  = 1;
        ll ans = 0;
        if ( st ) ans = cost[st-1];
        for( int i =st ;i < n;i ++ ){
                crnt *= a[i];
                ans = max ( ans, crnt * cost[i]);
        }
        ans %= mod ;
        ans *= query ( 1 , 0 , n-1 , 0 , st-1 ) ;
        ans %= mod ;
        return ans;
}
int init(int N, int X[], int Y[]) {
        n = N;
        for ( int i =0 ;i < n ;i ++ ) a[i]=X[i];
        for ( int i =0 ;i < n ;i ++ ) cost [i] = Y [i];
        build(1,0,n-1);
        return solve();
}
int updateX(int pos, int val) {
        a[pos]=val;
        upd(1,0,n-1,pos);
        return solve();
}
int updateY(int pos, int val) {
        cost[pos]=val;
        return solve();
}

Compilation message

horses.cpp: In function 'll solve()':
horses.cpp:64:23: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
         for ( int i =n-1 ;i>=0 ;i-- ){
                      ~^~
horses.cpp:71:21: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
         for( int i =st ;i < n;i ++ ){
                     ^~
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:85:21: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
         return solve();
                ~~~~~^~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:90:21: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
         return solve();
                ~~~~~^~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:94:21: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
         return solve();
                ~~~~~^~

Subtask #1
17.0 / 17.0

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

Subtask #2
17.0 / 17.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 21240 KB Output is correct
2 Correct 150 ms 22520 KB Output is correct
3 Correct 121 ms 25140 KB Output is correct
4 Correct 158 ms 28920 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 4 ms 376 KB Output is correct
3 Correct 4 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 380 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 380 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 4 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 6 ms 376 KB Output is correct
28 Correct 5 ms 376 KB Output is correct
29 Correct 8 ms 376 KB Output is correct
30 Correct 6 ms 376 KB Output is correct
31 Correct 8 ms 376 KB Output is correct
32 Correct 8 ms 376 KB Output is correct
33 Correct 125 ms 21496 KB Output is correct
34 Correct 48 ms 24312 KB Output is correct
35 Correct 79 ms 31224 KB Output is correct
36 Correct 81 ms 31224 KB Output is correct
37 Correct 613 ms 22520 KB Output is correct
38 Correct 46 ms 23416 KB Output is correct
39 Execution timed out 1539 ms 22392 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 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 4 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 380 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 4 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 4 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 6 ms 376 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 6 ms 380 KB Output is correct
28 Correct 5 ms 376 KB Output is correct
29 Correct 8 ms 376 KB Output is correct
30 Correct 6 ms 376 KB Output is correct
31 Correct 7 ms 376 KB Output is correct
32 Correct 8 ms 376 KB Output is correct
33 Correct 78 ms 23416 KB Output is correct
34 Correct 154 ms 33912 KB Output is correct
35 Correct 112 ms 25080 KB Output is correct
36 Correct 163 ms 28920 KB Output is correct
37 Correct 126 ms 24312 KB Output is correct
38 Correct 54 ms 24312 KB Output is correct
39 Correct 76 ms 31204 KB Output is correct
40 Correct 77 ms 31204 KB Output is correct
41 Correct 611 ms 22588 KB Output is correct
42 Correct 43 ms 23400 KB Output is correct
43 Execution timed out 1544 ms 22264 KB Time limit exceeded
44 Halted 0 ms 0 KB -