oj.uz

답안 #1039997

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1039997 2024-07-31T13:35:42 Z c2zi6 말 (IOI15_horses) C++14
100 / 100
 399 ms 65616 KB 
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<typename T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "horses.h"

const ll MOD = 1e9 + 7;

struct SEGTREEPROD {
    int n;
    VL tree;
    SEGTREEPROD(){}
    SEGTREEPROD(int sz) {
        n = 1;
        while (n < sz) n *= 2;
        tree = VL(2*n);
    }
    void upd(int N, int L, int R, int i, int s) {
        if (i < L || i > R) return;
        if (L == R) {
            tree[N] = s;
            return;
        }
        int M = (L + R) / 2;
        upd(2*N+1, L, M, i, s);
        upd(2*N+2, M+1, R, i, s);
        tree[N] = tree[2*N+1] * tree[2*N+2] % MOD;
    }
    int get(int N, int L, int R, int l, int r) {
        if (l <= L && R <= r) return tree[N];
        if (R < l || L > r) return 1;
        int M = (L + R) / 2;
        return 1ll * get(2*N+1, L, M, l, r) * get(2*N+2, M+1, R, l, r) % MOD;
    }
    void upd(int i, int s) {
        upd(0, 0, n-1, i, s);
    }
    int get(int l, int r) {
        return get(0, 0, n-1, l, r);
    }
};
struct SEGTREEMAX {
    int n;
    VL tree;
    SEGTREEMAX(){}
    SEGTREEMAX(int sz) {
        n = 1;
        while (n < sz) n *= 2;
        tree = VL(2*n);
    }
    void upd(int N, int L, int R, int i, int s) {
        if (i < L || i > R) return;
        if (L == R) {
            tree[N] = s;
            return;
        }
        int M = (L + R) / 2;
        upd(2*N+1, L, M, i, s);
        upd(2*N+2, M+1, R, i, s);
        tree[N] = max(tree[2*N+1], tree[2*N+2]);
    }
    int get(int N, int L, int R, int l, int r) {
        if (l <= L && R <= r) return tree[N];
        if (R < l || L > r) return -2e9;
        int M = (L + R) / 2;
        return max(get(2*N+1, L, M, l, r), get(2*N+2, M+1, R, l, r));
    }
    void upd(int i, int s) {
        upd(0, 0, n-1, i, s);
    }
    int get(int l, int r) {
        return get(0, 0, n-1, l, r);
    }
};

int n;
VL a, b;
SEGTREEPROD sega;
SEGTREEMAX segb;
set<int> nonone;

ll recalc() {
    ll leave = n-1;
    ll prod = 1;
    for (auto it = nonone.end(); it != nonone.begin(); it--) {
        int i = *prev(it);
    /*reprl(i, n-1, 0) {*/
    /*    if (a[i] == 1) continue;*/
        /*cout << "considering " << i << endl;*/
        ll bi = segb.get(i, n-1);
        if (bi > prod) {
            prod = a[i] * bi;
            leave = i;
        } else {
            prod = a[i] * prod;
        }
        if (prod > 1e9) break;
    }

    if (a[0] == 1) {
        int i = 0;
        ll bi = segb.get(i, n-1);
        if (bi > prod) {
            prod = a[i] * bi;
            leave = i;
        } else {
            prod = a[i] * prod;
        }
    }

	return 1ll * sega.get(0, leave) * segb.get(leave, n-1) % MOD;
	return sega.get(0, leave) * b[leave] % MOD;
}

int init(int N, int X[], int Y[]) {
    n = N;
    a = b = VL(n);
    rep(i, n) {
        a[i] = X[i];
        b[i] = Y[i];
    }
    sega = SEGTREEPROD(n);
    rep(i, n) sega.upd(i, a[i]);
    segb = SEGTREEMAX(n);
    rep(i, n) segb.upd(i, b[i]);
    rep(i, n) if (a[i] != 1) nonone.insert(i);
    return recalc();
}

int updateX(int pos, int val) {	
    if (a[pos] != 1) nonone.erase(pos);
    a[pos] = val;
    if (a[pos] != 1) nonone.insert(pos);
    sega.upd(pos, a[pos]);
	return recalc();
}

int updateY(int pos, int val) {
    b[pos] = val;
    segb.upd(pos, b[pos]);
	return recalc();
}

Compilation message

horses.cpp: In member function 'int SEGTREEPROD::get(int, int, int, int, int)':
horses.cpp:57:44: warning: conversion from '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type' {aka 'long long int'} to 'int' may change value [-Wconversion]
   57 |         if (l <= L && R <= r) return tree[N];
      |                                            ^
