oj.uz

답안 #956363

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
956363 2024-04-01T17:19:24 Z steveonalex 말 (IOI15_horses) C++17
17 / 100
 266 ms 44592 KB 
#include <bits/stdc++.h>
#include "horses.h"
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T& container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const int MOD = 1e9 + 7, N = 5e5 + 69;
int n;
vector<int> X, Y;

struct SegmentTreeProd{
    int n;
    vector<ll> a;

    SegmentTreeProd(int _n){
        n = _n;
        a.resize(n * 2 + 2, 1);
    }

    void update(int i, int v){
        i += n; a[i] = v;
        while(i > 1){
            i >>= 1;
            a[i] = a[i * 2] * a[i * 2 + 1] % MOD;
        }
    }

    ll get(int l, int r){
        l += n; r += n + 1;
        ll ans =1;
        while(l < r){
            if (l & 1) ans = ans * a[l++] % MOD;
            if (r & 1) ans = ans * a[--r] % MOD;
            l >>= 1; r >>= 1;
        }
        return ans;
    }
};


struct SegmentTreeMax{
    int n;
    vector<int> a;

    SegmentTreeMax(int _n){
        n = _n;
        a.resize(n * 2 + 2, 0);
    }

    void update(int i, int v){
        i += n; a[i] = v;
        while(i > 1){
            i >>= 1;
            a[i] = max(a[i * 2], a[i * 2 + 1]);
        }
    }

    ll get(int l, int r){
        l += n; r += n + 1;
        int ans = 0;
        while(l < r){
            if (l & 1) maximize(ans, a[l++]);
            if (r & 1) maximize(ans, a[--r]);
            l >>= 1; r >>= 1;
        }
        return ans;
    }
};

SegmentTreeProd st1(N);
SegmentTreeMax st2(N);

set<int> S; 

int calc(){
    if (S.size() == 0) return st2.get(1, n);
    ll mul = 1;
    auto it = S.end(); it--;
    vector<pair<int, int>> chode;
    while(true){
        chode.push_back({*it, X[*it]});
        mul *= chode.back().second;
        if (mul > 1e9){
            break;
        }
        else if (it == S.begin()) {
            if (chode.back().first != 1) chode.push_back({1, 1});
            break;
        }
        it--;
    }

    ll sugma = st1.get(1, chode.back().first - 1);
    reverse(ALL(chode));
    mul = 1;
    ll ans = 0;
    for(pair<int, int> i: chode){
        mul = mul * i.second;
        maximize(ans, 1LL * mul * st2.get(i.first, n));
    }
    return sugma * ans % MOD;
}

int init(int _n, int x[], int y[]) {
    n = _n;
    X.resize(n+1); Y.resize(n+1);
    for(int i = 0; i<n; ++i) X[i+1] = x[i];
    for(int i = 0; i<n; ++i) Y[i+1] = y[i];
        
    for(int i= 1; i<=n; ++i) st1.update(i, X[i]);
    for(int i= 1; i<=n; ++i) st2.update(i, Y[i]);

    for(int i = 1; i<=n; ++i) if (X[i] > 1) S.insert(i);

    return calc();
}

int updateX(int pos, int val) { 
    pos++;
    if (X[pos] > 1){
        S.erase(pos);
    }
    X[pos] = val;
    if (X[pos] > 1) S.insert(pos);

    st1.update(pos, val);

    return calc();
}

int updateY(int pos, int val) {
    pos++;
    st2.update(pos, val);
    Y[pos] = val;
    return calc();
}


// int main(void){
//     ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

//     int x[] = {2, 1, 3}, y[] = {3, 4, 1};
//     cout << init(3, x, y) << "\n";
//     cout << updateY(1, 2) << "\n";

//     return 0;
// }

Compilation message

horses.cpp: In function 'int calc()':
horses.cpp:117:38: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
  117 |     if (S.size() == 0) return st2.get(1, n);
      |                               ~~~~~~~^~~~~~
