제출 #1054940

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1054940		CodeLakVN	Stone Arranging 2 (JOI23_ho_t1)	C++17	100 / 100	161 ms	20560 KiB

Main

#include <bits/stdc++.h>

#define no "NO"
#define yes "YES"
#define F first
#define S second
#define vec vector
#define task "main"
#define ll long long
#define _mp make_pair
#define ii pair<int, int>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define evoid(val) return void(std::cout << val)
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FOD(i, b, a) for(int i = (b); i >= (a); --i)
#define unq(x) sort(all(x)); x.resize(unique(all(x)) - x.begin())

using namespace std;

template<typename U, typename V> bool maximize(U &a, V b) {
    if (a < b) { a = b; return 1; } return 0;
}
template<typename U, typename V> bool minimize(U &a, V b) {
    if (a > b) { a = b; return 1; } return 0;
}

const int N = (int)2e5 + 9;
const int INF = (int)1e9;
const int MOD = (int)1e9 + 7;

int a[N];
map<int, int> pos;
int maxVal[4 * N], lazy[4 * N];

void down(int id) {
    if (!lazy[id]) return;
    lazy[2 * id] =  lazy[2 * id + 1] = lazy[id];
    maxVal[2 * id] = maxVal[2 * id + 1] = lazy[id];
    lazy[id] = 0;
}

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

int get(int id, int l, int r, int u, int v) {
    if (l > v || r < u) return -INF;
    if (l >= u && r <= v) return maxVal[id];
    int mid = (l + r) >> 1;
    down(id);
    return max(get(2 * id, l, mid, u, v), get(2 * id + 1, mid + 1, r, u, v));
}

void main_code() {
    int n;
    cin >> n;
    FOR(i, 1, n) {
        cin >> a[i];
        if (pos[a[i]] != 0) {
            int p = pos[a[i]];
            if (get(1, 1, n, p, p) == a[i]) update(1, 1, n, p, i, a[i]);
        }
        update(1, 1, n, i, i, a[i]);
        pos[a[i]] = i;
    }
    FOR(i, 1, n) cout << get(1, 1, n, i, i) << " ";
}

int main() {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    if (fopen(task".inp", "r")) {
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    const bool MULTITEST = 0;
    int num_test = 1; if (MULTITEST) cin >> num_test;
    while (num_test--) { main_code(); cout << "\n"; }
}

/* Lak lu theo dieu nhac */

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

Main.cpp: In function 'int main()':
Main.cpp:83:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   83 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:84:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   84 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

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