結果
| 問題 | No.1625 三角形の質問 |
| ユーザー |
 t98slider
|
| 提出日時 | 2021-11-23 07:13:35 |
| 言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 8,679 bytes |
| コンパイル時間 | 2,332 ms |
| コンパイル使用メモリ | 194,772 KB |
| 実行使用メモリ | 183,876 KB |
| 最終ジャッジ日時 | 2024-06-25 02:31:57 |
| 合計ジャッジ時間 | 40,860 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge4 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
6,816 KB |
| testcase_01 | WA | - |
| testcase_02 | WA | - |
| testcase_03 | WA | - |
| testcase_04 | WA | - |
| testcase_05 | WA | - |
| testcase_06 | WA | - |
| testcase_07 | WA | - |
| testcase_08 | WA | - |
| testcase_09 | WA | - |
| testcase_10 | WA | - |
| testcase_11 | WA | - |
| testcase_12 | WA | - |
| testcase_13 | WA | - |
| testcase_14 | WA | - |
| testcase_15 | WA | - |
| testcase_16 | AC | 571 ms
131,444 KB |
| testcase_17 | AC | 716 ms
130,920 KB |
| testcase_18 | AC | 1,380 ms
153,084 KB |
| testcase_19 | AC | 880 ms
148,588 KB |
ソースコード
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)
#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(int)(n);k++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yes(ans) if(ans)printf("yes\n");else printf("no\n")
#define Yes(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YES(ans) if(ans)printf("YES\n");else printf("NO\n")
#define popcount(v) __builtin_popcount(v)
#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define vector3d(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))
using namespace std;
using ll = long long;
template<class T> using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
const int MOD=1000000007;
const int MOD2=998244353;
const int INF=1<<30;
const ll INF2=1LL<<60;
void scan(int& a){scanf("%d",&a);}
void scan(long long& a){scanf("%lld",&a);}
template<class T,class L>void scan(pair<T, L>& p){scan(p.first);scan(p.second);}
template<class T,class U,class V>void scan(tuple<T,U,V>& p){scan(get<0>(p));scan(get<1>(p));scan(get<2>(p));}
template<class T, size_t size> void scan(array<T, size>& a){ for(auto&& i : a) scan(i);}
template<class T> void scan(T& a){cin>>a;}
template<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}
void print(const int& a){printf("%d",a);}
void print(const long long& a){printf("%lld",a);}
void print(const double& a){printf("%.15lf",a);}
template<class T,class L>void print(const pair<T, L>& p){print(p.first);putchar(' ');print(p.second);}
template<class T> void print(const T& a){cout<<a;}
template<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}
void out(){putchar('\n');}
template<class T> void out(const T& t){print(t);putchar('\n');}
template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}
template<class T> void dprint(const T& a){cerr<<a;}
template<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<" "<<*it;}}
void debug(){cerr<<endl;}
template<class T> void debug(const T& t){dprint(t);cerr<<endl;}
template <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<" ";debug(tail...);}
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll modinv(ll a, ll m) {ll b = m, u = 1, v = 0;while (b) {ll t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;}
ll updivide(ll a,ll b){return (a+b-1)/b;}
template<class T> void chmax(T &a,const T b){if(b>a)a=b;}
template<class T> void chmin(T &a,const T b){if(b<a)a=b;}
//2次元セグ木
template <class S, S (*op)(S, S), S (*e)(), class C> struct segtree2D_lite {
int H;
std::vector<int> logsize, W;
std::vector<C> Yc, Xc;
std::vector<std::vector<C>> pos;
std::vector<std::pair<C, C> > preorder;
std::vector<std::vector<S>> d;
segtree2D_lite() {}
void insert(C y, C x){
preorder.emplace_back(y, x);
}
void build(){
for(int i = 0; i < int(preorder.size()) ; i++){
Yc.push_back(preorder[i].first);
Xc.push_back(preorder[i].second);
}
std::sort(Yc.begin(), Yc.end()), std::sort(Xc.begin(), Xc.end());
Yc.erase(std::unique(Yc.begin(), Yc.end()), Yc.end());
Xc.erase(std::unique(Xc.begin(), Xc.end()), Xc.end());
H = 1 << ceil_pow2(Yc.size());
pos.resize(2*H), d.resize(2*H);
logsize.resize(2*H), W.resize(2*H);
for(int i = 0; i < int(preorder.size()) ; i++){
int y = std::lower_bound(Yc.begin(), Yc.end(), preorder[i].first) - Yc.begin();
int x = std::lower_bound(Xc.begin(), Xc.end(), preorder[i].second) - Xc.begin();
y += H;
while(y){
pos[y].push_back(x);
y >>= 1;
}
}
for(int y = 0; y < int(pos.size()) ; y++){
std::sort(pos[y].begin(), pos[y].end());
pos[y].erase(std::unique(pos[y].begin(), pos[y].end()), pos[y].end());
logsize[y] = ceil_pow2(pos[y].size());
W[y] = 1 << logsize[y] ;
d[y].resize(2 * W[y] , e());
}
}
void set(C py, C px, S v){
int y = std::lower_bound(Yc.begin(), Yc.end(), py) - Yc.begin();
int x = std::lower_bound(Xc.begin(), Xc.end(), px) - Xc.begin();
y += H;
while(y){
int x2 = std::lower_bound(pos[y].begin(), pos[y].end(), x) - pos[y].begin();
x2 += W[y];
d[y][x2] = v;
x2 >>= 1;
while(x2){
updateX(y, x2);
x2 >>= 1;
}
y >>= 1;
}
}
S get(C py, C px){
int y = std::lower_bound(Yc.begin(), Yc.end(), py) - Yc.begin();
int x = std::lower_bound(Xc.begin(), Xc.end(), px) - Xc.begin();
x = std::lower_bound(pos[y].begin(), pos[y].end(), x) - pos[y].begin();
return d[y + H][x + W[y]];
}
S prod(C lpy, C lpx , C rpy , C rpx){
int ly = std::lower_bound(Yc.begin(), Yc.end(), lpy) - Yc.begin();
int ry = std::lower_bound(Yc.begin(), Yc.end(), rpy) - Yc.begin();
int lx = std::lower_bound(Xc.begin(), Xc.end(), lpx) - Xc.begin();
int rx = std::lower_bound(Xc.begin(), Xc.end(), rpx) - Xc.begin();
S sml = e(), smr = e();
ly += H, ry += H + 1;
if(ry > 2*H)ry = 2*H;
while (ly < ry) {
if (ly & 1) sml = op(sml, yline_prod(lx, rx , ly++));
if (ry & 1) smr = op(yline_prod(lx, rx , --ry), smr);
ly >>= 1;
ry >>= 1;
}
return op(sml, smr);
}
S yline_prod(int lpx,int rpx ,int y){
int lx = std::lower_bound(pos[y].begin(), pos[y].end(), lpx) - pos[y].begin();
int rx = std::lower_bound(pos[y].begin(), pos[y].end(), rpx) - pos[y].begin();
S sml = e(), smr = e();
lx += W[y], rx += W[y] + 1;
if(rx > 2*W[y])rx = 2*W[y];
while (lx < rx) {
if (lx & 1) if(lx>=0&&lx<d[y].size())sml = op(sml, d[y][lx++]);
if (rx & 1) if(rx-1>=0&&rx-1<d[y].size())smr = op(d[y][--rx], smr);
lx >>= 1;
rx >>= 1;
}
return op(sml, smr);
}
private:
int ceil_pow2(int n) {
int x = 0;
while ((1U << x) < (unsigned int)(n)) x++;
return x;
}
void updateX(int yi, int xi) { d[yi][xi] = op(d[yi][2 * xi], d[yi][2 * xi + 1]); }
};
ll op(ll a,ll b){return max(a,b);}
ll e(){return -1;}
int main(){
INT(n,q);
segtree2D_lite<ll,op,e,int> seg;
vector<array<ll,6>> a(n);
vector2d(ll,qe,q,1);
rep(i,n){
in(a[i]);
seg.insert(min({a[i][0],a[i][2],a[i][4]}),max({a[i][0],a[i][2],a[i][4]}));
}
rep(i,q){
in(qe[i][0]);
if(qe[i][0]==1){
qe[i].resize(7);
rep(j,6)in(qe[i][j+1]);
seg.insert(min({qe[i][1],qe[i][3],qe[i][5]}),max({qe[i][1],qe[i][3],qe[i][5]}));
}else{
qe[i].resize(3);
in(qe[i][1],qe[i][2]);
seg.insert(qe[i][1],qe[i][1]);
seg.insert(qe[i][2],qe[i][2]);
}
}
seg.build();
auto f=[&](ll x1,ll y1,ll x2,ll y2,ll x3,ll y3){
ll dx1=x2-x1,dx2=x3-x1,dy1=y2-y1,dy2=y3-y1;
return abs(dx1*dy2-dx2*dy1);
};
rep(i,n){
int l=min({a[i][0],a[i][2],a[i][4]});
int r=max({a[i][0],a[i][2],a[i][4]});
seg.set(l,r,max(seg.get(l,r),f(a[i][0],a[i][1],a[i][2],a[i][3],a[i][4],a[i][5])));
}
rep(i,q){
if(qe[i][0]==1){
int l=min({qe[i][1],qe[i][3],qe[i][5]});
int r=max({qe[i][1],qe[i][3],qe[i][5]});
seg.set(l,r,max(seg.get(l,r),f(qe[i][1],qe[i][2],qe[i][3],
qe[i][4],qe[i][5],qe[i][6])));
}else{
int l=qe[i][1];
int r=qe[i][2];
out(seg.prod(l,l,r,r));
}
}
}