Submission #133597

#	Time	Username	Problem	Language	Result	Execution time	Memory
133597		ckodser	Horses (IOI15_horses)	C++14	20 / 100	349 ms	40540 KiB

horses

#include "horses.h"
#include<bits/stdc++.h>

#define ll long long 
#define pb push_back
#define ld long double
#define mp make_pair
#define F first
#define S second
#define pii pair<ll,ll> 

using namespace :: std;

const ll maxn=5e5+500;
const ll inf=1e9+6;
const ll mod=1e9+7;

ll modizarb(long long a,long long b){return (a*b)%mod;}


ll y[maxn];
void bild(ll l,ll r,ll node){
    
}
void update(ll l,ll r,ll node,ll pos){
    
}
ll findMx(ll l,ll r,ll L,ll R,ll node){
    ll ans=0;
    for(ll i=l;i<r;i++){
	ans=max(ans,y[i]);
    }
    return ans;
}
set<ll> st;
ll x[maxn];
ll rx[maxn];
ll n,Z;

ll poww(ll a,ll b){
    ll ans=1;
    while(b){
	if(b&1){
	    ans=(ans*a)%mod;
	}
	b>>=1;
	a=(a*a)%mod;
    }
    return ans;
}
ll findAns(){
    auto it=st.end();
    ll last=n;
    ll ans=0;
    ll t=Z;
    while(it!=st.begin()){
	it--;
	ll v=(*it);
	ll yy=findMx(v,last,0,n,1);
	ans=max(ans,yy);
	if(ans*x[v]>inf)break;
	ans*=x[v];
	t=modizarb(t,rx[v]);
	last=v;
    }
    return modizarb(ans,t);
}
int init(int N, int X[], int Y[]){
    n=N;
    Z=1;
    for(ll i=0;i<n;i++){
	x[i]=X[i];
	Z=modizarb(Z,X[i]);
	rx[i]=poww(x[i],mod-2);
	y[i]=Y[i];
	if(x[i]!=1)st.insert(i);
    }
    bild(0,n,1);
    return findAns();
}
int updateX(int pos, int val) {	
    Z=modizarb(Z,rx[pos]);
    if(x[pos]!=1 && val==1){
	st.erase(pos);
    }
    if(x[pos]==1 && val!=1){
	st.insert(pos);
    }
    x[pos]=val;
    Z=modizarb(Z,val);
    rx[pos]=poww(x[pos],mod-2);
    return findAns();
}
int updateY(int pos, int val){
    y[pos]=val;
    update(0,n,1,pos);
    return findAns();
}

Compilation message (stderr)

horses.cpp: In function 'void bild(long long int, long long int, long long int)':
horses.cpp:22:14: warning: unused parameter 'l' [-Wunused-parameter]
 void bild(ll l,ll r,ll node){
              ^
horses.cpp:22:19: warning: unused parameter 'r' [-Wunused-parameter]
 void bild(ll l,ll r,ll node){
                   ^
horses.cpp:22:24: warning: unused parameter 'node' [-Wunused-parameter]
 void bild(ll l,ll r,ll node){
                        ^~~~
horses.cpp: In function 'void update(long long int, long long int, long long int, long long int)':
horses.cpp:25:16: warning: unused parameter 'l' [-Wunused-parameter]
 void update(ll l,ll r,ll node,ll pos){
                ^
horses.cpp:25:21: warning: unused parameter 'r' [-Wunused-parameter]
 void update(ll l,ll r,ll node,ll pos){
                     ^
horses.cpp:25:26: warning: unused parameter 'node' [-Wunused-parameter]
 void update(ll l,ll r,ll node,ll pos){
                          ^~~~
horses.cpp:25:34: warning: unused parameter 'pos' [-Wunused-parameter]
 void update(ll l,ll r,ll node,ll pos){
                                  ^~~
horses.cpp: In function 'long long int findMx(long long int, long long int, long long int, long long int, long long int)':
horses.cpp:28:24: warning: unused parameter 'L' [-Wunused-parameter]
 ll findMx(ll l,ll r,ll L,ll R,ll node){
                        ^
horses.cpp:28:29: warning: unused parameter 'R' [-Wunused-parameter]
 ll findMx(ll l,ll r,ll L,ll R,ll node){
                             ^
horses.cpp:28:34: warning: unused parameter 'node' [-Wunused-parameter]
 ll findMx(ll l,ll r,ll L,ll R,ll node){
                                  ^~~~
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:79:19: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     return findAns();
            ~~~~~~~^~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:92:19: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     return findAns();
            ~~~~~~~^~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:97:19: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     return findAns();
            ~~~~~~~^~

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