horses.cpp:124:13: warning: conversion from 'll' {aka 'long long int'} to 'double' may change value [-Wconversion]
  124 |         if (mul > 1e9){
      |             ^~~
horses.cpp:142:24: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
  142 |     return sugma * ans % MOD;
      |            ~~~~~~~~~~~~^~~~~

Subtask #1
17.0 / 17.0

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

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 12124 KB Output is correct
2 Correct 4 ms 12124 KB Output is correct
3 Correct 3 ms 12124 KB Output is correct
4 Correct 3 ms 12124 KB Output is correct
5 Correct 3 ms 12124 KB Output is correct
6 Correct 3 ms 12124 KB Output is correct
7 Correct 4 ms 12124 KB Output is correct
8 Correct 4 ms 12124 KB Output is correct
9 Correct 3 ms 12120 KB Output is correct
10 Correct 3 ms 12120 KB Output is correct
11 Correct 3 ms 12124 KB Output is correct
12 Correct 4 ms 12124 KB Output is correct
13 Correct 3 ms 12124 KB Output is correct
14 Correct 3 ms 12132 KB Output is correct
15 Correct 3 ms 12124 KB Output is correct
16 Correct 4 ms 12124 KB Output is correct
17 Correct 3 ms 12124 KB Output is correct
18 Correct 3 ms 12124 KB Output is correct
19 Correct 4 ms 12140 KB Output is correct
20 Correct 3 ms 12124 KB Output is correct
21 Incorrect 3 ms 12124 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

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

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12120 KB Output is correct
2 Correct 3 ms 12124 KB Output is correct
3 Correct 4 ms 12124 KB Output is correct
4 Correct 4 ms 12124 KB Output is correct
5 Correct 3 ms 12124 KB Output is correct
6 Correct 4 ms 12124 KB Output is correct
7 Correct 3 ms 12124 KB Output is correct
8 Correct 4 ms 12124 KB Output is correct
9 Correct 4 ms 12120 KB Output is correct
10 Correct 3 ms 12120 KB Output is correct
11 Correct 3 ms 12124 KB Output is correct
12 Correct 4 ms 12124 KB Output is correct
13 Correct 3 ms 11992 KB Output is correct
14 Correct 3 ms 12012 KB Output is correct
15 Correct 3 ms 12124 KB Output is correct
16 Correct 3 ms 12124 KB Output is correct
17 Correct 3 ms 12124 KB Output is correct
18 Correct 3 ms 12120 KB Output is correct
19 Correct 3 ms 12124 KB Output is correct
20 Correct 5 ms 12124 KB Output is correct
21 Incorrect 3 ms 12124 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 12120 KB Output is correct
2 Correct 4 ms 12124 KB Output is correct
3 Correct 3 ms 12124 KB Output is correct
4 Correct 3 ms 12124 KB Output is correct
5 Correct 3 ms 12124 KB Output is correct
6 Correct 3 ms 12124 KB Output is correct
7 Correct 3 ms 12124 KB Output is correct
8 Correct 3 ms 12124 KB Output is correct
9 Correct 3 ms 12096 KB Output is correct
10 Correct 4 ms 12120 KB Output is correct
11 Correct 3 ms 12124 KB Output is correct
12 Correct 3 ms 12124 KB Output is correct
13 Correct 3 ms 12124 KB Output is correct
14 Correct 3 ms 12124 KB Output is correct
15 Correct 3 ms 12124 KB Output is correct
16 Correct 3 ms 12124 KB Output is correct
17 Correct 3 ms 12124 KB Output is correct
18 Correct 4 ms 12120 KB Output is correct
19 Correct 3 ms 12124 KB Output is correct
20 Correct 3 ms 12124 KB Output is correct
21 Incorrect 4 ms 12124 KB Output isn't correct
22 Halted 0 ms 0 KB -