oj.uz

답안 #927820

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
927820 2024-02-15T11:07:50 Z VMaksimoski008 말 (IOI15_horses) C++14
0 / 100
 1500 ms 13748 KB 
#include <bits/stdc++.h>
#include "horses.h"

#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int maxn = 1e5 + 5;

int n;
vector<ll> X(5*maxn), Y(maxn);
vector<double> logX(5*maxn), logY(maxn);

int calc() {
    ll curr = 1, id = -1, p1 = 0;
    double ls = 0, ans = 0;

    for(int i=0; i<n; i++) {
        curr = (curr * X[i]) % mod;
        ls += logX[i];
        if(ls + logY[i] > ans) {
            ans = ls + logY[i];
            id = i;
            p1 = curr;
        }
    }

    ll res = (p1 * Y[id]) % mod;

    return (int)res;
}

int init(int N, int x[], int y[]) {
    n = N;
    for(int i=0; i<n; i++) {
        X[i] = x[i], Y[i] = y[i];
        logX[i] = log10(X[i]), logY[i] = log10(y[i]);
    }
    return calc();
}

int updateX(int p, int v) {
    X[p] = v;
    logX[p] = log10(v);
    return calc();
}

int updateY(int p, int v) {
    logY[p] = log10(v);
    return calc();
}

Subtask #1
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 9820 KB Output is correct
2 Correct 3 ms 9820 KB Output is correct
3 Correct 3 ms 9820 KB Output is correct
4 Correct 2 ms 9820 KB Output is correct
5 Correct 3 ms 9820 KB Output is correct
6 Correct 3 ms 9820 KB Output is correct
7 Correct 3 ms 9620 KB Output is correct
8 Correct 4 ms 9820 KB Output is correct
9 Correct 4 ms 9816 KB Output is correct
10 Correct 4 ms 9820 KB Output is correct
11 Correct 3 ms 9820 KB Output is correct
12 Incorrect 3 ms 9820 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 9820 KB Output is correct
2 Correct 4 ms 9820 KB Output is correct
3 Correct 3 ms 9820 KB Output is correct
4 Correct 3 ms 9820 KB Output is correct
5 Correct 3 ms 9820 KB Output is correct
6 Correct 3 ms 9820 KB Output is correct
7 Correct 3 ms 9820 KB Output is correct
8 Correct 3 ms 9820 KB Output is correct
9 Correct 3 ms 9808 KB Output is correct
10 Correct 3 ms 9816 KB Output is correct
11 Correct 3 ms 9976 KB Output is correct
12 Incorrect 3 ms 9816 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1534 ms 13748 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 9820 KB Output is correct
2 Correct 3 ms 9820 KB Output is correct
3 Correct 3 ms 9820 KB Output is correct
4 Correct 3 ms 9816 KB Output is correct
5 Correct 3 ms 9752 KB Output is correct
6 Correct 3 ms 9820 KB Output is correct
7 Correct 3 ms 9820 KB Output is correct
8 Correct 3 ms 9820 KB Output is correct
9 Correct 3 ms 9820 KB Output is correct
10 Correct 3 ms 9820 KB Output is correct
11 Correct 3 ms 9820 KB Output is correct
12 Incorrect 4 ms 9820 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 9820 KB Output is correct
2 Correct 3 ms 9820 KB Output is correct
3 Correct 3 ms 9820 KB Output is correct
4 Correct 3 ms 9820 KB Output is correct
5 Correct 3 ms 9820 KB Output is correct
6 Correct 4 ms 9820 KB Output is correct
7 Correct 4 ms 9820 KB Output is correct
8 Correct 3 ms 9820 KB Output is correct
9 Correct 3 ms 9820 KB Output is correct
10 Correct 3 ms 9708 KB Output is correct
11 Correct 3 ms 9820 KB Output is correct
12 Incorrect 4 ms 9820 KB Output isn't correct
13 Halted 0 ms 0 KB -