Submission #1204686

#TimeUsernameProblemLanguageResultExecution timeMemory
1204686loomRMQ (NOI17_rmq)C++20
0 / 100
0 ms328 KiB
#include<bits/stdc++.h> using namespace std; #define int long long #define inf 5e18 #define nl '\n' int lg2(int x){ int p = 0; while((1ll<<(p+1)) <= x) p++; return p; } inline void solve(){ int n, q; cin>>n>>q; vector<int> l[n], r[n]; vector<tuple<int,int,int>> qry; while(q--){ int li, ri, x; cin>>li>>ri>>x; qry.push_back({li, ri, x}); l[li].push_back(x); r[ri].push_back(x); } multiset<int> st; int ans[n]; for(int i=0; i<n; i++){ for(int x : l[i]) st.insert(x); ans[i] = (st.empty() ? 0 : *st.rbegin()); for(int x : r[i]) st.erase(st.find(x)); } for(int i=0; i<n; i++) cout<<ans[i]<<" "; } signed main(){ ios_base::sync_with_stdio(0); cin.tie(NULL);cout.tie(NULL); int t = 1; //cin>>t; while(t--) solve(); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...