Submission #941694

#TimeUsernameProblemLanguageResultExecution timeMemory
941694BaizhoHedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++14
100 / 100
1176 ms105868 KiB
#include <bits/stdc++.h> using namespace std; #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; #define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update> // #pragma GCC optimize("Ofast,unroll-loops,fast-math") // #pragma GCC target("popcnt,sse3,avx") typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef pair<ll,ll> pll; #define sz size() #define ff first #define ss second #define all(a) a.begin(),a.end() #define pb push_back const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6 const ll MOD = 998244353; // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod const int N = ll(1e6)+100; const int M = ll(2e5) + 100; const long long inf = 5e18; //const long double eps = 1e-15L; ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; } ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;} void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); } int n, m, w[N], t[N * 4], ql[N], qr[N], qk[N], ans[N]; vector<int> qu[N]; void update(int v, int tl, int tr, int p, int x) { if(tl == tr) { t[v] = max(t[v], x); return; } int tm = (tl + tr) / 2; if(p <= tm) update(v + v, tl, tm, p, x); else update(v + v + 1, tm + 1, tr, p, x); t[v] = max(t[v + v], t[v + v + 1]); } int get(int v, int tl, int tr, int l, int r) { if(tl > r || l > tr) return 0; if(l <= tl && tr <= r) return t[v]; int tm = (tl + tr) / 2; return max(get(v + v, tl, tm, l, r), get(v + v + 1, tm + 1, tr, l, r)); } void Baizho() { cin>>n>>m; for(int i = 1; i <= n; i ++) cin>>w[i]; for(int i = 1; i <= m; i ++) { cin>>ql[i]>>qr[i]>>qk[i]; qu[qr[i]].pb(i); } vector<int> vec; for(int i = 1; i <= n; i ++) { while(!vec.empty() && w[vec.back()] <= w[i]) vec.pop_back(); if(!vec.empty()) update(1, 1, n, vec.back(), w[vec.back()] + w[i]); for(auto j : qu[i]) { if(get(1, 1, n, ql[j], qr[j]) <= qk[j]) ans[j] = 1; } vec.pb(i); } for(int i = 1; i <= m; i ++) cout<<ans[i]<<"\n"; } signed main() { // Freopen("nondec"); ios_base::sync_with_stdio(false); cin.tie(0);cout.tie(0); // precalc(); int ttt = 1; // cin>>ttt; for(int i=1; i<=ttt; i++) {Baizho(); } }

Compilation message (stderr)

sortbooks.cpp: In function 'void Freopen(std::string)':
sortbooks.cpp:35:34: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sortbooks.cpp:35:76: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                                                                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...