답안 #830375

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
830375	2023-08-19T04:50:19 Z	Minindu206	말 (IOI15_horses)	C++14	17 / 100	1500 ms	12072 KB

horses

#include "horses.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int n;
ll lim = (ll)1e9 + 10;
vector<int> x, y;
vector<ll> cr;
ll ans = 0;
// void rec(int ind, ll h, vector<ll> cur, ll cprof)
// {
// 	if (ind == n)
// 	{
// 		if (cprof > ans)
// 		{
// 			ans = cprof;
// 			cr.clear();
// 			cr = cur;
// 		}
// 		return;
// 	}
// 	if (h == 0)
// 	{
// 		if (cprof > ans)
// 		{
// 			ans = cprof;
// 			cr.clear();
// 			cr = cur;
// 		}
// 		return;
// 	}
// 	ll ch = h * x[ind];
// 	for (int i = 0; i <= ch; i++)
// 	{
// 		cur.push_back(i);
// 		rec(ind + 1, ch - i, cur, cprof + y[ind] * i);
// 		cur.pop_back();
// 	}
// }
ll prof()
{
	ll cur = 0, h = 1;
	for (int i = 0; i < n; i++)
	{
		h = h * x[i];
		cur = max(cur, h * y[i]);
		// cout << cur << " ";
	}
	return cur % ((ll)1e9 + 7);
}
ll prod()
{
	ll cx = 1;
	ll cbest = x[0] * y[0], loc = 0;
	for (int i = 1; i < n; i++)
	{
		cx = cx * x[i];
		if (cx * y[i] > cbest)
		{
			cbest = cx * y[i];
			cx = 1;
			loc = i;
		}
	}
	cx = 1;
	for (int i = 0; i <= loc; i++)
	{
		cx = (cx * x[i]) % ((ll)1e9 + 7);
	}
	return (cx * y[loc]) % ((ll)1e9 + 7);
}
int init(int N, int X[], int Y[])
{
	n = N;
	x.resize(n), y.resize(n);
	for (int i = 0; i < n; i++)
	{
		x[i] = X[i];
		y[i] = Y[i];
	}
	cr.resize(n);
	return prof();
}

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

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

Compilation message

horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:82:13: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   82 |  return prof();
      |         ~~~~^~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:88:13: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   88 |  return prof();
      |         ~~~~^~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:94:13: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   94 |  return prof();
      |         ~~~~^~

Subtask #1

17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct

Subtask #2

0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Incorrect	0 ms	212 KB	Output isn't correct
22	Halted	0 ms	0 KB	-

Subtask #3

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	1583 ms	12072 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #4

0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Incorrect	0 ms	212 KB	Output isn't correct
22	Halted	0 ms	0 KB	-

Subtask #5

0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Incorrect	0 ms	212 KB	Output isn't correct
22	Halted	0 ms	0 KB	-