제출 #676032

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
676032		Hacv16	말 (IOI15_horses)	C++17	34 / 100	22 ms	12408 KiB

horses

#include <bits/stdc++.h>
using namespace std;
 
#define fr first
#define sc second
 
typedef long long ll;
const int MAX = 1010;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
 
int n, x[MAX], y[MAX];

int getAnswer(){
    ll h = 1, l = 0, p = 1, resp = 0; 

    for(int i = 1; i <= n; i++) {
        h *= x[i]; 
        p = (p * x[i] % MOD);

        long double aux = y[i] * h;

        if(aux > (long double) l){
            resp = (p * y[i]) % MOD;
            h = 1, l = y[i];
        }
    }

    resp %= MOD;

    return (int) resp; 
}

int init(int _n, int _x[], int _y[]){
    n = _n; 
 
    for(int i = 1; i <= n; i++)
        x[i] = _x[i - 1], y[i] = _y[i - 1];
 
    return getAnswer();
}
 
int updateX(int pos, int val){
    x[pos + 1] = val;
    return getAnswer();
}
 
int updateY(int pos, int val){
    y[pos + 1] = val;
    return getAnswer();
}

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