結果

問題 No.1074 増殖
ユーザー sak
提出日時 2020-08-18 16:18:29
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
RE  
実行時間 -
コード長 2,327 bytes
コンパイル時間 2,251 ms
コンパイル使用メモリ 200,156 KB
最終ジャッジ日時 2025-01-13 03:12:34
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 2 RE * 10
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (int i=(int)from; i<(int)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (int i=(int)N-1; i>=0; i--)
const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;
vector<ll> fac;
void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; }
ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; }
ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; }
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }
struct rectangle { ll x1, y1, x2, y2; };
struct coord { ll x, y; };
vector<coord> c;
ll MA = 150;
vector<ll> result;
void solve(ll N) {
  ll ypos[MA*MA] = {}, ysq[MA] = {};
  rep(i,N) {
    for (ll np=0; (np+1)*MA<=c[i].x; np++) {
      if (ysq[np]<c[i].y) {
        if (np==0||ysq[np-1]>=c[i].y) {
          rep(j,MA) {
            ypos[np*MA+j] = max(ypos[np*MA+j], ysq[np]);
            if (ypos[np*MA+j]<c[i].y) {
              result[i] += c[i].y - ypos[np*MA+j];
              ypos[np*MA+j] = c[i].y;
            }
          }
        }
        else result[i] += c[i].y-ysq[np];
      }
    }
    for (ll np=0; (np+1)*MA<=c[i].x; np++) ysq[np] = max(ysq[np],c[i].y);
    rep(j,c[i].x%MA) {
      ll np = c[i].x/MA*MA;
      if (ypos[np*MA+j]<c[i].y) {
        result[i] += c[i].y - ypos[np*MA+j];
        ypos[np*MA+j] = c[i].y;
      }
    }
  }
}
int main() {
  ll N; cin >> N;
  rectangle rect[N]; rep(i,N) cin >> rect[i].x1 >> rect[i].y1 >> rect[i].x2 >> rect[i].y2;
  c.resize(N); result.resize(N);
  rep(i,N) { c[i].x =    rect[i].x2; c[i].y =    rect[i].y2; } solve(N);
  rep(i,N) { c[i].x = -1*rect[i].x1; c[i].y =    rect[i].y2; } solve(N);
  rep(i,N) { c[i].x =    rect[i].x2; c[i].y = -1*rect[i].y1; } solve(N);
  rep(i,N) { c[i].x = -1*rect[i].x1; c[i].y = -1*rect[i].y1; } solve(N);
  // rep(i,4) debug(all(sum[i]));
  rep(i,N) cout << result[i] << endl;
  return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0