Submission #224122

#TimeUsernameProblemLanguageResultExecution timeMemory
224122shenxyFire (JOI20_ho_t5)C++11
0 / 100
230 ms19760 KiB
#include <cstdio> #include <algorithm> #include <vector> #include <map> using namespace std; struct seg { int s, e, m, v; seg *l, *r; seg(int _s, int _e) { s = _s, e = _e, m = (s + e) / 2, v = 0; if (s != e) { l = new seg(s, m); r = new seg(m + 1, e); } } void update(int i, int nv) { if (s != e) { if (i > m) r -> update(i, nv); else l -> update(i, nv); v = max(l -> v, r -> v); } else v = nv; } int query(int a, int b) { if (s == a && e == b) return v; if (a > m) return r -> query(a, b); if (b <= m) return l -> query(a, b); return max(l -> query(a, m), r -> query(m + 1, b)); } } *root; int main() { int N, Q; scanf("%d %d", &N, &Q); long long S[N]; int T[Q], L[Q], R[Q]; for (int i = 0; i < N; ++i) scanf("%lld", &S[i]); map<int, vector<int> > queries; for (int i = 0; i < Q; ++i) scanf("%d %d %d", &T[i], &L[i], &R[i]); for (int i = 0; i < Q; ++i) queries[T[i]].push_back(i); if (queries.size() == 1) { } else if (*max_element(S, S + N) <= 2) { } else { root = new seg(0, N - 1); for (int i = 0; i < N; ++i) root -> update(i, S[i]); for (int i = 0; i < Q; ++i) { long long ans = 0; for (int j = L[i] - 1; j < R[i]; ++j) ans += root -> query(max(0, j - T[i]), j); printf("%lld\n", ans); } } }

Compilation message (stderr)

ho_t5.cpp: In function 'int main()':
ho_t5.cpp:32:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &N, &Q);
  ~~~~~^~~~~~~~~~~~~~~~~
ho_t5.cpp:35:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (int i = 0; i < N; ++i) scanf("%lld", &S[i]);
                              ~~~~~^~~~~~~~~~~~~~~
ho_t5.cpp:37:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (int i = 0; i < Q; ++i) scanf("%d %d %d", &T[i], &L[i], &R[i]);
                              ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#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...