Submission #1359156

#TimeUsernameProblemLanguageResultExecution timeMemory
1359156haithamcoderHorses (IOI15_horses)C++20
0 / 100
1595 ms11960 KiB
#include "horses.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef double ld;
typedef pair<ll, ll> pll;

const ll LOG2 = 31;
const ll MOD = 1000000007;
const ll inf = 1e17;

#define db(x) cerr << #x << " = " << x << " | "
#define dbg(x) cerr << #x << " = " << x << "\n"

ll n;
vector<ll> x, y;

ll binexp(ll b, ll e) {
    ll r = 1;
    while (e) {
        if (e & 1) r = (r * b) % MOD;
        e >>= 1;
        b = (b * b) % MOD;
    }
    return r;
}

int init(int N, int X[], int Y[]) {
    n = N;
    x.resize(n);
    y.resize(n);
    for (ll i = 0; i < n; i++) x[i] = X[i], y[i] = Y[i];

    return updateX(0, x[0]);
}

int updateX(int pos, int val) {
    ld res = log2(y[n - 1] * x[n - 1]);

    x[pos] = val;
    for (ll i = n - 2; i >= 0; i--) {
        res = max(res + log2(x[i]), log2(x[i] * y[i]));
    }


    return binexp(2, round(res));
}

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