結果
問題 | No.755 Zero-Sum Rectangle |
ユーザー |
|
提出日時 | 2018-12-12 17:08:27 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 292 ms / 2,000 ms |
コード長 | 3,637 bytes |
コンパイル時間 | 2,114 ms |
コンパイル使用メモリ | 179,508 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-09-25 03:38:25 |
合計ジャッジ時間 | 4,227 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 12 |
ソースコード
#include "bits/stdc++.h"using namespace std;/* macro */#define rep(i,a,b) for(int i=a;i<b;i++)#define revrep(i,a,b) for(int i = a; i > b; i--)#define int long long#define exist(s,e) ((s).find(e)!=(s).end())#define all(v) (v).begin(), (v).end()#define each(s,itr) for(auto (itr) = s.begin(); (itr) != s.end(); (itr)++)#define sum(v) accumulate(all(v), (0LL))#define pb push_back/* alias */template<class T> using vec = vector<T>;typedef vector<int> vi;typedef pair<int, int> pi;/* constant */const int inf = pow(2, 62);const int mod = 1e9 + 7;int dx[8]={1,0,-1,0,-1,1,-1,1};int dy[8]={0,1,0,-1,-1,-1,1,1};const string alpha = "abcdefghijklmnopqrstuvwxyz";/* io_method */int input(){int tmp;cin >> tmp;return tmp;}string raw_input(){string tmp;cin >> tmp;return tmp;}string readline(){string s;getline(cin, s);return s;}template<class T> void printx(T n){cout << n;}template<class T, class U> void printx(pair<T, U> p){cout << "(" << p.first << "," << p.second << ")";}template<class T> void printx(vector<T> v){cout << "{";rep(i,0,v.size()){printx(v[i]);if(i != v.size()-1)printx(",");}cout << "}";}template<class T> void print(T n){printx(n);cout << endl;}template<class T> void print(set<T> s){cout << "{";each(s, e){if(e != s.begin()) printx(",");printx(*e);}cout << "}" << endl;}template<class T, class U> void print(map<T, U> mp){cout << "{";each(mp, e){cout << "(" << e -> first << "," << e -> second << ")";}cout << "}" <<endl;}/* general_method */template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }/* main */struct cumsum2d{int x;int y;vector<vector<int>> arr;cumsum2d(int width, int height){x = width;y = height;arr = vector<vector<int>>(x, vector<int>(y, 0));}void init(vector<vector<int>> vec){arr = vec;x = arr[0].size();y = arr.size();}void add(int x1, int y1, int x2, int y2, int val = 1){arr[y1][x1] += val;if(x2 + 1 < x) arr[y1][x2 + 1] -= val;if(y2 + 1 < y) arr[y2 + 1][x1] -= val;if(x2 + 1 < x && y2 + 1 < y) arr[y2 + 1][x2 + 1] += val;}void build(){for(int i = 0; i < y; i++){for(int j = 1; j < x; j++){arr[i][j] += arr[i][j - 1];}}for(int i = 1; i < y; i++){for(int j = 0; j < x; j++){arr[i][j] += arr[i - 1][j];}}}int query(int x1, int y1, int x2, int y2){int ret = arr[y2][x2];if(-1 < x1 - 1) ret -= arr[y2][x1 - 1];if(-1 < y1 - 1) ret -= arr[y1 - 1][x2];if(-1 < x1 - 1 && -1 < y1 - 1) ret += arr[y1 - 1][x1 - 1];return ret;}};signed main(){cin.tie(0);ios::sync_with_stdio(false);int n, m; cin >> n >> m;cumsum2d cs = cumsum2d(1,1);vec<vi> arr(m, vi(m));rep(i,0,m){rep(j,0,m){arr[i][j] = input();}}cs.init(arr);cs.build();vec<vi> a(m, vi(m, 0));cumsum2d ans = cumsum2d(1, 1);ans.init(a);rep(sx,0,m){rep(sy,0,m){rep(tx,sx,m){rep(ty,sy,m){if(cs.query(sx,sy, tx, ty) == 0){ans.add(sx, sy, tx, ty, 1);}}}}}ans.build();rep(i,0,n){int x, y; cin >> x >> y;x--; y--;print(ans.arr[x][y]);}}