제출 #71580

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
71580		mr_banana	말 (IOI15_horses)	C++17	17 / 100	1581 ms	35964 KiB

horses

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

using namespace std;
const int MN=5e5+100,mod=1e9+7;
int n,x[MN],y[MN],seg[4*MN],mulx=1;
set<int,greater<int> > more;
int powm(int x1,int y1){
    if(y1==0){
        return 1;
    }
    int ans=powm(x1,y1/2);
    ans=(1ll*ans*ans)%mod;
    if(y1&1){
        ans=(1ll*ans*x1)%mod;
    }
    return ans;
}
void build(int v=1,int s=0,int e=n){
    if(e-s<2){
        seg[v]=y[s];
        return ;
    }
    int mid=(s+e)/2;
    build(2*v,s,mid);
    build(2*v+1,mid,e);
    seg[v]=max(seg[2*v],seg[2*v+1]);
}
void st(int p,int val,int v=1,int s=0,int e=n){
    if(e-s<2){
        seg[v]=val;
        return;
    }
    int mid=(s+e)/2;
    if(p<mid){
        st(p,val,2*v,s,mid);
    }
    else{
        st(p,val,2*v+1,mid,e);
    }
    seg[v]=max(seg[2*v],seg[2*v+1]);
}
int get(int l,int r,int v=1,int s=0,int e=n){
    /*if(l<=s && e<=r){
        return seg[v];
    }
    if(l>=e || s>=r){
        return 0;
    }
    int mid=(s+e)/2;
    return max(get(l,r,2*v,s,mid),get(l,r,2*v+1,mid,e));*/
    int mx=0;
    for(int i=l;i<r;i++){
        mx=max(mx,y[i]);
    }
    return mx;
}
int ans(){
    /*long long mul=1,mulm=1,ym=0;
    for(int i:more){
        int yi=get(i,n);
        if(mulm*yi>mul*ym){
            ym=yi;
            mulm=mul;
        }
        mul=mul*x[i];
        if(mul>mod){
            break;
        }
    }*/
    long long ans1=0,ym=0,mul=mulx;
    for(int i=n-1;i>=0;i--){
        ym=max(ym,1ll*y[i]);
        ans1=max(ans1,mul*ym);
        mul/=x[i];
    }
    return ans1%mod;//(1ll*((mulx*powm(mulm,mod-2))%mod)*ym)%mod;
}
int init(int N, int X[], int Y[]) {
    n=N;
    for(int i=0;i<n;i++){
        x[i]=X[i];
        mulx=(1ll*mulx*x[i])%mod;
        y[i]=Y[i];
        if(x[i]>1){
            more.insert(i);
        }
    }
    more.insert(0);
    build();
	return ans();
}

int updateX(int pos, int val) {
    if(pos>0 && x[pos]>1 && val<2){
        more.erase(pos);
    }
    if(pos>0 && x[pos]<2 && val>1){
        more.insert(pos);
    }
    mulx=(1ll*mulx*powm(x[pos],mod-2))%mod;
    x[pos]=val;
    mulx=(1ll*mulx*x[pos])%mod;
	return ans();
}

int updateY(int pos, int val) {
	y[pos]=val;
    st(pos,val);
	return ans();
}

컴파일 시 표준 에러 (stderr) 메시지

horses.cpp: In function 'int powm(int, int)':
horses.cpp:13:22: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     ans=(1ll*ans*ans)%mod;
         ~~~~~~~~~~~~~^~~~
horses.cpp:15:25: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
         ans=(1ll*ans*x1)%mod;
             ~~~~~~~~~~~~^~~~
horses.cpp: In function 'int get(int, int, int, int, int)':
horses.cpp:43:27: warning: unused parameter 'v' [-Wunused-parameter]
 int get(int l,int r,int v=1,int s=0,int e=n){
                           ^
horses.cpp:43:35: warning: unused parameter 's' [-Wunused-parameter]
 int get(int l,int r,int v=1,int s=0,int e=n){
                                   ^
horses.cpp:43:43: warning: unused parameter 'e' [-Wunused-parameter]
 int get(int l,int r,int v=1,int s=0,int e=n){
                                           ^
horses.cpp: In function 'int ans()':
horses.cpp:77:16: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     return ans1%mod;//(1ll*((mulx*powm(mulm,mod-2))%mod)*ym)%mod;
            ~~~~^~~~
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:83:29: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
         mulx=(1ll*mulx*x[i])%mod;
              ~~~~~~~~~~~~~~~^~~~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:101:39: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     mulx=(1ll*mulx*powm(x[pos],mod-2))%mod;
          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~
horses.cpp:103:27: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     mulx=(1ll*mulx*x[pos])%mod;
          ~~~~~~~~~~~~~~~~~^~~~

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