제출 #1330389

#제출 시각아이디문제언어결과실행 시간메모리
1330389tkm_algorithms말 (IOI15_horses)C++20
17 / 100
21 ms8412 KiB
#include "horses.h"
#include <bits/stdc++.h>

using namespace std;
using ll = long long;
//#define int ll
using P = pair<int, int>;
#define all(x) x.begin(), x.end()
#define rep(i, l, n) for (int i = l; i < (n); ++i)
#define sz(x) (int)x.size()
const char nl = '\n';
const int mod = 998244353;

int n;
vector<int> x, y;
int init(int N, int X[], int Y[]) {
	n = N;
	rep(i, 0, n)
		x.push_back(X[i]),
		y.push_back(Y[i]);
		
		
		//cout <<"im here" << nl;
	//return 1;
	//ll cnt = 1, res = 0;
	int cnt = 1, res = 0;
	rep(i, 0, N) {
		cnt = cnt*x[i]%mod;
		res = max(res, cnt*y[i]);
	}
	//cout << res << nl;
	return res;
}

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

int updateY(int pos, int val) {
	y[pos] = val;
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...