제출 #511469

#제출 시각아이디문제언어결과실행 시간메모리
511469Zhora_004Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++17
17 / 100
3062 ms4680 KiB
#define _CRT_SECURE_NO_WARNINGS #include <iostream> #include <cmath> #include <algorithm> #include <vector> #include <set> #include <unordered_set> #include <queue> #include <deque> #include <string> #include <sstream> #include <iomanip> #include <map> #include <unordered_map> #include <stack> #include <cstdio> #include <climits> #include <tuple> #include <ctime> #include <cstring> #include <numeric> #include <functional> #include <chrono> #include <cassert> #include <bitset> //#include <bit> //#include <ranges> //#include <numbers> #define itn int #define sacnf scanf #define sz(a) ((int)((a).size())) // printf("%.10f\n", ans); using ll = long long; using namespace std; const ll mod = 1e9 + 7; const int N = 1e6 + 5; int main() { /*ios_base::sync_with_stdio(false); cin.tie(NULL);*/ int n, m; scanf("%d%d", &n, &m); vector<int> v(n); for (int i = 0; i < n; i++) scanf("%d", &v[i]); for (int i = 0; i < m; i++) { int l, r, k; scanf("%d%d%d", &l, &r, &k); l--, r--; int mx_num = 0, mx = 0; for (int j = l; j <= r; j++) { if (mx_num > v[j]) mx = max(mx, v[j] + mx_num); mx_num = max(mx_num, v[j]); } if (mx <= k) printf("1\n"); else printf("0\n"); } return 0; } // https://codeforces.com/problemset/problem/1136/D?locale=ru

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

sortbooks.cpp: In function 'int main()':
sortbooks.cpp:45:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |     scanf("%d%d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~
sortbooks.cpp:47:38: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |     for (int i = 0; i < n; i++) scanf("%d", &v[i]);
      |                                 ~~~~~^~~~~~~~~~~~~
sortbooks.cpp:51:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |         scanf("%d%d%d", &l, &r, &k);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~
#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...