結果
問題 | No.1074 増殖 |
ユーザー |
![]() |
提出日時 | 2020-06-05 21:53:45 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 115 ms / 2,000 ms |
コード長 | 2,959 bytes |
コンパイル時間 | 2,140 ms |
コンパイル使用メモリ | 200,328 KB |
最終ジャッジ日時 | 2025-01-10 22:29:14 |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 12 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:92:8: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 92 | scanf("%d",&n); | ~~~~~^~~~~~~~~ main.cpp:96:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 96 | scanf("%d%d%d%d",&xa,&ya,&xb,&yb); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
ソースコード
#include <bits/stdc++.h>#define fi first#define se second#define rep(i,n) for(int i = 0; i < (n); ++i)#define rrep(i,n) for(int i = 1; i <= (n); ++i)#define drep(i,n) for(int i = (n)-1; i >= 0; --i)#define srep(i,s,t) for (int i = s; i < t; ++i)#define rng(a) a.begin(),a.end()#define rrng(a) a.rbegin(),a.rend()#define maxs(x,y) (x = max(x,y))#define mins(x,y) (x = min(x,y))#define isin(x,l,r) ((l) <= (x) && (x) < (r))#define pb push_back#define eb emplace_back#define sz(x) (int)(x).size()#define pcnt __builtin_popcountll#define uni(x) x.erase(unique(rng(x)),x.end())#define snuke srand((unsigned)clock()+(unsigned)time(NULL));#define show(x) cout<<#x<<" = "<<x<<endl;#define PQ(T) priority_queue<T,v(T),greater<T> >#define bn(x) ((1<<x)-1)#define dup(x,y) (((x)+(y)-1)/(y))#define newline puts("")#define v(T) vector<T>#define vv(T) v(v(T))using namespace std;typedef long long int ll;typedef unsigned uint;typedef unsigned long long ull;typedef pair<int,int> P;typedef tuple<int,int,int> T;typedef vector<int> vi;typedef vector<vi> vvi;typedef vector<ll> vl;typedef vector<P> vp;typedef vector<T> vt;inline int getInt() { int x; scanf("%d",&x); return x;}template<typename T>inline istream& operator>>(istream&i,v(T)&v){rep(j,sz(v))i>>v[j];return i;}template<typename T>string join(const v(T)&v){stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}template<typename T>inline ostream& operator<<(ostream&o,const v(T)&v){if(sz(v))o<<join(v);return o;}template<typename T1,typename T2>inline istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;}template<typename T1,typename T2>inline ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<","<<v.se;}template<typename T>inline ll suma(const v(T)& a) { ll res(0); for (auto&& x : a) res += x; return res;}const double eps = 1e-10;const ll LINF = 1001002003004005006ll;const int INF = 1001001001;#define dame { puts("-1"); return 0;}#define yn {puts("Yes");}else{puts("No");}const int MX = 200005;struct S {set<P> s;S() {s.emplace(0,INF);s.emplace(INF,0);}ll get(P p) {auto it = s.find(p);auto jt = it;--it;++jt;ll l = p.fi - it->fi;ll r = p.se - jt->se;// cerr<<p<<" "<<*it<<" "<<*jt<<endl;return l*r;}ll add(int x, int y) {P p(x,y);ll res = 0;auto it = s.lower_bound(p);if (it->se >= p.se) return 0;--it;while (1) {if (it->se <= p.se) {res -= get(*it);s.erase(it--);} else break;}s.insert(p);res += get(p);return res;}};int main() {int n;scanf("%d",&n);S a, b, c, d;rep(ni,n) {int xa,ya,xb,yb;scanf("%d%d%d%d",&xa,&ya,&xb,&yb);xa = -xa;ya = -ya;ll ans = 0;ans += a.add(xa,ya);ans += b.add(xa,yb);ans += c.add(xb,ya);ans += d.add(xb,yb);cout<<ans<<endl;}return 0;}