結果
問題 | No.60 魔法少女 |
ユーザー | akusyounin2412 |
提出日時 | 2018-03-29 01:18:05 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 202 ms / 5,000 ms |
コード長 | 1,984 bytes |
コンパイル時間 | 975 ms |
コンパイル使用メモリ | 115,804 KB |
実行使用メモリ | 48,324 KB |
最終ジャッジ日時 | 2023-09-07 20:10:33 |
合計ジャッジ時間 | 3,285 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 23 ms
17,912 KB |
testcase_01 | AC | 23 ms
17,924 KB |
testcase_02 | AC | 23 ms
17,992 KB |
testcase_03 | AC | 18 ms
35,156 KB |
testcase_04 | AC | 114 ms
48,324 KB |
testcase_05 | AC | 123 ms
48,188 KB |
testcase_06 | AC | 196 ms
48,280 KB |
testcase_07 | AC | 149 ms
48,264 KB |
testcase_08 | AC | 100 ms
46,180 KB |
testcase_09 | AC | 52 ms
48,072 KB |
testcase_10 | AC | 184 ms
48,244 KB |
testcase_11 | AC | 35 ms
45,792 KB |
testcase_12 | AC | 90 ms
46,200 KB |
testcase_13 | AC | 202 ms
48,216 KB |
ソースコード
# include <iostream> # include <algorithm> #include <array> # include <cassert> #include <cctype> #include <climits> #include <numeric> # include <vector> # include <string> # include <set> # include <map> # include <cmath> # include <iomanip> # include <functional> # include <tuple> # include <utility> # include <stack> # include <queue> # include <list> # include <bitset> # include <complex> # include <chrono> # include <random> # include <limits.h> # include <unordered_map> # include <unordered_set> # include <deque> # include <cstdio> # include <cstring> using namespace std; using LL = long long; using ULL = unsigned long long; constexpr long long MOD = 1000000000 + 7; constexpr long long INF = std::numeric_limits<long long>::max(); const double PI = acos(-1); #define fir first #define sec second typedef pair<LL, LL> Pll; typedef pair<LL, pair<LL, LL>> Ppll; typedef pair<LL, pair<LL, bitset<100001>>> Pbll; typedef pair<LL, pair<LL, vector<LL>>> Pvll; typedef pair<LL, LL> Vec2; struct Tll { LL first, second, third; }; typedef pair<LL, Tll> Ptll; #define rep(i,rept) for(LL i=0;i<rept;i++) #define Mfor(i,mf) for(LL i=mf-1;i>=0;i--) LL h, w, n, m, k, s, t, q, sum, last, cnt, ans,a[2100][2100],d[2100][2100]; struct Edge { LL to, cost; }; string str; void YN(bool f) { if (f) cout << "YES" << endl; else cout << "NO" << endl; } void yn(bool f) { if (f) cout << "Yes" << endl; else cout << "No" << endl; } int main() { cin >> n >> k; rep(i, n) { LL x, y, z; cin >> x >> y >> z; a[x + 500][y + 500] = z; } rep(i, k) { LL x1, y1, x2, y2, z; cin >> x1 >> y1 >> x2 >> y2 >> z; x1 += 500, y1 += 500, x2 += x1+1, y2 += y1+1; d[x1][y1] += z; d[x2][y1] -= z; d[x1][y2] -= z; d[x2][y2] += z; } rep(i, 1008) rep(j, 1008) d[j + 1][i] += d[j][i]; rep(i, 1008) rep(j, 1008) d[i][j + 1] += d[i][j]; rep(i, 1008) rep(j, 1008) { if (a[i][j] > 0) { ans += max(a[i][j] - d[i][j], (LL)0); } } cout << ans << endl; return 0; }