結果
| 問題 | No.755 Zero-Sum Rectangle |
| ユーザー |
 jell
|
| 提出日時 | 2018-12-06 14:48:26 |
| 言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 508 ms / 2,000 ms |
| コード長 | 7,509 bytes |
| コンパイル時間 | 1,183 ms |
| コンパイル使用メモリ | 123,164 KB |
| 実行使用メモリ | 8,704 KB |
| 最終ジャッジ日時 | 2024-09-14 02:31:15 |
| 合計ジャッジ時間 | 8,103 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge4 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
8,704 KB |
| testcase_01 | AC | 60 ms
5,376 KB |
| testcase_02 | AC | 177 ms
5,376 KB |
| testcase_03 | AC | 257 ms
5,376 KB |
| testcase_04 | AC | 335 ms
5,376 KB |
| testcase_05 | AC | 367 ms
5,376 KB |
| testcase_06 | AC | 353 ms
5,376 KB |
| testcase_07 | AC | 325 ms
5,376 KB |
| testcase_08 | AC | 489 ms
5,376 KB |
| testcase_09 | AC | 409 ms
5,376 KB |
| testcase_10 | AC | 508 ms
5,376 KB |
| testcase_11 | AC | 2 ms
5,376 KB |
| evil_1 | TLE | - |
コンパイルメッセージ
main.cpp:125:26: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
125 | i64 bins(i64 ok, i64 ng, auto judge) {
| ^~~~
ソースコード
#include <deque>
#include <queue>
#include <stack>
#include <algorithm>
#include <iostream>
#include <set>
#include <map>
#include <list>
#include <cmath>
#include <functional>
#include <random>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <iomanip>
#include <complex>
using namespace std;
typedef int64_t i64;
typedef double db;
typedef vector<vector<int64_t>> mat;
typedef pair<int,int> pii;
typedef pair<int64_t,int> pli;
typedef pair<db,int> pdi;
#define esc(x) cout << (x) << endl,exit(0)
#define inf(T) (numeric_limits<T>::max() / 2 - 1)
#define each(i,v) for(auto i = begin(v); i != end(v); ++i)
#define reach(i,v) for(auto i = rbegin(v); i != rend(v); ++i)
#define urep(i,s,t) for(int64_t i = (s); i <= (t); ++i)
#define drep(i,s,t) for(int64_t i = (s); i >= (t); --i)
#define rep(i,n) urep(i,0,(n) - 1)
#define rep1(i,n) urep(i,1,(n))
#define rrep(i,n) drep(i,(n) - 1,0)
#define all(v) begin(v),end(v)
#define rall(v) rbegin(v),rend(v)
#define vct vector
#define prque priority_queue
#define u_map unordered_map
#define u_set unordered_set
#define l_bnd lower_bound
#define u_bnd upper_bound
#define rsz resize
#define ers erase
#define emp emplace
#define emf emplace_front
#define emb emplace_back
#define pof pop_front
#define pob pop_back
#define mkp make_pair
#define mkt make_tuple
#define fir first
#define sec second
struct setupper {
setupper(uint8_t prec) {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(prec);
#ifdef Local
#define debug 1
#define print(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
cout << "-- Execution At Local ---\n" << "\n<Standard Output>\n\n";
auto print_atexit = []() {
time_t end_time = time(NULL);
struct tm *ret = localtime(&end_time);
cout << "\n----------------\n";
cout << "\nSuccessfully Executed At " << (ret -> tm_hour) << ":" << (ret -> tm_min) << ":" << (ret -> tm_sec) << "\n\n";
};
atexit(print_atexit);
#endif
}
} setupper_obj(10);
template <class T, class U> ostream& operator << (ostream &s, pair<T,U> p) { return s << p.fir << " " << p.sec; }
template <class T> ostream& operator << (ostream &s, vector<T> &v) { for(auto i = v.begin(); i != v.end(); ++i) { if(i != begin(v)) s << " "; s << *i; } return s; }
template <class T> void hash_combine(size_t &seed, T const &key) {
hash<T> hasher;
seed ^= hasher(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2);
}
namespace std {
template <class T, class U> struct hash<pair<T,U>> {
size_t operator()(pair<T,U> const &p) const {
size_t seed(0);
hash_combine(seed,p.first);
hash_combine(seed,p.second);
return seed;
}
};
template <class T, class U, class V> struct hash<tuple<T,U,V>> {
size_t operator()(tuple<T,U,V> const &t) const {
size_t seed(0);
hash_combine(seed,get<0>(t));
hash_combine(seed,get<1>(t));
hash_combine(seed,get<2>(t));
return seed;
}
};
}
const auto add = [](auto &x, auto y) { x += y; };
const auto mul = [](auto &x, auto y) { x *= y; };
const auto lam_min = [](auto x, auto y) { return min(x,y); };
const auto lam_max = [](auto x, auto y) { return max(x,y); };
bool odd(i64 x) { return x & 1; }
bool even(i64 x) { return !odd(x); }
bool parity(i64 x, i64 y) { return odd(x) ^ even(y); }
bool bit(i64 n, uint8_t e) { return n >> e & 1; }
i64 mask(i64 n, uint8_t e) { return n & (1 << e) - 1; };
int ilog(i64 x, uint64_t b) { if(x) return ilog(x / b,b) + 1; return -1; }
i64 qceil(i64 x, i64 y) { return x > 0 ? (x - 1) / y + 1 : x / y; }
i64 gcd(i64 a, i64 b) { if(!b) return abs(a); return gcd(b, a % b); }
i64 lcm(i64 a, i64 b) { if(a | b) return abs(a / gcd(a, b) * b); return 0; }
i64 extgcd(i64 a, i64 b, i64 &x, i64 &y) {
i64 d = a;
if(b) {
d = extgcd(b,a % b,y,x);
y -= (a / b) * x;
} else {
x = 1,y = 0;
}
return d;
}
i64 bins(i64 ok, i64 ng, auto judge) {
while(abs(ok - ng) > 1) {
i64 mid = ok + ng >> 1;
(judge(mid) ? ok : ng) = mid;
}
return ok;
}
template <class T, class U> bool chmax(T& m, U x) { if(m < x) { m = x; return 1; } return 0; }
template <class T, class U> bool chmin(T& m, U x) { if(m > x) { m = x; return 1; } return 0; }
template <class T> T cmprs(T& v) {
T tmp = v,ret = v;
sort(all(tmp));
tmp.erase(unique(all(tmp)),end(tmp));
each(i,ret) *i = l_bnd(all(tmp),*i) - begin(tmp) + 1;
return ret;
}
const int dx[9] = {1,0,-1,0,1,-1,-1,1,0},dy[9] = {0,1,0,-1,1,1,-1,-1,0};
const i64 mod = 1e9 + 7;
const db gold = (sqrt(5.0) + 1.0) * 0.5;
const db eps = 1e-15;
template <class Monoid> struct LazySegtree {
typedef function<Monoid(const Monoid&, const Monoid&)> opr_t;
typedef function<void(Monoid&, const Monoid&)> lazy_opr_t;
typedef function<void(Monoid&, const Monoid&, uint)> update_opr_t;
const opr_t opr;
const lazy_opr_t lazy_opr;
const update_opr_t update_opr;
const Monoid idel,lazy_idel;
vector<Monoid> data,lazy;
vector<bool> lazyflag;
int range = 1;
LazySegtree(int n, Monoid idel_ = 0, const opr_t &opr_ = plus<Monoid>(), const lazy_opr_t &lazy_opr_ = [](Monoid &x, Monoid y){x += y;}, const update_opr_t &update_opr_ = [](Monoid &x, Monoid y, unsigned int w){x += y * w;}, Monoid lazy_idel_ = 0) : opr(opr_),lazy_opr(lazy_opr_),update_opr(update_opr_),idel(idel_),lazy_idel(lazy_idel_)
{
while(n >= range) range <<= 1;
data.resize(range << 1,idel);
lazy.assign(range << 1,lazy_idel);
lazyflag.assign(range << 1,false);
}
void copy(const vector<Monoid> &v) {
for(int i = 0; i < v.size(); ++i) data[i + range] = v[i];
for(int i = range - 1; i; --i) data[i] = opr(data[i * 2],data[i * 2 + 1]);
}
void eval(int k, int l, int r) {
if(!lazyflag[k]) return;
update_opr(data[k],lazy[k],r - l);
if(r - l > 1) {
lazy_opr(lazy[k * 2],lazy[k]);
lazy_opr(lazy[k * 2 + 1],lazy[k]);
lazyflag[k * 2] = lazyflag[k * 2 + 1] = true;
}
lazy[k] = lazy_idel;
lazyflag[k] = false;
}
void update(int a, int b, Monoid val, int k = 1, int l = 0, int r = -1) {
if(r < 0) r = range;
eval(k,l,r);
if(b <= l || r <= a) return;
if(a <= l && r <= b) {
lazy_opr(lazy[k],val);
lazyflag[k] = true;
eval(k,l,r);
} else {
update(a,b,val,k * 2,l,l + r >> 1);
update(a,b,val,k * 2 + 1,l + r >> 1,r);
data[k] = opr(data[k * 2],data[k * 2 + 1]);
}
}
Monoid query(int a, int b, int k = 1, int l = 0, int r = -1) {
if(r < 0) r = range;
eval(k,l,r);
if(b <= l || r <= a) return idel;
if(a <= l && r <= b) return data[k];
return opr(query(a,b,k * 2,l,l + r >> 1),query(a,b,k * 2 + 1,l + r >> 1,r));
}
};
int n,m;
i64 a[150][150];
int main() {
cin>>n>>m;
rep1(i,m)rep1(j,m) cin>>a[i][j];
rep1(i,m-1)rep1(j,m) a[i+1][j]+=a[i][j];
rep1(i,m)rep1(j,m-1) a[i][j+1]+=a[i][j];
while(n--) {
int x,y;
i64 ans=0;
cin>>x>>y;
rep(i,x)urep(j,x,m) {
u_map<i64,int> cnt;
cnt[0]=1;
rep1(k,m) {
i64 now=a[j][k]-a[i][k];
if(k>=y) ans+=cnt[now];
else cnt[now]++;
}
}
cout<<ans<<endl;
}
}