Submission #869796

#TimeUsernameProblemLanguageResultExecution timeMemory
869796rainboySimple (info1cup19_simple)C11
30 / 100
128 ms22008 KiB
#include <stdio.h> #define N 200000 #define N_ (1 << 18) /* N_ = pow2(ceil(log2(N))) */ #define INF 0x3f3f3f3f3f3f3f3fLL long long min(long long a, long long b) { return a < b ? a : b; } long long max(long long a, long long b) { return a > b ? a : b; } long long stmn0[N_ * 2], stmn1[N_ * 2], stmx0[N_ * 2], stmx1[N_ * 2], lz[N_ * 2]; int h_, n_; void put(int i, long long x) { long long tmp; if (stmn0[i] != INF) stmn0[i] += x; if (stmx0[i] != -1) stmx0[i] += x; if (stmn1[i] != INF) stmn1[i] += x; if (stmx1[i] != -1) stmx1[i] += x; if (x % 2 != 0) { tmp = stmn0[i], stmn0[i] = stmn1[i], stmn1[i] = tmp; tmp = stmx0[i], stmx0[i] = stmx1[i], stmx1[i] = tmp; } lz[i] += x; } void pul(int i) { int l = i << 1, r = l | 1; long long tmp; stmn0[i] = min(stmn0[l], stmn0[r]), stmx0[i] = max(stmx0[l], stmx0[r]); stmn1[i] = min(stmn1[l], stmn1[r]), stmx1[i] = max(stmx1[l], stmx1[r]); if (stmn0[i] != INF) stmn0[i] += lz[i]; if (stmx0[i] != -1) stmx0[i] += lz[i]; if (stmn1[i] != INF) stmn1[i] += lz[i]; if (stmx1[i] != -1) stmx1[i] += lz[i]; if (lz[i] % 2 != 0) { tmp = stmn0[i], stmn0[i] = stmn1[i], stmn1[i] = tmp; tmp = stmx0[i], stmx0[i] = stmx1[i], stmx1[i] = tmp; } } void pull(int i) { while (i > 1) pul(i >>= 1); } void build(int *aa, int n) { int i, a; h_ = 0; while (1 << h_ < n) h_++; n_ = 1 << h_; for (i = 0; i < n_; i++) { a = i < n ? aa[i] : 0; if (a % 2 == 0) stmn0[n_ + i] = a, stmx0[n_ + i] = a, stmn1[n_ + i] = INF, stmx1[n_ + i] = -1; else stmn0[n_ + i] = INF, stmx0[n_ + i] = -1, stmn1[n_ + i] = a, stmx1[n_ + i] = a; } for (i = n_ - 1; i > 0; i--) pul(i); } void update(int l, int r, int x) { int l_ = l += n_, r_ = r += n_; for ( ; l <= r; l >>= 1, r >>= 1) { if ((l & 1) == 1) put(l++, x); if ((r & 1) == 0) put(r--, x); } pull(l_), pull(r_); } void query(int l, int r, long long *x, long long *y) { *x = INF, *y = -1; for (l += n_, r += n_; l <= r; l >>= 1, r >>= 1) { if ((l & 1) == 1) *x = min(*x, stmn0[l]), *y = max(*y, stmx1[l]), l++; if ((r & 1) == 0) *x = min(*x, stmn0[r]), *y = max(*y, stmx1[r]), r--; } } int main() { static int aa[N]; int n, q, i; scanf("%d", &n); for (i = 0; i < n; i++) scanf("%d", &aa[i]); build(aa, n); scanf("%d", &q); while (q--) { int t, l, r; long long x, y; scanf("%d%d%d", &t, &l, &r), l--, r--; if (t == 0) { scanf("%lld", &x); update(l, r, x); } else { query(l, r, &x, &y); if (x == INF) x = -1; printf("%lld %lld\n", x, y); } } return 0; }

Compilation message (stderr)

subway.c: In function 'main':
subway.c:99:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   99 |  scanf("%d", &n);
      |  ^~~~~~~~~~~~~~~
subway.c:101:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  101 |   scanf("%d", &aa[i]);
      |   ^~~~~~~~~~~~~~~~~~~
subway.c:103:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  103 |  scanf("%d", &q);
      |  ^~~~~~~~~~~~~~~
subway.c:108:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  108 |   scanf("%d%d%d", &t, &l, &r), l--, r--;
      |   ^~~~~~~~~~~~~~~~~~~~~~~~~~~
subway.c:110:4: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  110 |    scanf("%lld", &x);
      |    ^~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...