Submission #206137

#	Time	Username	Problem	Language	Result	Execution time	Memory
206137		awlintqaa	Horses (IOI15_horses)	C++14	17 / 100	88 ms	17020 KiB

horses

#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] , bs[500009];
bool overflow(ll x ,ll y){
        return (x > inf / y);
}
ll solve(){
        ll st=0;
        ll crnt =1 ;
        for(ll i=n-1;i>=0;i--){
                if(overflow(crnt*a[i],(ll)1e9) ){
                        st=i+1;
                        break;
                }
                crnt*=a[i];
        }
        crnt=1;
        ll mx=0;
  		ll CRNT = 0 ;
        ll id=0;
        for(ll i=st;i<n;i++){
                crnt*=a[i];
                if(crnt*cost[i] > mx ){
                        mx=crnt*cost[i];
                        id=i;
                  		CRNT = crnt;
                }
        }
  		if(st &&  CRNT * cost[id] < cost[st-1]){
          crnt = bs [st-1];
          return (crnt * cost[id]%mod ) %mod;
        }
        crnt = bs[st];
        for ( int i = st+1 ;i <= id ;i ++ ){
                crnt *= a[i];
                crnt%=mod;
        }
        return ((crnt%mod)*(cost[id]%mod))%mod;
}

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];
        ll crnt = 1;
        for ( int i =0 ;i < n ;i ++ ){
                crnt *= a[i];
                crnt%=mod;
                bs [i] = crnt;
        }
        //cout << solve() <<endl;
        return solve();
}

int updateX(int pos, int val) {
        a[pos]=val;
        return solve();
}
int updateY(int pos, int val) {
        cost[pos]=val;
        return solve();
}

Compilation message (stderr)

horses.cpp: In function 'll solve()':
horses.cpp:62:25: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
         for ( int i = st+1 ;i <= id ;i ++ ){
                       ~~^~
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:80: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:85: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:89:21: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
         return solve();
                ~~~~~^~

• Subtask 1: 17 / 17
• Subtask 2: 0 / 17
• Subtask 3: 0 / 20
• Subtask 4: 0 / 23
• Subtask 5: 0 / 23