Submission #526333

#	Time	Username	Problem	Language	Result	Execution time	Memory
526333		Belgutei	Horses (IOI15_horses)	C++17	17 / 100	13 ms	10420 KiB

horses

#include "horses.h"
#include<bits/stdc++.h>

using namespace std;

#define ll long long
#define ff first
#define ss second
#define pb push_back
#define mk make_pair
#define MOD 1000000007

int x[1005];
int y[1005];
map<int,int> mp;
int n;

int go(){
	mp.clear();
	for(int i=0; i<n; i++){
		int tur=1;
		for(int j=i+1; j<n; j++){
			tur*=x[j];
			if(tur>y[i]){
				mp[i]++;
				break;
			}
			int tur1=tur*y[j];
			if(tur1>y[i]){
				mp[i]++;
			}
			if(tur1<y[i]){
				mp[j]++;
			}
		}
	}
	int tur=1;
	for(int i=0; i<n; i++){
		tur*=x[i];
		tur%=MOD;
		if(mp[i]==0){
			tur*=y[i];
			int ans=tur;
			return ans;
		}
	}
	return 0;
}

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 go();
}
int updateX(int pos, int val) {	
	x[pos]=val;
	return go();
}

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

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