#1178884 (C++23) No.3675 偏光板

• 問題: No.3675 偏光板
• ユーザー: TKTYI
• 提出日時: 2026-08-25 12:55:49
• 言語: C++23 (gcc 15.3.0 + boost 1.92.0)
• 結果: TLE
• 実行時間: -
• コード長: 4,866 bytes
• コンパイル時間: 4,591 ms
• コンパイル使用メモリ: 390,740 KB
• 実行使用メモリ: 6,400 KB
• 最終ジャッジ日時: 2026-09-04 22:49:16
• 合計ジャッジ時間: 9,050 ms
• ジャッジサーバーID （参考情報）: judge3_0 / judge4_0

ファイルパターン	結果
sample	AC * 6
other	AC * 4 TLE * 1 -- * 49

ソースコード

#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<vvvl> vvvvl;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef pair<ll,ll> pl;
typedef pair<ll,pl> ppl;
typedef pair<ll,ppl> pppl;
typedef pair<ll,pppl> pppppl;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(a) begin(a),end(a)
#define sz(a) (int)(a).size()
#define F first
#define S second
#define bs(A,x) binary_search(all(A),x)
#define lb(A,x) (ll)(lower_bound(all(A),x)-A.begin())
#define ub(A,x) (ll)(upper_bound(all(A),x)-A.begin())
#define cou(A,x) (ll)(upper_bound(all(A),x)-lower_bound(all(A),x))
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
//*
using mint=modint998244353;
const ll mod=998244353;
//*/
/*
using mint=modint1000000007;
const ll mod=1000000007;
//*/
//using mint=modint;
//*
typedef vector<mint> vm;
typedef vector<vm> vvm;
typedef vector<vvm> vvvm;
typedef vector<vvvm> vvvvm;
ostream&operator<<(ostream&os,mint a){os<<a.val();return os;}
istream&operator>>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;}
//*/
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>v){rep(i,0,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
ld f(ll X,ll Y,vl x,vl y,vl r){
  {
    // 包含
    vl _x,_y,_r;
    rep(i,0,sz(x)){
      bool ok=1;
      rep(j,0,sz(_x)){
        ll d=(x[i]-_x[j])*(x[i]-_x[j])+(y[i]-_y[j])*(y[i]-_y[j]);
        if(d<=(r[i]-_r[j])*(r[i]-_r[j])){
          if(_r[j]>=r[i]){ok=0;break;}
          else _x.erase(_x.begin()+j),_y.erase(_y.begin()+j),_r.erase(_r.begin()+j),j--;
        }
      }
      if(ok)_x.emplace_back(x[i]),_y.emplace_back(y[i]),_r.emplace_back(r[i]);
    }
    x=_x;y=_y;r=_r;
  }
  ll N=sz(x);
  ld ans=0;
  const ld PI=acosl(-1);
  {
    // y=Y
    vector<ld>B;
    rep(i,0,N)if(abs(Y-y[i])<r[i]){
      ld d=sqrtl(r[i]*r[i]-(Y-y[i])*(Y-y[i]));
      B.emplace_back(x[i]+d);
      B.emplace_back(x[i]-d);
    }
    sort(all(B));
    rep(i,0,sz(B))if(i%2==0){
      ld l=B[i],r=B[i+1];
      chmax(l,(ld)0);
      chmin(r,(ld)X);
      if(l<r)ans+=(r-l)*Y;
    }
  }
  rep(i,0,N)if(x[i]+r[i]>0&&y[i]+r[i]>0&&x[i]-r[i]<X&&y[i]-r[i]<Y){
    vector<pair<ld,ld>>seg;
    // 除く方
    if(abs(y[i])<r[i]){
      ld d=sqrtl(r[i]*r[i]-y[i]*y[i]);
      seg.emplace_back(atan2l(-y[i],-d),atan2l(-y[i],d));
    }
    if(abs(Y-y[i])<r[i]){
      ld d=sqrtl(r[i]*r[i]-(Y-y[i])*(Y-y[i]));
      seg.emplace_back(atan2l(Y-y[i],d),atan2l(Y-y[i],-d));
    }
    if(abs(x[i])<r[i]){
      ld d=sqrtl(r[i]*r[i]-x[i]*x[i]);
      seg.emplace_back(atan2l(d,-x[i]),atan2l(-d,-x[i]));
    }
    if(abs(X-x[i])<r[i]){
      ld d=sqrtl(r[i]*r[i]-(X-x[i])*(X-x[i]));
      seg.emplace_back(atan2l(-d,X-x[i]),atan2l(d,X-x[i]));
    }
    rep(j,0,N)if(i!=j&&(x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j])<(r[i]+r[j])*(r[i]+r[j])){
      ld d=sqrtl((x[j]-x[i])*(x[j]-x[i])+(y[j]-y[i])*(y[j]-y[i]));
      ld theta=acosl((r[i]*r[i]-r[j]*r[j]+d*d)/2/d/r[i]);
      ld o=atan2l(y[j]-y[i],x[j]-x[i]);
      seg.emplace_back(o-theta,o+theta);
    }
    // cout<<seg<<endl;
    rep(i,0,sz(seg)){
      while(seg[i].F<-PI)seg[i].F+=2*PI;
      while(seg[i].F>PI)seg[i].F-=2*PI;
      while(seg[i].S<-PI)seg[i].S+=2*PI;
      while(seg[i].S>PI)seg[i].S-=2*PI;
      if(seg[i].F>seg[i].S){
        seg.emplace_back(-PI,seg[i].S);
        seg[i].S=PI;
      }
    }
    sort(all(seg));
    // cout<<"before "<<i<<" ; "<<ans<<endl;
    // cout<<seg<<endl;
    ans+=PI*r[i]*r[i];
    rep(j,0,sz(seg)){
      ld L=seg[j].F,R=seg[j].S;
      while(j<sz(seg)&&seg[j].F<R)chmax(R,seg[j++].S);
      // cout<<"remove ; "<<L<<","<<R<<endl;
      ans+=r[i]*y[i]*(cosl(R)-cosl(L));
      ans-=r[i]*r[i]*((R-L)/2-(sinl(2*R)-sinl(2*L))/4);
      j--;
    }
    // cout<<"after "<<i<<" ; "<<ans<<endl;
  }
  return ans;
}
int main(){
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
  ll X,Y,N;cin>>X>>Y>>N;
  vvl x(2),y(2),r(2);
  rep(i,0,N){
    ll a,b,c;char d;cin>>a>>b>>c>>d;
    x[d=='V'].emplace_back(a);
    y[d=='V'].emplace_back(b);
    r[d=='V'].emplace_back(c);
  }
  ld ans=X*Y;
  rep(i,0,2)ans-=f(X,Y,x[i],y[i],r[i])/2;
  printf("%.20Lf\n",ans);
  return 0;
}