# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
834284 |
2023-08-22T12:37:24 Z |
Ellinor |
Horses (IOI15_horses) |
C++14 |
|
0 ms |
0 KB |
//#include<bits/stdc++.h>
#include <iostream>
#include <vector>
#include <queue>
#include <string>
#include <cmath>
#include <cstdlib>
#include <set>
#include <iomanip>
#include <limits>
#include <map>
#include <assert.h>
#include <algorithm>
#include <list>
#include <iterator>
#include <fstream>
#include <random>
#include <unordered_map>
#include <array>
using namespace std;
#define rep(i,a,b) for (int i = (a); i < b; i++)
#define pb push_back
#define all(x) x.begin(), x.end()
typedef long long ll;
typedef pair<int, int> pii;
ll MOD = 1e9 + 7; // !?
// fast
#include <Math/BigInt.h>
//
#include "horses.h" // !
int n;
vector<ll> x, y;
int go()
{
ll ch = 1, tmp = 1e9;
int sind = -1;
for (int i = n - 1; i >= 0; i--)
{
ch *= x[i];
if (ch > tmp) {
sind = i; // :/
break;
}
}
TBigInt<128, true> ans, tmp1;
ll horses = 1;
rep(i,sind,n) { // start on sind -1"
horses *= x[i];
tmp1 = horses * y[i];
ans = max(ans, tmp1);
}
// sind -> 1
// sind -> ?
tmp = 1;
rep(i,0,sind) {
tmp *= x[i];
tmp %= MOD;
}
ans = ans % MOD;
ans *= tmp;
ans = ans % MOD;
return ans;
}
int init(int N, int X[], int Y[])
{
n = N;
x.assign(N, 0);
y.assign(N, 0);
rep(i,0,N) {
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();
}
// 17p, M = 0
Compilation message
horses.cpp:32:10: fatal error: Math/BigInt.h: No such file or directory
32 | #include <Math/BigInt.h>
| ^~~~~~~~~~~~~~~
compilation terminated.