제출 #428220

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
428220		haxorman	말 (IOI15_horses)	C++14	0 / 100	1560 ms	106884 KiB

horses

#include "horses.h"
#include "bits/stdc++.h"
using namespace std;
 
const int mxN = 5e5 + 7;
const int MOD = 1e9 + 7;
 
int n;
long long x[mxN], y[mxN];
map<pair<int,int>,long long> dp;
 
int rec(int i, long long horses) {
	horses *= x[i];
	if (i == n - 1) {
		return (y[i] * horses) % MOD;
	}

	if (dp.count({i, horses})) {
		return dp[{i, horses}];
	}
 
	long long keep = rec(i + 1, horses);
	long long sell = 0;
	for (int j = 1; j <= horses; ++j) {
		sell = max(sell, rec(i + 1, j) + y[i] * (horses - j));
	}
 	
 	dp[{i, horses}] = max(keep, sell) % MOD;
	return max(keep, sell) % 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 rec(0, 1);
}
 
int updateX(int pos, int val) {
	dp.clear();
	x[pos] = val;
	return rec(0, 1);
}
 
int updateY(int pos, int val) {
	dp.clear();
	y[pos] = val;
	return rec(0, 1);
}

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

horses.cpp: In function 'int rec(int, long long int)':
horses.cpp:15:26: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   15 |   return (y[i] * horses) % MOD;
      |          ~~~~~~~~~~~~~~~~^~~~~
horses.cpp:19:24: warning: conversion from 'std::map<std::pair<int, int>, long long int>::mapped_type' {aka 'long long int'} to 'int' may change value [-Wconversion]
   19 |   return dp[{i, horses}];
      |                        ^
horses.cpp:29:25: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   29 |  return max(keep, sell) % MOD;
      |         ~~~~~~~~~~~~~~~~^~~~~

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