제출 #1011342

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1011342		nisanduu	Horses (IOI15_horses)	C++14	17 / 100	16 ms	10588 KiB

horses

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e4;
int sz;
int a[N], b[N];
const ll mod = 1e9 + 7;

int init(int n, int* X, int* Y) {
    for (int i = 0; i < n; i++) {
        a[i] = X[i];
        b[i] = Y[i];
    }
    sz = n;
    ll ans = 0;
    ll cr = 1;
    for (int i = 0; i < n; i++) {
        cr = (cr * 1LL * a[i]) % mod;
        ans = max(ans, (cr * b[i] * 1LL) % mod);
    }
    return (int)ans;
}

int updateX(int pos, int val) {
    a[pos] = val;
    ll ans = 0;
    ll cr = 1;
    for (int i = 0; i < sz; i++) {
        cr = (cr * 1LL * a[i]) % mod;
        ans = max(ans, (cr * b[i] * 1LL) % mod);
    }
    return (int)ans;
}

int updateY(int pos, int val) {
    b[pos] = val;
    ll ans = 0;
    ll cr = 1;
    for (int i = 0; i < sz; i++) {
        cr = (cr * 1LL * a[i]) % mod;
        ans = max(ans, (cr * b[i] * 1LL) % mod);
    }
    return (int)ans;
}

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