제출 #1190708

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1190708		simona1230	Horses (IOI15_horses)	C++20	34 / 100	1594 ms	12168 KiB

horses

#include "horses.h"
#include<bits/stdc++.h>
using namespace std;

static FILE *_inputFile, *_outputFile;

const int mod=1e9+7;

long long n,x[500001],y[500001];

long long answer()
{
    if(n==1)return x[0]*y[0]%mod;
    long long curr=0,id=0;
    for(int i=n-1;i>=0;i--)
    {
        if(curr<y[i])
            id=i,curr=x[i]*y[i];
            else curr*=x[i];
        if(curr>1e9)break;
        ///fprintf(_outputFile,"%d ",curr);
    }
    long long ans=1;
    for(int i=0;i<=id;i++)
    {
        ans*=x[i];
        ans%=mod;
    }

    return ans*y[id]%mod;
}

int init(int N, int X[], int Y[])
{
    n=N;
    for(int i=0;i<N;i++)
        x[i]=X[i],y[i]=Y[i];
    return answer();
}



int updateX(int pos, int val)
{
    x[pos]=val;
	return answer();
}

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

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