제출 #1123106

#제출 시각아이디문제언어결과실행 시간메모리
1123106gdragonHedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++20
17 / 100
1376 ms10160 KiB
#include <bits/stdc++.h> using namespace std; #define TASK "long" #define fi first #define se second #define ll long long #define pb push_back #define ALL(x) (x).begin(), (x).end() #define GETBIT(mask, i) ((mask) >> (i) & 1) #define MASK(i) ((1LL) << (i)) #define SZ(x) ((int)(x).size()) #define mp make_pair #define CNTBIT(mask) __builtin_popcount(mask) template<class X, class Y> bool maximize(X &x, Y y){ if (x < y) {x = y; return true;} return false;}; template<class X, class Y> bool minimize(X &x, Y y){ if (x > y) {x = y; return true;} return false;}; typedef pair<int, int> ii; const int N = 1e6 + 5; const int inf = 1e9 + 7; const long long INF = (long long)1e18 + 7; const int mod = 1e9 + 7; void add(int &x, int y) {x += y; if (x >= mod) x -= mod;} void sub(int &x, int y) {x -= y; if (x < 0) x += mod;} int mul(int x, int y) {return 1LL * x * y % mod;} // -----------------------------------------// struct Fenwick { int n; vector<int> v; Fenwick(int _n = 0) { n = _n; v.assign(n + 2, -1); } void init() { fill(ALL(v), -1); } void update(int x, int c) { for(; x <= n; x += x & -x) v[x] = max(v[x], c); } int getMax(int x) { int ans = -1; for(; x > 0; x -= x & -x) ans = max(ans, v[x]); return ans; } } fw; const int LOG = 20; int n, q; int a[N], f[N][LOG + 1]; int pos[N]; void read() { cin >> n >> q; for(int i = 1; i <= n; i++) cin >> a[i]; } // int getMax(int l, int r) { // if (l > r) return 0; // int k = log2(r - l + 1); // return max(f[l][k], f[r - MASK(k) + 1][k]); // } void sub2() { vector<int> val; for(int i = 1; i <= n; i++) val.push_back(a[i]); sort(ALL(val)); val.erase(unique(ALL(val)), val.end()); for(int i = 1; i <= n; i++) pos[i] = lower_bound(ALL(val), a[i]) - val.begin() + 1; fw = Fenwick(n); while(q--) { fw.init(); int l, r, k; cin >> l >> r >> k; int ans = 0; for(int i = r; i >= l; i--) { int tmp = fw.getMax(pos[i] - 1); if (tmp >= 0) ans = max(ans, a[i] + tmp); fw.update(pos[i], a[i]); } cout << (ans <= k ? 1 : 0) << endl; } } void sub3() { vector<int> pref(n + 2, 0); for(int i = 2; i <= n; i++) { if (a[i] >= a[i - 1]) pref[i] = pref[i - 1] + 1; else pref[i] = 0; } while(q--) { int l, r, k; cin >> l >> r >> k; if (pref[r] == r - l) cout << 0; else cout << 1; cout << endl; } } void solve() { // for(int i = 1; i <= n; i++) f[i][0] = a[i]; // for(int j = 1; j <= LOG; j++) { // for(int i = 1; i + MASK(j) - 1 <= n; i++) f[i][j] = max(f[i][j - 1], f[i + MASK(j - 1)][j - 1]); // } if (max(n, q) <= 5000) { sub2(); return; } sub3(); } signed main() { ios_base::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); } int test = 1; // cin >> test; while(test--) { read(); solve(); } return 0; }

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

sortbooks.cpp: In function 'int main()':
sortbooks.cpp:102:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  102 |         freopen(TASK".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
sortbooks.cpp:103:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  103 |         freopen(TASK".out", "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...