제출 #827711

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
827711		Supersonic	말 (IOI15_horses)	C++14	17 / 100	1567 ms	16108 KiB

horses

#include "horses.h"
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
ll h[500001];
ll x[500001];
ll y[500001];
int n;
int init(int N, int X[], int Y[]) {
	n=N;
	h[0]=X[0];
	for(int i=0;i<n;i++){
		x[i]=X[i];
		y[i]=Y[i];
		if(i>0)h[i]=(h[i-1]*x[i])%((ll)1e9);
	}
	ll mp=0;ll c=1;
	for(int i=1;i<n;i++){
		c*=x[i];
		if(c>y[mp]||y[i]>y[mp]||c*y[i]>y[mp]){mp=i;c=1;}
	}
	return (h[mp]*y[mp])%((ll)1e9);
}

int updateX(int pos, int val) {	
	x[pos]=val;
	h[0]=x[0];
	for(int i=1;i<n;i++){
		if(i<pos)continue;
		h[i]=(h[i-1]*x[i])%((ll)1e9);
	}
	ll mp=0;ll c=1;
	for(int i=1;i<n;i++){
		c*=x[i];
		if(c>y[mp]||y[i]>y[mp]||c*y[i]>y[mp]){mp=i;c=1;}
	}
	return (h[mp]*y[mp])%((ll)1e9);
}

int updateY(int pos, int val) {
	y[pos]=val;
	ll mp=0;ll c=1;
	for(int i=1;i<n;i++){
		c*=x[i];
		if(c>y[mp]||y[i]>y[mp]||c*y[i]>y[mp]){mp=i;c=1;}
	}
	return (h[mp]*y[mp])%((ll)1e9);
}
/*
a x
b y 

xy>ab

x/a > b/y*/

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

horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:22:22: warning: conversion from 'll' {aka 'long long unsigned int'} to 'int' may change value [-Wconversion]
   22 |  return (h[mp]*y[mp])%((ll)1e9);
      |         ~~~~~~~~~~~~~^~~~~~~~~~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:37:22: warning: conversion from 'll' {aka 'long long unsigned int'} to 'int' may change value [-Wconversion]
   37 |  return (h[mp]*y[mp])%((ll)1e9);
      |         ~~~~~~~~~~~~~^~~~~~~~~~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:47:22: warning: conversion from 'll' {aka 'long long unsigned int'} to 'int' may change value [-Wconversion]
   47 |  return (h[mp]*y[mp])%((ll)1e9);
      |         ~~~~~~~~~~~~~^~~~~~~~~~

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