Submission #571833

#	Time	Username	Problem	Language	Result	Execution time	Memory
571833		beaconmc	Horses (IOI15_horses)	C++14	17 / 100	1542 ms	36144 KiB

horses

#include <bits/stdc++.h>
#pragma GCC optimize("O3")
typedef long long ll;

#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)
#define double long double

// #include "horses.h"
using namespace std;


vector<ll> x, y, xx, yy;
ll n;

int init(int N, int X[], int Y[]) {
	n = N;
	FOR(i,0,N){
		xx.push_back(X[i]);
		yy.push_back(Y[i]);
	}
	x.push_back(X[0]);
	y.push_back(Y[0]);

	FOR(i,1,N){
		x.push_back(x[i-1] * X[i]%1000000007);
		y.push_back(Y[i]);
	}
	ll maxi = -1;
	FOR(i,0,N){
		maxi = max(maxi, x[i] * y[i]%1000000007);
	}
	return (int) maxi;
}

int updateX(int pos, int val) {	
	ll prev = xx[pos];

	xx[pos] = val;
	

	FOR(i,pos,n){
		cout << prev << " " << val << endl;
		x[i] /= prev;
		x[i] *= val;
		x[i] %= 1000000007;
	}

	ll maxi = -1;
	FOR(i,0, n){
		maxi = max(maxi, x[i] * y[i]%1000000007);
	}
	return (int)maxi;
}

int updateY(int pos, int val) {
	y[pos] = val;
	ll maxi = -1;
	FOR(i,0, n){
		cout << x[i] << " " << y[i] << endl;
		maxi = max(maxi, x[i] * y[i]%1000000007);
	}
	return (int)maxi;
}

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