horses.cpp:60:72: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   60 |         return 1ll * get(2*N+1, L, M, l, r) * get(2*N+2, M+1, R, l, r) % MOD;
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
horses.cpp: In member function 'int SEGTREEMAX::get(int, int, int, int, int)':
horses.cpp:90:44: warning: conversion from '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type' {aka 'long long int'} to 'int' may change value [-Wconversion]
   90 |         if (l <= L && R <= r) return tree[N];
      |                                            ^
horses.cpp: In function 'll recalc()':
horses.cpp:124:13: warning: conversion from 'll' {aka 'long long int'} to 'double' may change value [-Wconversion]
  124 |         if (prod > 1e9) break;
      |             ^~~~
horses.cpp:138:27: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
  138 |  return 1ll * sega.get(0, leave) * segb.get(leave, n-1) % MOD;
      |                           ^~~~~
horses.cpp:138:45: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
  138 |  return 1ll * sega.get(0, leave) * segb.get(leave, n-1) % MOD;
      |                                             ^~~~~
horses.cpp:139:21: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
  139 |  return sega.get(0, leave) * b[leave] % MOD;
      |                     ^~~~~
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:150:31: warning: conversion from '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type' {aka 'long long int'} to 'int' may change value [-Wconversion]
  150 |     rep(i, n) sega.upd(i, a[i]);
      |                               ^
horses.cpp:152:31: warning: conversion from '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type' {aka 'long long int'} to 'int' may change value [-Wconversion]
  152 |     rep(i, n) segb.upd(i, b[i]);
      |                               ^
horses.cpp:154:18: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
  154 |     return recalc();
      |            ~~~~~~^~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:161:25: warning: conversion from '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type' {aka 'long long int'} to 'int' may change value [-Wconversion]
  161 |     sega.upd(pos, a[pos]);
      |                         ^
horses.cpp:162:15: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
  162 |  return recalc();
      |         ~~~~~~^~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:167:25: warning: conversion from '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type' {aka 'long long int'} to 'int' may change value [-Wconversion]
  167 |     segb.upd(pos, b[pos]);
      |                         ^
horses.cpp:168:15: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
  168 |  return recalc();
      |         ~~~~~~^~

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 436 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 432 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 352 KB Output is correct
25 Correct 1 ms 548 KB Output is correct
26 Correct 1 ms 360 KB Output is correct
27 Correct 2 ms 344 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 373 ms 56708 KB Output is correct
2 Correct 309 ms 65616 KB Output is correct
3 Correct 298 ms 56844 KB Output is correct
4 Correct 325 ms 60448 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 604 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 376 KB Output is correct
26 Correct 2 ms 348 KB Output is correct
27 Correct 2 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 141 ms 32636 KB Output is correct
34 Correct 135 ms 32592 KB Output is correct
35 Correct 223 ms 62800 KB Output is correct
36 Correct 227 ms 62908 KB Output is correct
37 Correct 141 ms 30804 KB Output is correct
38 Correct 156 ms 43612 KB Output is correct
39 Correct 117 ms 30648 KB Output is correct
40 Correct 205 ms 57940 KB Output is correct
41 Correct 123 ms 30620 KB Output is correct
42 Correct 127 ms 30672 KB Output is correct
43 Correct 206 ms 58236 KB Output is correct
44 Correct 204 ms 58424 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 2 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 2 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 380 ms 56624 KB Output is correct
34 Correct 310 ms 65484 KB Output is correct
35 Correct 314 ms 56832 KB Output is correct
36 Correct 342 ms 60500 KB Output is correct
37 Correct 135 ms 32544 KB Output is correct
38 Correct 119 ms 32620 KB Output is correct
39 Correct 220 ms 62936 KB Output is correct
40 Correct 234 ms 62800 KB Output is correct
41 Correct 133 ms 30672 KB Output is correct
42 Correct 159 ms 43620 KB Output is correct
43 Correct 124 ms 30624 KB Output is correct
44 Correct 203 ms 57940 KB Output is correct
45 Correct 123 ms 30544 KB Output is correct
46 Correct 129 ms 30656 KB Output is correct
47 Correct 205 ms 58416 KB Output is correct
48 Correct 212 ms 58452 KB Output is correct
49 Correct 187 ms 35676 KB Output is correct
50 Correct 183 ms 35664 KB Output is correct
51 Correct 297 ms 64712 KB Output is correct
52 Correct 265 ms 64400 KB Output is correct
53 Correct 399 ms 33796 KB Output is correct
54 Correct 251 ms 47340 KB Output is correct
55 Correct 168 ms 31568 KB Output is correct
56 Correct 270 ms 59872 KB Output is correct
57 Correct 248 ms 32268 KB Output is correct
58 Correct 302 ms 32860 KB Output is correct
59 Correct 200 ms 58452 KB Output is correct