Submission #743754

#	Time	Username	Problem	Language	Result	Execution time	Memory
743754		Abrar_Al_Samit	Horses (IOI15_horses)	C++17	34 / 100	366 ms	12292 KiB

horses

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

const int nax = 1001;
const int mod = 1e9 + 7;
const int MX = 1e9;
long long x[nax], y[nax];
int n;

int get() {
	long long cur = 1;
	for(int i=0; i<n; ++i) {
		cur *= x[i];
		cur %= mod;

		long long cnt = 1;
		bool ok = false;
		for(int j=i+1; j<n; ++j) {
			cnt *= x[j];
			if(cnt * y[j] > y[i]) {
				ok = true;
				break;
			}
			if(cnt>MX) {
				ok = true;
				break;
			}
		}
		if(!ok) {
			return (cur * y[i]) % 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 get();
}

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

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

Compilation message (stderr)

horses.cpp: In function 'int get()':
horses.cpp:31:24: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   31 |    return (cur * y[i]) % mod;
      |           ~~~~~~~~~~~~~^~~~~
horses.cpp:34:1: warning: control reaches end of non-void function [-Wreturn-type]
   34 | }
      | ^

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