Submission #69300

ソースコード

?
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
#include "bits/stdc++.h"
#pragma GCC optimize("Ofast")
// Begin Header {{{
#pragma region
using namespace std;
#ifndef DEBUG
#define dump(...)
#endif
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define rep(i, b, e) for (intmax_t i = (b), i##_limit = (e); i < i##_limit; ++i)
#define repc(i, b, e) for (intmax_t i = (b), i##_limit = (e); i <= i##_limit; ++i)
#define repr(i, b, e) for (intmax_t i = (b), i##_limit = (e); i >= i##_limit; --i)
#define var(Type, ...) \
Type __VA_ARGS__; \
input(__VA_ARGS__)
#define let const auto
constexpr size_t operator""_zu(unsigned long long value) {
return value;
};
constexpr intmax_t operator""_jd(unsigned long long value) {
return value;
};
constexpr uintmax_t operator""_ju(unsigned long long value) {
return value;
};
constexpr int INF = 0x3f3f3f3f;
constexpr intmax_t LINF = 0x3f3f3f3f3f3f3f3f_jd;
using usize = size_t;
using imax = intmax_t;
using uimax = uintmax_t;
using ld = long double;
template <class T, class Compare = less<>>
using MaxHeap = priority_queue<T, vector<T>, Compare>;
template <class T, class Compare = greater<>>
using MinHeap = priority_queue<T, vector<T>, Compare>;
inline void input() {}
template <class Head, class... Tail>
inline void input(Head &&head, Tail &&... tail) {
cin >> head;
input(forward<Tail>(tail)...);
}
template <class Container, class Value = typename Container::value_type,
enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr>
inline istream &operator>>(istream &is, Container &vs) {
for (auto &v: vs) is >> v;
return is;
}
template <class T, class U>
inline istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.first >> p.second;
return is;
}
inline void output() {
cout << "\n";
}
template <class Head, class... Tail>
inline void output(Head &&head, Tail &&... tail) {
cout << head;
if (sizeof...(tail)) cout << " ";
output(forward<Tail>(tail)...);
}
template <class Container, class Value = typename Container::value_type,
enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr>
inline ostream &operator<<(ostream &os, const Container &vs) {
static constexpr const char *delim[] = {" ", ""};
for (auto it = begin(vs); it != end(vs); ++it) {
os << delim[it == begin(vs)] << *it;
}
return os;
}
template <class Iterator>
inline void join(const Iterator &Begin, const Iterator &End, const string &delim = "\n",
const string &last = "\n") {
for (auto it = Begin; it != End; ++it) {
cout << ((it == Begin) ? "" : delim) << *it;
}
cout << last;
}
template <class T>
inline vector<T> makeVector(const T &init_value, size_t sz) {
return vector<T>(sz, init_value);
}
template <class T, class... Args>
inline auto makeVector(const T &init_value, size_t sz, Args... args) {
return vector<decltype(makeVector<T>(init_value, args...))>(
sz, makeVector<T>(init_value, args...));
}
template <class Func>
class FixPoint : Func {
public:
explicit constexpr FixPoint(Func &&f) noexcept : Func(forward<Func>(f)) {}
template <class... Args>
constexpr decltype(auto) operator()(Args &&... args) const {
return Func::operator()(*this, std::forward<Args>(args)...);
}
};
template <class Func>
static inline constexpr decltype(auto) makeFixPoint(Func &&f) noexcept {
return FixPoint<Func>{forward<Func>(f)};
}
template <class Container>
struct reverse_t {
Container &c;
reverse_t(Container &c) : c(c) {}
auto begin() {
return c.rbegin();
}
auto end() {
return c.rend();
}
};
template <class Container>
auto reversed(Container &c) {
return reverse_t<Container>(c);
}
template <class T>
inline bool chmax(T &a, const T &b) noexcept {
return b > a && (a = b, true);
}
template <class T>
inline bool chmin(T &a, const T &b) noexcept {
return b < a && (a = b, true);
}
template <class T>
inline T diff(const T &a, const T &b) noexcept {
return a < b ? b - a : a - b;
}
void operator|=(vector<bool>::reference lhs, const bool rhs) {
lhs = lhs | rhs;
}
void operator&=(vector<bool>::reference lhs, const bool rhs) {
lhs = lhs & rhs;
}
void operator^=(vector<bool>::reference lhs, const bool rhs) {
lhs = lhs ^ rhs;
}
void ioinit() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
clog << fixed << setprecision(10);
}
#pragma endregion
// }}} End Header
int main() {
ioinit();
var(size_t, N);
map<intmax_t, intmax_t> mp1, mp2;
intmax_t res = 0;
rep(i, 0, N) {
var(intmax_t, x, y);
res += mp1[x - y];
res += mp2[x + y];
mp1[x - y]++;
mp2[x + y]++;
}
output(res);
return 0;
}

ステータス

項目 データ
問題 1525 - Counting Squares
ユーザー名 もけ
投稿日時 2022-03-12 19:14:25
言語 C++17
状態 Accepted
得点 3
ソースコード長 5038 Byte
最大実行時間 735 ms
最大メモリ使用量 135152 KB

セット

セット 得点 Cases
1 ALL 3 / 3 *

テストケース

ファイル名 状態 実行時間 メモリ使用量 #
in01.txt AC 43 ms 604 KB
1
in02.txt AC 38 ms 684 KB
1
in03.txt AC 33 ms 508 KB
1
in04.txt AC 27 ms 588 KB
1
in05.txt AC 31 ms 544 KB
1
in06.txt AC 17 ms 752 KB
1
in07.txt AC 29 ms 660 KB
1
in08.txt AC 24 ms 584 KB
1
in09.txt AC 21 ms 620 KB
1
in10.txt AC 28 ms 540 KB
1
in11.txt AC 21 ms 592 KB
1
in12.txt AC 49 ms 660 KB
1
in13.txt AC 20 ms 644 KB
1
in14.txt AC 32 ms 800 KB
1
in15.txt AC 25 ms 1016 KB
1
in16.txt AC 238 ms 22092 KB
1
in17.txt AC 296 ms 30148 KB
1
in18.txt AC 199 ms 26284 KB
1
in19.txt AC 134 ms 21712 KB
1
in20.txt AC 52 ms 16284 KB
1
in21.txt AC 499 ms 56016 KB
1
in22.txt AC 504 ms 61992 KB
1
in23.txt AC 521 ms 68092 KB
1
in24.txt AC 532 ms 74192 KB
1
in25.txt AC 735 ms 80288 KB
1
in26.txt AC 486 ms 82932 KB
1
in27.txt AC 478 ms 87136 KB
1
in28.txt AC 138 ms 54596 KB
1
in29.txt AC 146 ms 57248 KB
1
in30.txt AC 208 ms 64508 KB
1
in31.txt AC 385 ms 90640 KB
1
in32.txt AC 384 ms 94436 KB
1
in33.txt AC 364 ms 98108 KB
1
in34.txt AC 245 ms 90124 KB
1
in35.txt AC 253 ms 93764 KB
1
in36.txt AC 256 ms 97404 KB
1
in37.txt AC 249 ms 100920 KB
1
in38.txt AC 244 ms 107772 KB
1
in39.txt AC 237 ms 111496 KB
1
in40.txt AC 366 ms 132632 KB
1
in41.txt AC 370 ms 135152 KB
1
sample.txt AC 30 ms 97600 KB
1