oj.uz

Submission #795741

# Submission time Handle Problem Language Result Execution time Memory
795741 2023-07-27T14:02:22 Z Username4132 Horses (IOI15_horses) C++14
0 / 100
 14 ms 9952 KB 
#include "horses.h"
#include<iostream>
#include<cmath>
using namespace std;
using ll = long long;
using ld = long double;
#define forn(i, n) for(int i=0; i<(int)n; ++i)

const int MAXN = 1010, MOD = 1000000007;
int n, arr[MAXN], brr[MAXN];
ld pa[MAXN], pb[MAXN];

int calc(){
	ll prod=1, res=-1;
	ld mx=0, sum=0;
	forn(i, n){
		sum+=pa[i];
		prod=(prod*arr[i])%MOD;
		if(mx<sum+pb[i]){
			mx=sum+pb[i];
			res=(prod*brr[i])%MOD;
		}
	}
	return res;
}

int init(int N, int X[], int Y[]) {
	n=N;
	forn(i, n){
		arr[i]=X[i];
		brr[i]=Y[i];
		pa[i]=log2((ld)X[i]);
		pb[i]=log2((ld)Y[i]);
	}
	return calc();
}

int updateX(int pos, int val) {	
	arr[pos]=val;
	pa[pos]=log2(val);
	return calc();
}

int updateY(int pos, int val) {
	brr[pos]=val;
	pb[pos]=log2(val);
	return calc();
}

Compilation message

horses.cpp: In function 'int calc()':
horses.cpp:24:9: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   24 |  return res;
      |         ^~~

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 260 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Incorrect 1 ms 212 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 0 ms 308 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 300 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Incorrect 0 ms 212 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 14 ms 9952 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 300 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 308 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 304 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Incorrect 0 ms 212 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 1 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 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 304 KB Output is correct
12 Incorrect 0 ms 212 KB Output isn't correct
13 Halted 0 ms 0 KB -