Submission #1050603

#TimeUsernameProblemLanguageResultExecution timeMemory
1050603ArthuroWichHorses (IOI15_horses)C++17
37 / 100
156 ms35100 KiB
#include "horses.h" #include<bits/stdc++.h> #define int long long int using namespace std; int n, x[500005], y[500005], segs[4*500005], mod = 1e9+7; void build(int n, int l, int r) { if (l == r) { segs[n] = x[l]; } else { int m = (l+r)/2; build(2*n, l, m); build(2*n+1, m+1, r); segs[n] = segs[2*n] * segs[2*n+1]; segs[n] %= mod; } } void update(int n, int l, int r, int i, int v) { if (l == r) { segs[n] = v; } else { int m = (l+r)/2; if (l <= i && i <= m) { update(2*n, l, m, i, v); } else { update(2*n+1, m+1, r, i, v); } segs[n] = segs[2*n] * segs[2*n+1]; segs[n] %= mod; } } int query(int n, int l, int r, int a, int b) { if (b < l || r < a) { return 1; } else if (a <= l && r <= b) { return segs[n]; } else { int m = (l+r)/2; return (query(2*n, l, m, a, b)*query(2*n+1, m+1, r, a, b))%mod; } } int32_t calc() { int ind = 0; long double v = 0, a = 0, b = 0; for (int i = max(n-31, 0LL); i < n; i++) { a += log2(x[i]); if (a+log2(y[i]) > v) { v = a+log2(y[i]); ind = i; } } return (query(1, 0, n-1, 0, ind)*y[ind]) % mod; } int32_t init(int32_t N, int32_t X[], int32_t Y[]) { n = N; for (int i = 0; i < n; i++) { x[i] = X[i]; y[i] = Y[i]; } build(1, 0, n-1); return calc(); } int32_t updateX(int32_t pos, int32_t val) { x[pos] = val; update(1, 0, n-1, pos, val); return calc(); } int32_t updateY(int32_t pos, int32_t val) { y[pos] = val; return calc(); }

Compilation message (stderr)

horses.cpp: In function 'void build(long long int, long long int, long long int)':
horses.cpp:6:16: warning: declaration of 'n' shadows a global declaration [-Wshadow]
    6 | void build(int n, int l, int r) {
      |                ^
horses.cpp:5:5: note: shadowed declaration is here
    5 | int n, x[500005], y[500005], segs[4*500005], mod = 1e9+7;
      |     ^
horses.cpp: In function 'void update(long long int, long long int, long long int, long long int, long long int)':
horses.cpp:17:17: warning: declaration of 'n' shadows a global declaration [-Wshadow]
   17 | void update(int n, int l, int r, int i, int v) {
      |                 ^
horses.cpp:5:5: note: shadowed declaration is here
    5 | int n, x[500005], y[500005], segs[4*500005], mod = 1e9+7;
      |     ^
horses.cpp: In function 'long long int query(long long int, long long int, long long int, long long int, long long int)':
horses.cpp:31:15: warning: declaration of 'n' shadows a global declaration [-Wshadow]
   31 | int query(int n, int l, int r, int a, int b) {
      |               ^
horses.cpp:5:5: note: shadowed declaration is here
    5 | int n, x[500005], y[500005], segs[4*500005], mod = 1e9+7;
      |     ^
horses.cpp: In function 'int32_t calc()':
horses.cpp:51:46: warning: conversion from 'long long int' to 'int32_t' {aka 'int'} may change value [-Wconversion]
   51 |     return (query(1, 0, n-1, 0, ind)*y[ind]) % mod;
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
horses.cpp:43:31: warning: unused variable 'b' [-Wunused-variable]
   43 |     long double v = 0, a = 0, b = 0;
      |                               ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...