結果
| 問題 | No.1625 三角形の質問 |
| ユーザー |
 t98slider
|
| 提出日時 | 2021-11-23 02:44:06 |
| 言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
MLE
|
| 実行時間 | - |
| コード長 | 7,721 bytes |
| コンパイル時間 | 2,192 ms |
| コンパイル使用メモリ | 187,612 KB |
| 実行使用メモリ | 817,408 KB |
| 最終ジャッジ日時 | 2024-06-24 21:27:21 |
| 合計ジャッジ時間 | 7,367 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge3 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
5,248 KB |
| testcase_01 | MLE | - |
| testcase_02 | -- | - |
| testcase_03 | -- | - |
| testcase_04 | -- | - |
| testcase_05 | -- | - |
| testcase_06 | -- | - |
| testcase_07 | -- | - |
| testcase_08 | -- | - |
| testcase_09 | -- | - |
| testcase_10 | -- | - |
| testcase_11 | -- | - |
| testcase_12 | -- | - |
| testcase_13 | -- | - |
| testcase_14 | -- | - |
| testcase_15 | -- | - |
| testcase_16 | -- | - |
| testcase_17 | -- | - |
| testcase_18 | -- | - |
| testcase_19 | -- | - |
ソースコード
#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)()> struct segtree2D {
int H, W, h, w, logh, logw ;
std::vector<std::vector<S>> d;
segtree2D() : segtree2D(0, 0) {}
segtree2D(int _h,int _w) : segtree2D(std::vector<std::vector<S>>(_h ,std::vector<S>(_w ,e()))) {}
segtree2D(const std::vector<std::vector<S>>& v) : h(int(v.size())), w(int(v[0].size())) {
logh = ceil_pow2(h), logw = ceil_pow2(w);
H = 1 << logh, W = 1 << logw;
d = std::vector<std::vector<S>>(2 * H, std::vector<S>(2 * W, e()));
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
d[H + i][W + j] = v[i][j];
}
}
for(int i = 2*H-1; i >= H ; i--){
for(int j = W - 1; j >= 1; j--){
updateX(i, j);
}
}
for(int i = H-1; i >= 1; i--){
for(int j = 2*W-1 ; j >= 1; j--){
updateY(i, j);
}
}
}
void set(int py, int px, S x) {
assert(0 <= py && py < h);
assert(0 <= px && px < w);
py += H, px += W;
d[py][px] = x;
for(int j = 1; j <= logw ; j++){
updateX(py, px>>j);
}
for(int i = 1; i <= logh; i++){
for(int j = 0 ; j <= logw; j++){
updateY(py>>i, px>>j);
}
}
}
S get(int py, int px) {
assert(0 <= py && py < h);
assert(0 <= px && px < w);
return d[py + H][px + W];
}
S prod(int ly, int lx, int ry , int rx) {
assert(0 <= ly && ly <= ry && ry <= h);
assert(0 <= lx && lx <= rx && rx <= w);
S sml = e(), smr = e();
ly += H, ry += H;
while (ly < ry) {
if (ly & 1) sml = op(sml, prod(lx, rx , ly++));
if (ry & 1) smr = op(prod(lx, rx , --ry), smr);
ly >>= 1;
ry >>= 1;
}
return op(sml, smr);
}
S prod(int lx,int rx ,int y){
S sml = e(), smr = e();
lx += W, rx += W;
while (lx < rx) {
if (lx & 1) sml = op(sml, d[y][lx++]);
if (rx & 1) smr = op(d[y][--rx], smr);
lx >>= 1;
rx >>= 1;
}
return op(sml, smr);
}
S all_prod() { return d[1][1]; }
private:
int ceil_pow2(int n) {
int x = 0;
while ((1U << x) < (unsigned int)(n)) x++;
return x;
}
void updateX(int i,int j){d[i][j] = op(d[i][2*j], d[i][2*j+1]);}
void updateY(int i,int j){d[i][j] = op(d[2*i][j], d[2*i+1][j]);}
};
ll op(ll a,ll b){return max(a,b);}
ll e(){return -1;}
int main(){
INT(n,q);
vector<int> c;
vector<array<ll,6>> a(n);
vector<vector<int>> query(q);
rep(i,n){
in(a[i]);
c.push_back(min({a[i][0],a[i][2],a[i][4]}));
c.push_back(max({a[i][0],a[i][2],a[i][4]}));
}
rep(i,q){
INT(x);
query[i].push_back(x);
if(x==1){
query[i].resize(7);
rep(j,6)in(query[i][j+1]);
c.push_back(min({query[i][1],query[i][3],query[i][5]}));
c.push_back(max({query[i][1],query[i][3],query[i][5]}));
}else{
query[i].resize(3);
rep(j,2)in(query[i][j+1]),c.push_back(query[i][j+1]);
}
}
sort(all(c));
c.erase(unique(all(c)),c.end());
segtree2D<ll,op,e> seg(c.size(),c.size());
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=lower_bound(all(c),min({a[i][0],a[i][2],a[i][4]}))-c.begin();
int r=lower_bound(all(c),max({a[i][0],a[i][2],a[i][4]}))-c.begin();
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(query[i][0]==1){
int l=lower_bound(all(c),min({query[i][1],query[i][3],query[i][5]}))-c.begin();
int r=lower_bound(all(c),max({query[i][1],query[i][3],query[i][5]}))-c.begin();
seg.set(l,r,max(seg.get(l,r),f(query[i][1],query[i][2],query[i][3],
query[i][4],query[i][5],query[i][6])));
}else{
int l=lower_bound(all(c),query[i][1])-c.begin();
int r=upper_bound(all(c),query[i][2])-c.begin();
out(seg.prod(l,l,r,r));
}
}
}