oj.uz

Submission #66211

# Submission time Handle Problem Language Result Execution time Memory
66211 2018-08-10T04:52:03 Z daniel_02 Horses (IOI15_horses) C++17
54 / 100
 941 ms 446268 KB 
#include "horses.h"
#include "bits/stdc++.h"

#define ll long long
#define fr first
#define sc second

using namespace std;

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

ll n, x[sz], y[sz];
pair<double, ll> t[sz * 5], ad[sz * 5], an[sz];

pair<double, ll> maxp(pair<double, ll> a, pair<double, ll> b)
{
    if (a.fr > b.fr)
    {
        return a;
    }
    else
    {
        return b;
    }
}
ll bin_pow(ll a, ll k)
{
    if (k == 1)return a;

    if (k & 1)
        return ((a * 1LL * bin_pow(a, k - 1)) % MOD);
    else
    {
        ll b = bin_pow(a, k / 2);

        return ((b * b) % MOD);
    }
}
void build(int v, int tl, int tr)
{
    if (tl == tr)
    {
        t[v].fr = an[tl].fr;
        t[v].sc = an[tl].sc;
    }
    else
    {
        int mid = (tl + tr) >> 1;

        build(v + v, tl, mid);
        build(v + v + 1, mid + 1, tr);

        t[v] = maxp(t[v + v], t[v + v + 1]);
    }
}
void push(int v, int tl, int tr)
{
    if (ad[v].sc == -1)return;

    t[v].fr += ad[v].fr;
    t[v].sc = (ad[v].sc * t[v].sc) % MOD;

    ad[v + v].fr += ad[v].fr;
    ad[v + v + 1].fr += ad[v].fr;

    if (ad[v + v].sc == -1)ad[v + v].sc = 1;
    if (ad[v + v + 1].sc == -1)ad[v + v + 1].sc = 1;

    ad[v + v].sc = (ad[v].sc * ad[v + v].sc) % MOD;
    ad[v + v + 1].sc = (ad[v].sc * ad[v + v + 1].sc) % MOD;

    if (t[v].sc < -1)
        t[v].sc *= -1;

    ad[v].fr = 0;
    ad[v].sc = -1;
}
void updy(int v, int tl, int tr, int pos, double val, ll val1)
{
    push(v, tl, tr);
    push(v + v, tl, tr);
    push(v + v + 1, tl, tr);

    if (t[v].sc < -1)
        t[v].sc *= -1;

    if (tl == tr)
    {
        t[v].fr += val;
        t[v].sc = (t[v].sc * val1) % MOD;
    }
    else
    {
        int mid = (tl + tr) >> 1;

        if (mid >= pos)
            updy(v + v, tl, mid, pos, val, val1);
        else
            updy(v + v + 1, mid + 1, tr, pos, val, val1);

        push(v, tl, tr);
        push(v + v, tl, tr);
        push(v + v + 1, tl, tr);

        t[v] = maxp(t[v + v], t[v + v + 1]);
    }
}
void updx(int v, int tl, int tr, int l, int r, double val, ll val1)
{
    push(v, tl, tr);
    push(v + v, tl, tr);
    push(v + v + 1, tl, tr);

    if (t[v].sc < -1)
        t[v].sc *= -1;

    if (tl > r || l > tr)return;

    if (l <= tl && tr <= r)
    {
        ad[v].fr += val;
        if (ad[v].sc == -1)ad[v].sc = 1;

        ad[v].sc = (val1 * 1LL * ad[v].sc) % MOD;

        push(v, tl, tr);
        push(v + v, tl, tr);
        push(v + v + 1, tl, tr);
    }
    else
    {
        int mid = (tl + tr) >> 1;

        updx(v + v, tl, mid, l, r, val, val1);
        updx(v + v + 1, mid + 1, tr, l, r, val, val1);

        push(v, tl, tr);
        push(v + v, tl, tr);
        push(v + v + 1, tl, tr);

        t[v] = maxp(t[v + v], t[v + v + 1]);
    }
}
int init(int N, int X[], int Y[]) {

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

    for (int i = 0; i < sz * 5 - 1; i++)
    {
        ad[i].sc = -1;
    }

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

    for (int i = 0; i < N; i++)
    {
        h += log10(X[i]);
        cur = (cur * 1LL * X[i]) % MOD;
        an[i + 1] = {h + log10(Y[i]), (cur * 1LL * Y[i]) % MOD};

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

    build(1, 1, n);

    return (ans1 % MOD);
}

int updateX(int pos, int val) {
    pos++;
    double a = (log10(val) - log10(x[pos]));
    ll b = (val * 1LL * bin_pow(x[pos], MOD - 2)) % MOD;
    updx(1, 1, n, pos, n, a, b);
    x[pos] = val;
    return (t[1].sc % MOD);
}

int updateY(int pos, int val) {
    pos++;
    double a = (log10(val) - log10(y[pos]));

    ll b = (val * 1LL * bin_pow(y[pos], MOD - 2)) % MOD;

    updy(1, 1, n, pos, a, b);

    y[pos] = val;

    return (t[1].sc % MOD);
}

Compilation message

horses.cpp: In function 'void push(int, int, int)':
horses.cpp:57:22: warning: unused parameter 'tl' [-Wunused-parameter]
 void push(int v, int tl, int tr)
                      ^~
horses.cpp:57:30: warning: unused parameter 'tr' [-Wunused-parameter]
 void push(int v, int tl, int tr)
                              ^~
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:177:18: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     build(1, 1, n);
                  ^
horses.cpp:179:18: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     return (ans1 % MOD);
            ~~~~~~^~~~~~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:186:31: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     updx(1, 1, n, pos, n, a, b);
                               ^
horses.cpp:186:31: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
horses.cpp:188:21: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     return (t[1].sc % MOD);
            ~~~~~~~~~^~~~~~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:197:28: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     updy(1, 1, n, pos, a, b);
                            ^
horses.cpp:201:21: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     return (t[1].sc % MOD);
            ~~~~~~~~~^~~~~~

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 296 ms 391800 KB Output is correct
2 Correct 297 ms 391800 KB Output is correct
3 Correct 295 ms 391832 KB Output is correct
4 Correct 306 ms 391836 KB Output is correct
5 Correct 299 ms 391868 KB Output is correct
6 Correct 279 ms 391940 KB Output is correct
7 Correct 285 ms 391952 KB Output is correct
8 Correct 302 ms 391952 KB Output is correct
9 Correct 298 ms 392004 KB Output is correct
10 Correct 307 ms 392004 KB Output is correct
11 Correct 308 ms 392016 KB Output is correct
12 Correct 354 ms 392016 KB Output is correct
13 Correct 298 ms 392152 KB Output is correct
14 Correct 298 ms 392152 KB Output is correct
15 Correct 288 ms 392164 KB Output is correct
16 Correct 286 ms 392164 KB Output is correct
17 Correct 344 ms 392164 KB Output is correct
18 Correct 270 ms 392164 KB Output is correct
19 Correct 281 ms 392220 KB Output is correct
20 Correct 302 ms 392284 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 275 ms 392284 KB Output is correct
2 Correct 285 ms 392284 KB Output is correct
3 Correct 322 ms 392284 KB Output is correct
4 Correct 311 ms 392284 KB Output is correct
5 Correct 280 ms 392284 KB Output is correct
6 Correct 290 ms 392284 KB Output is correct
7 Correct 303 ms 392284 KB Output is correct
8 Correct 303 ms 392284 KB Output is correct
9 Correct 295 ms 392284 KB Output is correct
10 Correct 300 ms 392284 KB Output is correct
11 Correct 273 ms 392284 KB Output is correct
12 Correct 297 ms 392284 KB Output is correct
13 Correct 300 ms 392284 KB Output is correct
14 Correct 270 ms 392284 KB Output is correct
15 Correct 289 ms 392284 KB Output is correct
16 Correct 285 ms 392284 KB Output is correct
17 Correct 321 ms 392284 KB Output is correct
18 Correct 291 ms 392284 KB Output is correct
19 Correct 323 ms 392396 KB Output is correct
20 Correct 301 ms 392396 KB Output is correct
21 Correct 276 ms 392396 KB Output is correct
22 Correct 307 ms 392396 KB Output is correct
23 Correct 296 ms 392396 KB Output is correct
24 Correct 281 ms 392504 KB Output is correct
25 Correct 318 ms 392504 KB Output is correct
26 Correct 275 ms 392504 KB Output is correct
27 Correct 277 ms 392504 KB Output is correct
28 Correct 286 ms 392504 KB Output is correct
29 Correct 277 ms 392504 KB Output is correct
30 Correct 297 ms 392548 KB Output is correct
31 Correct 316 ms 392584 KB Output is correct
32 Correct 296 ms 392600 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 479 ms 429648 KB Output is correct
2 Correct 941 ms 446212 KB Output is correct
3 Correct 783 ms 446212 KB Output is correct
4 Correct 896 ms 446212 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 269 ms 446212 KB Output is correct
2 Correct 309 ms 446212 KB Output is correct
3 Correct 310 ms 446212 KB Output is correct
4 Correct 301 ms 446212 KB Output is correct
5 Correct 267 ms 446212 KB Output is correct
6 Correct 268 ms 446212 KB Output is correct
7 Correct 286 ms 446212 KB Output is correct
8 Correct 272 ms 446212 KB Output is correct
9 Correct 294 ms 446212 KB Output is correct
10 Correct 277 ms 446212 KB Output is correct
11 Correct 295 ms 446212 KB Output is correct
12 Correct 268 ms 446212 KB Output is correct
13 Correct 302 ms 446212 KB Output is correct
14 Correct 286 ms 446212 KB Output is correct
15 Correct 290 ms 446212 KB Output is correct
16 Correct 291 ms 446212 KB Output is correct
17 Correct 271 ms 446212 KB Output is correct
18 Correct 278 ms 446212 KB Output is correct
19 Correct 318 ms 446212 KB Output is correct
20 Correct 274 ms 446212 KB Output is correct
21 Correct 274 ms 446212 KB Output is correct
22 Correct 263 ms 446212 KB Output is correct
23 Correct 284 ms 446212 KB Output is correct
24 Correct 267 ms 446212 KB Output is correct
25 Correct 267 ms 446212 KB Output is correct
26 Correct 294 ms 446212 KB Output is correct
27 Correct 306 ms 446212 KB Output is correct
28 Correct 302 ms 446212 KB Output is correct
29 Correct 289 ms 446212 KB Output is correct
30 Correct 329 ms 446212 KB Output is correct
31 Correct 266 ms 446212 KB Output is correct
32 Correct 321 ms 446212 KB Output is correct
33 Correct 471 ms 446212 KB Output is correct
34 Correct 435 ms 446212 KB Output is correct
35 Correct 432 ms 446212 KB Output is correct
36 Correct 443 ms 446212 KB Output is correct
37 Correct 380 ms 446212 KB Output is correct
38 Correct 406 ms 446212 KB Output is correct
39 Correct 396 ms 446212 KB Output is correct
40 Correct 412 ms 446212 KB Output is correct
41 Correct 340 ms 446212 KB Output is correct
42 Correct 343 ms 446212 KB Output is correct
43 Incorrect 394 ms 446212 KB Output isn't correct
44 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 265 ms 446212 KB Output is correct
2 Correct 313 ms 446212 KB Output is correct
3 Correct 273 ms 446212 KB Output is correct
4 Correct 277 ms 446212 KB Output is correct
5 Correct 295 ms 446212 KB Output is correct
6 Correct 274 ms 446212 KB Output is correct
7 Correct 290 ms 446212 KB Output is correct
8 Correct 272 ms 446212 KB Output is correct
9 Correct 299 ms 446212 KB Output is correct
10 Correct 297 ms 446212 KB Output is correct
11 Correct 297 ms 446212 KB Output is correct
12 Correct 277 ms 446212 KB Output is correct
13 Correct 274 ms 446212 KB Output is correct
14 Correct 301 ms 446212 KB Output is correct
15 Correct 291 ms 446212 KB Output is correct
16 Correct 298 ms 446212 KB Output is correct
17 Correct 290 ms 446212 KB Output is correct
18 Correct 301 ms 446212 KB Output is correct
19 Correct 304 ms 446212 KB Output is correct
20 Correct 311 ms 446212 KB Output is correct
21 Correct 300 ms 446212 KB Output is correct
22 Correct 299 ms 446212 KB Output is correct
23 Correct 300 ms 446212 KB Output is correct
24 Correct 307 ms 446212 KB Output is correct
25 Correct 300 ms 446212 KB Output is correct
26 Correct 269 ms 446212 KB Output is correct
27 Correct 301 ms 446212 KB Output is correct
28 Correct 290 ms 446212 KB Output is correct
29 Correct 292 ms 446212 KB Output is correct
30 Correct 290 ms 446212 KB Output is correct
31 Correct 283 ms 446212 KB Output is correct
32 Correct 293 ms 446212 KB Output is correct
33 Correct 447 ms 446212 KB Output is correct
34 Correct 795 ms 446212 KB Output is correct
35 Correct 792 ms 446268 KB Output is correct
36 Correct 815 ms 446268 KB Output is correct
37 Correct 462 ms 446268 KB Output is correct
38 Correct 483 ms 446268 KB Output is correct
39 Correct 480 ms 446268 KB Output is correct
40 Correct 468 ms 446268 KB Output is correct
41 Correct 367 ms 446268 KB Output is correct
42 Correct 426 ms 446268 KB Output is correct
43 Correct 340 ms 446268 KB Output is correct
44 Correct 419 ms 446268 KB Output is correct
45 Correct 327 ms 446268 KB Output is correct
46 Correct 382 ms 446268 KB Output is correct
47 Incorrect 379 ms 446268 KB Output isn't correct
48 Halted 0 ms 0 KB -