Submission #130498

#TimeUsernameProblemLanguageResultExecution timeMemory
130498imyujinDominance (CEOI08_dominance)C++14
100 / 100
16 ms552 KiB
#include <stdio.h> #include <algorithm> using namespace std; #define MAXN 3005 typedef long long lint; struct QUERY { lint y, x1, x2; int z; } que[2 * MAXN]; char C[MAXN]; lint A[MAXN], B[MAXN], R[MAXN]; lint xs[2 * MAXN], s[2 * MAXN]; int main() { int W, H, N; scanf("%d%d%d", &W, &H, &N); for(int i = 0; i < N; i++) scanf("\n%c%lld%lld%lld", C + i, A + i, B + i, R + i); for(int i = 0; i < N; i++) { xs[i * 2] = A[i] + B[i] - R[i]; xs[i * 2 + 1] = A[i] + B[i] + R[i] + 1; que[i * 2] = (QUERY) { A[i] - B[i] - R[i], xs[i * 2], xs[i * 2 + 1], C[i] == 'W' ? 1 : -1 }; que[i * 2 + 1] = (QUERY) { A[i] - B[i] + R[i] + 1, xs[i * 2], xs[i * 2 + 1], C[i] == 'W' ? -1 : 1 }; } sort(xs, xs + 2 * N); int xn = unique(xs, xs + 2 * N) - xs; sort(que, que + 2 * N, [&](QUERY a, QUERY b) { return a.y < b.y; } ); //for(int i = 0; i < 2 * N; i++) printf("que[%d] = { y = %lld, x1 = %lld, x2 = %lld, z = %d }\n", i, que[i].y, que[i].x1, que[i].x2, que[i].z); lint ansp = 0ll, ansm = 0ll; for(int i = 0; i < 2 * N - 1; i++) { int xidx1 = lower_bound(xs, xs + xn, que[i].x1) - xs; int xidx2 = lower_bound(xs, xs + xn, que[i].x2) - xs; for(int j = xidx1; j < xidx2; j++) s[j] += que[i].z; for(int j = 0; j < xn - 1; j++) { if(s[j] > 0) { ansp += (xs[j + 1] - xs[j]) * (que[i + 1].y - que[i].y) / 2; if((xs[j + 1] - xs[j]) % 2 != 0 && (que[i + 1].y - que[i].y) % 2 != 0 && (xs[j] - que[i].y) % 2 == 0) ansp++; } if(s[j] < 0) { ansm += (xs[j + 1] - xs[j]) * (que[i + 1].y - que[i].y) / 2; if((xs[j + 1] - xs[j]) % 2 != 0 && (que[i + 1].y - que[i].y) % 2 != 0 && (xs[j] - que[i].y) % 2 == 0) ansm++; } } } printf("%lld %lld", ansp, ansm); return 0; }

Compilation message (stderr)

dominance.cpp: In function 'int main()':
dominance.cpp:22:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d", &W, &H, &N);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~
dominance.cpp:23:34: 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("\n%c%lld%lld%lld", C + i, A + i, B + i, R + i);
                             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...