제출 #1245589

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1245589		santi3223	말 (IOI15_horses)	C++20	17 / 100	1593 ms	8280 KiB

horses

#include <bits/stdc++.h>
#include "horses.h"
using namespace std;
#define ll long long
#define vb vector<bool>
#define pb push_back
#define ff(aa, bb, cc) for(int aa = bb; aa < cc; aa++)
#define vl vector<ll>
#define pll pair<ll, ll>
#define fi first
#define se second
#define ed "\n"
#define all(aaa) aaa.begin(), aaa.end()
#define rall(aaa) aaa.rbegin(), aaa.rend()
ll MOD = 1e9+7;

vector<int> X, Y;
int n;

int init(int N, int x[], int y[]){
	n = N;
	X = vector<int>(n);
	Y = vector<int>(n);
	ff(i, 0, n){
		X[i] = x[i];
		Y[i] = y[i];
	}
	ll prev = 1, maxx = 0;
	ff(i, 0, n){
		//cout << i << "  | " << prev << " " << maxx << ed;
		prev *= X[i];
		maxx = max(maxx, prev*Y[i]);
		maxx %= MOD;
		prev %= MOD;
	}
	return maxx;
}

int updateX(int pos, int val) {	
	X[pos] = val;
	ll prev = 1, maxx = 0;
	//cout << X.size() << " " << Y.size() << ed;
	ff(i, 0, n){
		//cout << prev << " " << maxx << ed;
		prev *= X[i];
		ll a = prev*Y[i];
		maxx = max(maxx, a);
	}
	return maxx%MOD;
}

int updateY(int pos, int val){
	Y[pos] = val;
	ll prev = 1, maxx = 0;
	ff(i, 0, n){
		prev *= X[i];
		ll a = prev*Y[i];
		maxx = max(maxx, a);
	}
	return maxx%MOD;
}

/*
int main() {
	int N;
	cin >> N;
	int XX[N], YY[N];
	ff(i, 0, N){
		cin >> XX[i];
	}
	ff(i, 0, N){
		cin >> YY[i];
	}
	//cout << "IN " << N << ed;
	cout << init(N, XX, YY) << ed;
	int M;
	cin >> M;
	ff(i, 0, M){
		int a, b, c;
		cin >> a >> b >> c;
		if(a == 1){
			cout << updateX(b, c) << ed;
		}
		else if(a == 2){
			cout << updateY(b, c) << ed;
		}
	}

	return 0;
}

*/

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