Submission #138210

#	Time	Username	Problem	Language	Result	Execution time	Memory
138210		Sorting	말 (IOI15_horses)	C++14	17 / 100	1575 ms	4216 KiB

horses

#include <bits/stdc++.h>

using namespace std;

const long long mod = 1e9 + 7;
const int N = 5e5 + 7;
const int T = 1e9;

int n, *x, *y;
int first;

long long init(int _n, int _x[], int _y[]){
	n = _n;
	x = _x;
	y = _y;

	long long curr = 1, ans = 0;

	for(int i = n - 1; i >= 0; i--){
		curr *= (long long) x[i];

		if(curr > T){
			break;
		}
		first = i;
	}

	curr = 1;

	for(int i = first; i < n; i++){
		curr *= x[i];

		ans = max(ans, (long long)curr * (long long)y[i]);
	}
	ans %= mod;

	for(int i = 0; i < first; i++){
		ans *= x[i];
		ans %= mod;
	}

	return ans;
}

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

	return init(n, x, y);
}

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

	return init(n, x, y);
}

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