oj.uz

Submission #65614

# Submission time Handle Problem Language Result Execution time Memory
65614 2018-08-08T09:15:46 Z daniel_02 Horses (IOI15_horses) C++17
0 / 100
 1500 ms 8424 KB 
#include "horses.h"
#include "bits/stdc++.h"

#define ll long long

using namespace std;

const int MOD = 1e9 + 7;
const int sz = 5e5 + 7;

int n, x[sz], y[sz];

int init(int N, int X[], int Y[]) {

    double h = 0;
    ll cur = 1;
    double ans = 0;
    ll ans1;
    n = N;

    for (int i = 0; i < N; i++)
    {
        x[i] = X[i];
        y[i] = Y[i];

        h += log10(x[i]);
        cur = (cur * x[i]) % MOD;
        if (ans * 1.0 < h * log10(y[i]))
        {
            ans = log10(y[i]) * h;
            ans1 = (y[i] * cur) % MOD;
        }
    }

    return (ans1 % MOD);
}

int updateX(int pos, int val) {
    x[pos] = val;
    return init(n, x, y);
}

int updateY(int pos, int val) {
    y[pos] = val;
    return init(n, x, y);
}

Compilation message

horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:35:18: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     return (ans1 % MOD);
            ~~~~~~^~~~~~
horses.cpp:35:23: warning: 'ans1' may be used uninitialized in this function [-Wmaybe-uninitialized]
     return (ans1 % MOD);
                       ^

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 436 KB Output is correct
4 Correct 4 ms 436 KB Output is correct
5 Incorrect 3 ms 512 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 556 KB Output is correct
2 Correct 3 ms 564 KB Output is correct
3 Correct 3 ms 564 KB Output is correct
4 Correct 3 ms 616 KB Output is correct
5 Incorrect 3 ms 616 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1569 ms 8424 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8424 KB Output is correct
2 Correct 2 ms 8424 KB Output is correct
3 Correct 2 ms 8424 KB Output is correct
4 Correct 2 ms 8424 KB Output is correct
5 Incorrect 2 ms 8424 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8424 KB Output is correct
2 Correct 3 ms 8424 KB Output is correct
3 Correct 2 ms 8424 KB Output is correct
4 Correct 3 ms 8424 KB Output is correct
5 Incorrect 2 ms 8424 KB Output isn't correct
6 Halted 0 ms 0 KB -