Submission #1251544

#TimeUsernameProblemLanguageResultExecution timeMemory
1251544NoLoveHedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++20
17 / 100
3091 ms8276 KiB
/** * author : Lăng Trọng Đạt * created: 03-08-2025 **/ #include <bits/stdc++.h> using namespace std; #ifndef LANG_DAT #define db(...) ; #endif // LANG_DAT #define int long long #define f first #define se second #define pb push_back #define all(v) (v).begin(), (v).end() #define FOR(i, a, b) for (int i = (a); (i) <= (b); (i++)) #define FD(i, lo, up) for (int i = (up); (i) >= (lo); i--) #define si(x) (int)(x.size()) bool mx(int& a, int b) { if (b > a) {a = b; return true;} return false;} bool mi(int& a, int b) { if (b < a) {a = b; return true;} return false;} using pii = pair<int, int>; using vi = vector<int>; const int INF = 1e18 + 5; const int MOD = 1e9 + 7; const int N = 1e6 + 5; int g[N]; int n, m, k, q, a, b, c; int32_t main() { cin.tie(0)->sync_with_stdio(0); if (fopen("hi.inp", "r")) { freopen("hi.inp", "r", stdin); // freopen("hi.out", "w", stdout); } cin >> n >> q; FOR(i, 1, n) { cin >> g[i]; } FOR(i, 1, q) { cin >> a >> b >> k; int prv = g[a]; bool ans = true; FOR(i, a + 1, b) { if (g[i] < prv && g[i] + prv > k) ans = false; mx(prv, g[i]); } cout << ans << "\n"; } }

Compilation message (stderr)

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