제출 #203592

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
203592		mohammad	말 (IOI15_horses)	C++14	17 / 100	50 ms	15352 KiB

horses

/*
░░░░██████████████████
░░▄███████▀▀▀▀▀▀███████▄
░▐████▀▒mohammad▒▀██████▄
░███▀▒▒▒▒alaa▒▒▒▒▒▒▀█████
░▐██▒▒▒alwrawrah▒▒▒▒▒████▌
░▐█▌▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒████▌
░░█▒▄▀▀▀▀▀▄▒▒▄▀▀▀▀▀▄▒▐███▌
░░░▐░░░▄▄░░▌▐░░░▄▄░░▌▐███▌
░▄▀▌░░░▀▀░░▌▐░░░▀▀░░▌▒▀▒█▌
░▌▒▀▄░░░░▄▀▒▒▀▄░░░▄▀▒▒▄▀▒▌
░▀▄▐▒▀▀▀▀▒▒▒▒▒▒▀▀▀▒▒▒▒▒▒█
░░░▀▌▒▄██▄▄▄▄████▄▒▒▒▒█▀
░░░░▄██████████████▒▒▐▌
░░░▀███▀▀████▀█████▀▒▌
░░░░░▌▒▒▒▄▒▒▒▄▒▒▒▒▒▒▐
░░░░░▌▒▒▒▒▀▀▀▒▒▒▒▒▒▒▐
*/
 
#include<bits/stdc++.h>
#include "horses.h"
using namespace std;
 
typedef long long ll ;
const ll oo = 1e13 ;
const double PI = acos(-1) ;
const ll M = 1e9 + 7  ;
 
ll x[500010] , y[500010] , n;
ll f = 1 , mp[31] ;
 
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] , f = (x[i] * f) % M;
	ll x1 = 1 , pl = 0 , ans = 1;
	for(int i = max(0ll,n - 31) ; i < N ; ++i){
		x1 *= x[i];
		if(y[pl] < x1 * y[i])
			x1 = 1 ,pl = i ;
		if(i != max(0ll , n - 31))
			mp[i] = (mp[i - 1] * x[i]) % M;
		else mp[i] = x[i];
	}
	ans = f / (mp[N - 1] / mp[pl]);
	return (ans * y[pl]) % M;
}
 
int updateX(int pos, int val){
	x[pos] = val;
	ll x1 = 1 , pl = 0 , ans = 1;
	for(int i = max(0ll,n - 31) ; i < n ; ++i){
		x1 *= x[i];
		if(y[pl] < x1 * y[i])
			x1 = 1 ,pl = i ;
	}
	ans = f / (mp[n - 1] / mp[pl]);
	return (ans * y[pl]) % M;
}
 
int updateY(int pos, int val){
	y[pos] = val;
	ll x1 = 1 , pl = 0 , ans = 1;
	for(int i = max(0ll,n - 31) ; i < n; ++i){
		x1 *= x[i];
		if(y[pl] < x1 * y[i])
			x1 = 1 ,pl = i ;
	}
	ans = f / (mp[n - 1] / mp[pl]);
	return (ans * y[pl]) % M;
}

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

horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:36:17: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
  for(int i = max(0ll,n - 31) ; i < N ; ++i){
              ~~~^~~~~~~~~~~~
horses.cpp:45:23: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
  return (ans * y[pl]) % M;
         ~~~~~~~~~~~~~~^~~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:51:17: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
  for(int i = max(0ll,n - 31) ; i < n ; ++i){
              ~~~^~~~~~~~~~~~
horses.cpp:57:23: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
  return (ans * y[pl]) % M;
         ~~~~~~~~~~~~~~^~~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:63:17: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
  for(int i = max(0ll,n - 31) ; i < n; ++i){
              ~~~^~~~~~~~~~~~
horses.cpp:69:23: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
  return (ans * y[pl]) % M;
         ~~~~~~~~~~~~~~^~~

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