oj.uz

답안 #1039954

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1039954 2024-07-31T13:05:54 Z c2zi6 말 (IOI15_horses) C++14
17 / 100
 224 ms 56656 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 = prev(nonone.end()); it != nonone.begin(); it--) {}
    reprl(i, n-1, 0) {
        if (b[i] > prod) {
            prod = a[i] * b[i];
            leave = i;
        } else {
            prod = a[i] * prod;
        }
        if (prod > 1e9) break;
    }
	return 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:120:13: warning: conversion from 'll' {aka 'long long int'} to 'double' may change value [-Wconversion]
  120 |         if (prod > 1e9) break;
      |             ^~~~
horses.cpp:122:21: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
  122 |  return sega.get(0, leave) * segb.get(leave, n-1) % MOD;
      |                     ^~~~~
horses.cpp:122:39: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
  122 |  return sega.get(0, leave) * segb.get(leave, n-1) % MOD;
      |                                       ^~~~~
horses.cpp:123:21: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
  123 |  return sega.get(0, leave) * b[leave] % MOD;
      |                     ^~~~~
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:134: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]
  134 |     rep(i, n) sega.upd(i, a[i]);
      |                               ^
horses.cpp:136: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]
  136 |     rep(i, n) segb.upd(i, b[i]);
      |                               ^
horses.cpp:138:18: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
  138 |     return recalc();
      |            ~~~~~~^~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:145: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]
  145 |     sega.upd(pos, a[pos]);
      |                         ^
horses.cpp:146:15: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
  146 |  return recalc();
      |         ~~~~~~^~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:151: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]
  151 |     segb.upd(pos, b[pos]);
      |                         ^
horses.cpp:152:15: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
  152 |  return recalc();
      |         ~~~~~~^~

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 432 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 436 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 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 17.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 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 436 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 600 KB Output is correct
15 Correct 0 ms 432 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 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Incorrect 0 ms 348 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 224 ms 56656 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.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 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 348 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 344 KB Output is correct
21 Incorrect 0 ms 348 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #5
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 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 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 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 Incorrect 0 ms 348 KB Output isn't correct
22 Halted 0 ms 0 KB -