結果
問題 | No.755 Zero-Sum Rectangle |
ユーザー | komori3 |
提出日時 | 2018-12-03 00:58:21 |
言語 | C++11 (gcc 11.4.0) |
結果 |
AC
|
実行時間 | 212 ms / 2,000 ms |
コード長 | 5,139 bytes |
コンパイル時間 | 1,630 ms |
コンパイル使用メモリ | 168,728 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-07-01 05:31:06 |
合計ジャッジ時間 | 3,633 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 212 ms
5,376 KB |
testcase_02 | AC | 118 ms
5,376 KB |
testcase_03 | AC | 109 ms
5,376 KB |
testcase_04 | AC | 108 ms
5,376 KB |
testcase_05 | AC | 108 ms
5,376 KB |
testcase_06 | AC | 107 ms
5,376 KB |
testcase_07 | AC | 109 ms
5,376 KB |
testcase_08 | AC | 108 ms
5,376 KB |
testcase_09 | AC | 110 ms
5,376 KB |
testcase_10 | AC | 109 ms
5,376 KB |
testcase_11 | AC | 1 ms
5,376 KB |
evil_1 | AC | 121 ms
5,376 KB |
ソースコード
#define _CRT_SECURE_NO_WARNINGS #include "bits/stdc++.h" //#include "libs.h" #include <random> #include <unordered_map> #include <unordered_set> //#include <opencv2/core.hpp> //#include <opencv2/highgui.hpp> //#include <opencv2/imgproc.hpp> using namespace std; //呪文 #define DUMPOUT cerr #define dump(...) DUMPOUT<<" ";DUMPOUT<<#__VA_ARGS__<<" :["<<__LINE__<<":"<<__FUNCTION__<<"]"<<endl;DUMPOUT<<" ";dump_func(__VA_ARGS__) typedef unsigned uint; typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef pair<double, double> pdd; typedef pair<string, string> pss; template <typename _KTy, typename _Ty> ostream& operator << (ostream& o, const pair<_KTy, _Ty>& m) { o << "{" << m.first << ", " << m.second << "}"; return o; } template <typename _KTy, typename _Ty> ostream& operator << (ostream& o, const map<_KTy, _Ty>& m) { if (m.empty()) { o << "{ }"; return o; } o << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { o << ", " << *itr; } o << "}"; return o; } template <typename _KTy, typename _Ty> ostream& operator << (ostream& o, const unordered_map<_KTy, _Ty>& m) { if (m.empty()) { o << "{ }"; return o; } o << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { o << ", " << *itr; } o << "}"; return o; } template <typename _Ty> ostream& operator << (ostream& o, const vector<_Ty>& v) { if (v.empty()) { o << "{ }"; return o; } o << "{" << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++) { o << ", " << *itr; } o << "}"; return o; } template <typename _Ty> ostream& operator << (ostream& o, const set<_Ty>& s) { if (s.empty()) { o << "{ }"; return o; } o << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { o << ", " << *itr; } o << "}"; return o; } template <typename _Ty> ostream& operator << (ostream& o, const unordered_set<_Ty>& s) { if (s.empty()) { o << "{ }"; return o; } o << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { o << ", " << *itr; } o << "}"; return o; } template <typename _Ty> ostream& operator << (ostream& o, const stack<_Ty>& s) { if (s.empty()) { o << "{ }"; return o; } stack<_Ty> t(s); o << "{" << t.top(); t.pop(); while (!t.empty()) { o << ", " << t.top(); t.pop(); } o << "}"; return o; } template <typename _Ty> ostream& operator << (ostream& o, const list<_Ty>& l) { if (l.empty()) { o << "{ }"; return o; } o << "{" << l.front(); for (auto itr = ++l.begin(); itr != l.end(); ++itr) { o << ", " << *itr; } o << "}"; return o; } template <typename _KTy, typename _Ty> istream& operator >> (istream& is, pair<_KTy, _Ty>& m) { is >> m.first >> m.second; return is; } template <typename _Ty> istream& operator >> (istream& is, vector<_Ty>& v) { for (size_t i = 0; i < v.size(); i++) is >> v[i]; return is; } namespace aux { // print tuple template<typename Ty, unsigned N, unsigned L> struct tp { static void print(ostream& os, const Ty& v) { os << get<N>(v) << ", "; tp<Ty, N + 1, L>::print(os, v); } }; template<typename Ty, unsigned N> struct tp<Ty, N, N> { static void print(ostream& os, const Ty& v) { os << get<N>(v); } }; } template<typename... Tys> ostream& operator<<(ostream& os, const tuple<Tys...>& t) { os << "{"; aux::tp<tuple<Tys...>, 0, sizeof...(Tys) - 1>::print(os, t); os << "}"; return os; } template<typename A, size_t N, typename T> inline void Fill(A(&array)[N], const T &val) { std::fill((T*)array, (T*)(array + N), val); } void dump_func() { DUMPOUT << endl; } template <class Head, class... Tail> void dump_func(Head&& head, Tail&&... tail) { DUMPOUT << head; if (sizeof...(Tail) == 0) { DUMPOUT << " "; } else { DUMPOUT << ", "; } dump_func(std::move(tail)...); } #define PI 3.14159265358979323846 #define EPS 1e-10 #define FOR(i,a,n) for(int i=(a);i<(n);++i) #define REP(i,n) FOR(i,0,n) #define all(j) (j).begin(), (j).end() #define SZ(j) ((int)(j).size()) #define fake false int main() { cin.tie(0); ios::sync_with_stdio(false); int N, M; cin >> N >> M; vector<vector<ll>> mat(M + 1, vector<ll>(M + 1, 0)); for (int i = 1; i <= M; i++) for (int j = 1; j <= M; j++) cin >> mat[i][j]; vector<int> x(N), y(N); for (int i = 0; i < N; i++) cin >> x[i] >> y[i]; vector<vector<ll>> smat(mat); for (int i = 0; i <= M; i++) for (int j = 1; j <= M; j++) smat[i][j] += smat[i][j - 1]; for (int j = 0; j <= M; j++) for (int i = 1; i <= M; i++) smat[i][j] += smat[i - 1][j]; vector<vector<ll>> imos(M + 2, vector<ll>(M + 2, 0)); for (int i1 = 1; i1 <= M; i1++) for (int j1 = 1; j1 <= M; j1++) { for (int i2 = i1; i2 <= M; i2++) for (int j2 = j1; j2 <= M; j2++) { ll sum = smat[i2][j2] - smat[i1 - 1][j2] - smat[i2][j1 - 1] + smat[i1 - 1][j1 - 1]; if (sum == 0) { imos[i2 + 1][j2 + 1]++; imos[i1][j1]++; imos[i1][j2 + 1]--; imos[i2 + 1][j1]--; } } } for (int i = 0; i <= M + 1; i++) for (int j = 1; j <= M + 1; j++) imos[i][j] += imos[i][j - 1]; for (int j = 0; j <= M + 1; j++) for (int i = 1; i <= M + 1; i++) imos[i][j] += imos[i - 1][j]; for (int i = 0; i < N; i++) cout << imos[x[i]][y[i]] << endl; return 0; }