Submission #597150

#	Time	Username	Problem	Language	Result	Execution time	Memory
597150		Soul234	RMQ (NOI17_rmq)	C++14	100 / 100	63 ms	9816 KiB

rmq

#include<bits/stdc++.h>
using namespace std;

void DBG() { cerr << "]\n"; }
template<class H, class... T> void DBG(H h, T... t) {
    cerr << h; if(sizeof...(t)) cerr << ", ";
    DBG(t...);
}
#ifdef LOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif // LOCAL

#define FOR(i,a,b) for(int i = (a) ; i<(b) ; i++)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for(int i = (b)-1 ; i>=(a) ; i--)
#define R0F(i,a) ROF(i,0,a)
#define each(e,a) for(auto &e : (a))
#define sz(v) (int)(v).size()
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pb push_back
#define tcT template<class T
#define nl "\n"

using ll = long long;
using vi = vector<int>;
using pi = pair<int,int>;
using str = string;
tcT> using V = vector<T>;
tcT> using pqg = priority_queue<T,vector<T>,greater<T>>;

void setIO(string NAME = "") {
    cin.tie(0)->sync_with_stdio(0);
    if(sz(NAME)) {
        freopen((NAME + ".inp").c_str(),"r",stdin);
        freopen((NAME + ".out").c_str(),"w",stdout);
    }
}

tcT> bool ckmin(T&a, const T&b) {
    return b < a ? a=b,1 : 0; }
tcT> bool ckmax(T&a, const T&b) {
    return b > a ? a=b,1 : 0; }

const int MOD = 1e9 + 7;

struct SegTree {
    int N;
    V<int> seg;
    void init(int _N) { N = _N; seg.assign(2*N, 0); }
    void upd(int l, int r, int val) {
        for(l += N, r += N+1; l<r; l>>=1, r>>=1) {
            if(l&1) ckmax(seg[l++], val);
            if(r&1) ckmax(seg[--r], val);
        }
    }
    int qry(int p) {
        int res = seg[p+=N];
        for(p>>=1; p>0; p>>=1) ckmax(res, seg[p]);
        return res;
    }
};

const int MX = 1e5+5;
int N, Q;
SegTree st;
vi pos[MX];
int L[MX], R[MX], ans[MX];

void solve() {
    cin>>N>>Q;
    st.init(N);
    F0R(i,N) R[i] = N-1;
    F0R(i,Q) {
        int l, r, val;
        cin>>l>>r>>val;
        ckmax(L[val], l);
        ckmin(R[val], r);
        st.upd(l, r, val);
    }
    F0R(i,N) pos[st.qry(i)].pb(i);
    set<int> inds;
    F0R(i,N) {
        each(idx, pos[i]) inds.insert(idx);
        auto it = inds.lower_bound(L[i]);
        if(it != inds.end() && *it <= R[i]) {
            ans[*it] = i;
            inds.erase(it);
        }
        else {
            F0R(i,N) cout << "-1 ";
            cout << nl;
            return;
        }
    }
    F0R(i,N) cout << ans[i] << " ";
    cout << nl;
}

int main() {
    setIO();

    int t=1;
    //cin>>t;
    while(t-->0) {
        solve();
    }

    return 0;
}

Compilation message (stderr)

rmq.cpp: In function 'void setIO(std::string)':
rmq.cpp:37:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |         freopen((NAME + ".inp").c_str(),"r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
rmq.cpp:38:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |         freopen((NAME + ".out").c_str(),"w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 23 / 23
• Subtask 2: 44 / 44
• Subtask 3: 33 / 33