제출 #330609

#제출 시각아이디문제언어결과실행 시간메모리
330609rqiHedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++14
100 / 100
2594 ms136744 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; typedef double db; typedef string str; typedef pair<int,int> pi; typedef pair<ll,ll> pl; typedef pair<db,db> pd; typedef vector<int> vi; typedef vector<bool> vb; typedef vector<ll> vl; typedef vector<db> vd; typedef vector<str> vs; typedef vector<pi> vpi; typedef vector<pl> vpl; typedef vector<pd> vpd; #define mp make_pair #define f first #define s second #define sz(x) (int)(x).size() #define all(x) begin(x), end(x) #define rall(x) (x).rbegin(), (x).rend() #define sor(x) sort(all(x)) #define rsz resize #define ins insert #define ft front() #define bk back() #define pf push_front #define pb push_back #define eb emplace_back #define lb lower_bound #define ub upper_bound #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 trav(a,x) for (auto& a: x) const int MOD = 1e9+7; // 998244353; const int MX = 2e5+5; const ll INF = 1e18; const ld PI = acos((ld)-1); const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; } template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } constexpr int pct(int x) { return __builtin_popcount(x); } constexpr int bits(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down ll half(ll x) { return fdiv(x,2); } template<class T, class U> T fstTrue(T lo, T hi, U f) { // note: if (lo+hi)/2 is used instead of half(lo+hi) then this will loop infinitely when lo=hi hi ++; assert(lo <= hi); // assuming f is increasing while (lo < hi) { // find first index such that f is true T mid = half(lo+hi); f(mid) ? hi = mid : lo = mid+1; } return lo; } template<class T, class U> T lstTrue(T lo, T hi, U f) { lo --; assert(lo <= hi); // assuming f is decreasing while (lo < hi) { // find first index such that f is true T mid = half(lo+hi+1); f(mid) ? lo = mid : hi = mid-1; } return lo; } template<class T> void remDup(vector<T>& v) { sort(all(v)); v.erase(unique(all(v)),end(v)); } // INPUT template<class A> void re(complex<A>& c); template<class A, class B> void re(pair<A,B>& p); template<class A> void re(vector<A>& v); template<class A, size_t SZ> void re(array<A,SZ>& a); template<class T> void re(T& x) { cin >> x; } void re(db& d) { str t; re(t); d = stod(t); } void re(ld& d) { str t; re(t); d = stold(t); } template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); } template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; } template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); } template<class A> void re(vector<A>& x) { trav(a,x) re(a); } template<class A, size_t SZ> void re(array<A,SZ>& x) { trav(a,x) re(a); } // TO_STRING #define ts to_string str ts(char c) { return str(1,c); } str ts(const char* s) { return (str)s; } str ts(str s) { return s; } str ts(bool b) { #ifdef LOCAL return b ? "true" : "false"; #else return ts((int)b); #endif } template<class A> str ts(complex<A> c) { stringstream ss; ss << c; return ss.str(); } str ts(vector<bool> v) { str res = "{"; F0R(i,sz(v)) res += char('0'+v[i]); res += "}"; return res; } template<size_t SZ> str ts(bitset<SZ> b) { str res = ""; F0R(i,SZ) res += char('0'+b[i]); return res; } template<class A, class B> str ts(pair<A,B> p); template<class T> str ts(T v) { // containers with begin(), end() #ifdef LOCAL bool fst = 1; str res = "{"; for (const auto& x: v) { if (!fst) res += ", "; fst = 0; res += ts(x); } res += "}"; return res; #else bool fst = 1; str res = ""; for (const auto& x: v) { if (!fst) res += " "; fst = 0; res += ts(x); } return res; #endif } template<class A, class B> str ts(pair<A,B> p) { #ifdef LOCAL return "("+ts(p.f)+", "+ts(p.s)+")"; #else return ts(p.f)+" "+ts(p.s); #endif } // OUTPUT template<class A> void pr(A x) { cout << ts(x); } template<class H, class... T> void pr(const H& h, const T&... t) { pr(h); pr(t...); } void ps() { pr("\n"); } // print w/ spaces template<class H, class... T> void ps(const H& h, const T&... t) { pr(h); if (sizeof...(t)) pr(" "); ps(t...); } // DEBUG void DBG() { cerr << "]" << endl; } template<class H, class... T> void DBG(H h, T... t) { cerr << ts(h); if (sizeof...(t)) cerr << ", "; DBG(t...); } #ifdef LOCAL // compile with -DLOCAL, chk -> fake assert #define dbg(...) cerr << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__) #define chk(...) if (!(__VA_ARGS__)) cerr << "Line(" << __LINE__ << ") -> function(" \ << __FUNCTION__ << ") -> CHK FAILED: (" << #__VA_ARGS__ << ")" << "\n", exit(0); #else #define dbg(...) 0 #define chk(...) 0 #endif // FILE I/O void setIn(str s) { freopen(s.c_str(),"r",stdin); } void setOut(str s) { freopen(s.c_str(),"w",stdout); } void unsyncIO() { cin.tie(0)->sync_with_stdio(0); } void setIO(str s = "") { unsyncIO(); // cin.exceptions(cin.failbit); // throws exception when do smth illegal // ex. try to read letter into int if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO } const int SZ = 1048576; int N, M; int w[SZ]; int l[SZ]; int r[SZ]; int k[SZ]; int ans[SZ]; //maximum difference vi queries[2*SZ]; //indices of queries int fanses[SZ]; //prefix and suffix anses int maxes[SZ]; //sufix maxes //vpi sortq; vi emp; vpi allvals, qvals; void search(int ind, int L = 0, int R = SZ-1){ if(L == R) return; if(sz(queries[ind]) == 0) return; int M = (L+R)/2; while(sz(queries[ind])){ int u = queries[ind].bk; queries[ind].pop_back(); if(r[u] <= M){ queries[2*ind].pb(u); } else if(l[u] >= M+1){ queries[2*ind+1].pb(u); } else{ emp.pb(u); } } queries[ind].clear(); swap(queries[ind], emp); for(int i = M; i >= L; i--){ fanses[i] = 0; } //set<int> vals; for(int i = L; i <= M; i++){ allvals.pb(mp(w[i], i)); qvals.pb(mp(w[i], i)); } sort(all(allvals)); sort(all(qvals)); vi bvals; //decreasing indices with increasing value int curind = 0; for(auto u: qvals){ while(curind < sz(allvals)){ if(allvals[curind].f >= u.f){ break; } while(sz(bvals)){ if(bvals.bk > allvals[curind].s) break; bvals.pop_back(); } bvals.pb(allvals[curind].s); curind++; } if(sz(bvals) != 0 && bvals[0] >= u.s){ int lo = 0; int hi = sz(bvals)-1; while(lo < hi){ int mid = (lo+hi)/2+1; if(u.s <= bvals[mid]){ lo = mid; } else hi = mid-1; } ckmax(fanses[u.s], u.f+w[bvals[lo]]); } } allvals.clear(); qvals.clear(); bvals.clear(); for(int i = M-1; i >= L; i--){ ckmax(fanses[i], fanses[i+1]); } int curmax = 0; for(int i = M+1; i <= R; i++){ if(i > M+1){ fanses[i] = fanses[i-1]; } else{ fanses[i] = 0; } if(curmax > w[i]){ ckmax(fanses[i], curmax+w[i]); } ckmax(curmax, w[i]); } curmax = 0; for(int i = M; i >= L; i--){ if(i < M){ maxes[i] = maxes[i+1]; } else{ maxes[i] = 0; } ckmax(maxes[i], w[i]); } // int curR = M; // for(auto x: sortq){ // int u = x.s; // while(curR < r[u]){ // curR++; // vals.ins(w[curR]); // } // ckmax(ans[u], fanses[l[u]]); // ckmax(ans[u], fanses[r[u]]); // auto it = vals.lb(maxes[l[u]]); // if(it != vals.begin()){ // int y = *(prev(it)); // ckmax(ans[u], maxes[l[u]]+y); // } // } for(auto u: queries[ind]){ ckmax(ans[u], fanses[l[u]]); ckmax(ans[u], fanses[r[u]]); qvals.pb(mp(maxes[l[u]], u)); } for(int i = M+1; i <= R; i++){ allvals.pb(mp(w[i], i)); } sort(all(allvals)); sort(all(qvals)); curind = 0; for(auto u: qvals){ //dbg(u, L, R); while(curind < sz(allvals)){ if(allvals[curind].f >= u.f){ break; } while(sz(bvals)){ if(bvals.bk < allvals[curind].s) break; bvals.pop_back(); } bvals.pb(allvals[curind].s); curind++; } //dbg(bvals); if(sz(bvals) != 0 && bvals[0] <= r[u.s]){ int lo = 0; int hi = sz(bvals)-1; while(lo < hi){ int mid = (lo+hi)/2+1; if(r[u.s] >= bvals[mid]){ lo = mid; } else hi = mid-1; } ckmax(ans[u.s], u.f+w[bvals[lo]]); } } allvals.clear(); qvals.clear(); bvals.clear(); search(2*ind, L, M); search(2*ind+1, M+1, R); } int main() { setIO(); cin >> N >> M; for(int i = 1; i <= N; i++){ cin >> w[i]; } for(int i = 1; i <= M; i++){ cin >> l[i] >> r[i] >> k[i]; } for(int i = 1; i <= M; i++){ queries[1].pb(i); } search(1); for(int i = 1; i <= M; i++){ // ps(ans[i]); if(ans[i] > k[i]){ ps(0); } else{ ps(1); } } // you should actually read the stuff at the bottom } /* stuff you should look for * int overflow, array bounds * special cases (n=1?) * do smth instead of nothing and stay organized * WRITE STUFF DOWN */

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

sortbooks.cpp: In function 'void setIn(str)':
sortbooks.cpp:168:28: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  168 | void setIn(str s) { freopen(s.c_str(),"r",stdin); }
      |                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
sortbooks.cpp: In function 'void setOut(str)':
sortbooks.cpp:169:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  169 | void setOut(str s) { freopen(s.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...