제출 #1109562

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1109562		ljtunas	Stone Arranging 2 (JOI23_ho_t1)	C++17	25 / 100	2064 ms	8868 KiB

Main

// author : anhtun_hi , nqg
#include <bits/stdc++.h>
#define ll long long
#define ii pair<ll, ll>
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define reset(h, v)    memset(h, v, sizeof h)
#define Forv(i, a)     for(auto& i : a)
#define For(i, a, b)   for(int i = a; i <= b; ++i)
#define Ford(i, a, b)  for(int i = a; i >= b; --i)
#define c_bit(i)     __builtin_popcountll(i)
#define Bit(mask, i)    ((mask >> i) & 1LL)
#define onbit(mask, i)  ((mask) bitor (1LL << i))
#define offbit(mask, i) ((mask) &~ (1LL << i))
using namespace std;
namespace std {
    template <typename T, int D>
    struct _vector : public vector <_vector <T, D - 1>> {
        static_assert(D >= 1, "Dimension must be positive!");
        template <typename... Args>
        _vector(int n = 0, Args... args) : vector <_vector <T, D - 1>> (n, _vector <T, D - 1> (args...)) {}
    };
    template <typename T> struct _vector <T, 1> : public vector <T> {
        _vector(int n = 0, const T& val = T()) : vector <T> (n, val) {}
    };
    template <class A, class B> bool minimize(A &a, B b){return a > b ? a = b, true : false;}
    template <class A, class B> bool maximize(A &a, B b){return a < b ? a = b, true : false;}
}
const int dx[] = {0, 0, +1, -1}, dy[] = {-1, +1, 0, 0}, LOG = 20, base = 311, inf = 1e9 + 5;
const int MAXN = 2e5 + 5;
const  ll  mod = 1e9 + 7;
const  ll   oo = 1e18;

//#define int long long

int n, a[MAXN], pos[MAXN];

int st[MAXN << 2], lazy[MAXN << 2];

void down(int id, int l, int r){
    if (!~lazy[id] || l == r) return;
    st[id << 1] = lazy[id], lazy[id << 1] = lazy[id];
    st[id << 1 | 1] = lazy[id], lazy[id << 1 | 1] = lazy[id];
//    For(i, id * 2, id * 2 + 1) st[i] = lazy[id], lazy[i] = lazy[id];
    lazy[id] = -1;
}

void update(int id, int l, int r, int u, int v, int val){
    if (v < l || r < u) return;
    down(id, l, r);
    if (u <= l && r <= v) {
        st[id] = val * (r - l + 1);
        lazy[id] = val;
        down(id, l, r);
        return;
    }
    int mid = l + r >> 1;
    update(id << 1, l, mid, u, v, val);
    update(id << 1 | 1, mid + 1, r, u, v, val);
    st[id] = st[id << 1] + st[id << 1 | 1];
}

int get(int id, int l, int r, int u, int v){
    if (v < l || r < u) return 0;
    down(id, l, r);
    if (u <= l && r <= v) return st[id];
    int mid = l + r >> 1;
    return get(id << 1, l, mid, u, v) + get(id << 1 | 1, mid + 1, r, u, v);
}

void Solve() {
    cin >> n;
    vector<int> compress;
    For(i, 1, n) cin >> a[i], compress.push_back(a[i]);
    sort(all(compress)), compress.resize(unique(all(compress)) - compress.begin());
    For(i, 1, n) a[i] = lower_bound(all(compress), a[i]) - compress.begin() + 1;
    reset(lazy, -1);
    For(i, 1, n) pos[a[i]] = i;
    For(i, 1, n){
        For(j, i, pos[a[i]]) a[j] = a[i], maximize(pos[a[j]], j);
    }
    For(i, 1, n) cout << compress[a[i] - 1] << '\n';
}

int32_t main() {
    cin.tie(0) -> sync_with_stdio(0);
    if(fopen("JOI23_ho_t1.inp", "r")) {
        freopen("JOI23_ho_t1.inp", "r", stdin);
        freopen("JOI23_ho_t1.out", "w", stdout);
    }

    int t = 1;
//    cin >> t;

    for (int test = 1; test <= t; test++) {
        Solve();
    }
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

Main.cpp: In function 'void update(int, int, int, int, int, int)':
Main.cpp:58:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   58 |     int mid = l + r >> 1;
      |               ~~^~~
Main.cpp: In function 'int get(int, int, int, int, int)':
Main.cpp:68:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   68 |     int mid = l + r >> 1;
      |               ~~^~~
Main.cpp: In function 'int32_t main()':
Main.cpp:89:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   89 |         freopen("JOI23_ho_t1.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:90:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   90 |         freopen("JOI23_ho_t1.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 25 / 25
• Subtask 2: 0 / 35
• Subtask 3: 0 / 40