답안 #39494

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
39494 2018-01-16T02:46:57 Z funcsr Nuclearia (CEOI15_nuclearia) C++14
21 / 100
1000 ms 138752 KB
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
#include <cassert>
using namespace std;
#define rep(i, n) for (int i=0; i<(n); i++)
#define pb push_back
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
inline int abs(int x) {
  if (x < 0) return -x;
  return x;
}

int W, H, N, Q;
vector<long long> A[2500000];

int main() {
  scanf("%d %d %d", &W, &H, &N);
  assert(W*H*N <= 1e8);
  //cout<<"W="<<W<<",H="<<H<<", N="<<N<<"\n";
  rep(x, W) A[x].resize(H, 0);
  rep(i, N) {
    int x, y, a, b;
    scanf("%d %d %d %d", &x, &y, &a, &b);
    x--, y--;
    rep(xx, W) rep(yy, H) {
      int dist = max(abs(xx-x), abs(y-yy));
      A[xx][yy] += max(0LL, a-1LL*b*dist);
    }
  }
  /*
  rep(y, H) {
    rep(x, W) cout << A[x][y] << " ";
    cout << "\n";
  }
  */
  rep(y, H) rep(x, W-1) A[x+1][y] += A[x][y];
  rep(y, H-1) rep(x, W) A[x][y+1] += A[x][y];
  scanf("%d", &Q);
  rep(i, Q) {
    int x1, y1, x2, y2;
    scanf("%d %d %d %d", &x1, &y1, &x2, &y2);
    x1--, y1--, x2--, y2--;
    long long s = A[x2][y2];
    if (x1 > 0) s -= A[x1-1][y2];
    if (y1 > 0) s -= A[x2][y1-1];
    if (x1 > 0 && y1 > 0) s += A[x1-1][y1-1];
    long long q = 1LL*(x2-x1+1)*(y2-y1+1);
    //cout<<s<<"/"<<q<<"\n";
    printf("%lld\n", ((2LL*s/q)+1)/2);
  }
  return 0;
}

Compilation message

nuclearia.cpp: In function 'int main()':
nuclearia.cpp:20:32: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d", &W, &H, &N);
                                ^
nuclearia.cpp:26:41: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d %d", &x, &y, &a, &b);
                                         ^
nuclearia.cpp:41:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &Q);
                  ^
nuclearia.cpp:44:45: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d %d", &x1, &y1, &x2, &y2);
                                             ^
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1000 ms 138752 KB Execution timed out
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1000 ms 138752 KB Execution timed out
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 416 ms 80276 KB Output is correct
2 Correct 123 ms 60608 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 329 ms 80208 KB Output is correct
2 Correct 113 ms 60608 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 666 ms 138752 KB Output is correct
2 Correct 129 ms 60608 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1000 ms 91892 KB Execution timed out
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 483 ms 80144 KB Output is correct
2 Correct 149 ms 60608 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 776 ms 76184 KB Output is correct
2 Correct 143 ms 60608 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Runtime error 0 ms 60612 KB Execution killed because of forbidden syscall gettid (186)
# 결과 실행 시간 메모리 Grader output
1 Runtime error 6 ms 60612 KB Execution killed because of forbidden syscall gettid (186)
# 결과 실행 시간 메모리 Grader output
1 Runtime error 6 ms 60612 KB Execution killed because of forbidden syscall gettid (186)
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Runtime error 19 ms 60612 KB Execution killed because of forbidden syscall gettid (186)
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Runtime error 13 ms 60612 KB Execution killed because of forbidden syscall gettid (186)
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Runtime error 6 ms 60612 KB Execution killed because of forbidden syscall gettid (186)
2 Halted 0 ms 0 KB -