Submission #1039458

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1039458	2024-07-30T22:51:49 Z	HappyCapybara	Horses (IOI15_horses)	C++17	17 / 100	1500 ms	8028 KB

horses

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

#define ll long long

int n;
vector<int> x, y;

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

	ll cur = 1, bsf = 0;
	for (int i=0; i<N; i++){
		cur *= x[i];
      bsf = max(bsf, cur*y[i]);
	}
	return bsf;
}

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

	double curd = 0, bsfd = 0;
	ll cur = 1, bsf = 0;
	for (int i=0; i<n; i++){
		curd += log(x[i]);
		cur = (cur*x[i]) % 1000000007;
		if (curd+log(y[i]) > bsfd){
			bsfd = curd+log(y[i]);
			bsf = (cur*y[i]) % 1000000007;
		}
	}
	return bsf;
}

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

	double curd = 0, bsfd = 0;
	ll cur = 1, bsf = 0;
	for (int i=0; i<n; i++){
		curd += log(x[i]);
		cur = (cur*x[i]) % 1000000007;
		if (curd+log(y[i]) > bsfd){
			bsfd = curd+log(y[i]);
			bsf = (cur*y[i]) % 1000000007;
		}
	}
	return bsf;
}

Compilation message

horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:24:9: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   24 |  return bsf;
      |         ^~~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:40:9: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   40 |  return bsf;
      |         ^~~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:56:9: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   56 |  return bsf;
      |         ^~~

Subtask #1

17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	440 KB	Output is correct
16	Correct	1 ms	428 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct

Subtask #2

0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	604 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Incorrect	0 ms	440 KB	Output isn't correct
23	Halted	0 ms	0 KB	-

Subtask #3

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	1562 ms	8028 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #4

0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	352 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	344 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Incorrect	0 ms	348 KB	Output isn't correct
23	Halted	0 ms	0 KB	-

Subtask #5

0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	344 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	440 KB	Output is correct
22	Incorrect	0 ms	348 KB	Output isn't correct
23	Halted	0 ms	0 KB	-