# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
605769 | 2022-07-26T01:49:59 Z | SanguineChameleon | Count Squares (CEOI19_countsquares) | C++14 | 1767 ms | 105840 KB |
// BEGIN BOILERPLATE CODE #include <bits/stdc++.h> using namespace std; #ifdef KAMIRULEZ const bool kami_loc = true; const long long kami_seed = 69420; #else const bool kami_loc = false; const long long kami_seed = chrono::steady_clock::now().time_since_epoch().count(); #endif const string kami_fi = "kamirulez.inp"; const string kami_fo = "kamirulez.out"; mt19937_64 kami_gen(kami_seed); long long rand_range(long long rmin, long long rmax) { uniform_int_distribution<long long> rdist(rmin, rmax); return rdist(kami_gen); } void file_io(string fi, string fo) { if (fi != "" && (!kami_loc || fi == kami_fi)) { freopen(fi.c_str(), "r", stdin); } if (fo != "" && (!kami_loc || fo == kami_fo)) { freopen(fo.c_str(), "w", stdout); } } void set_up() { if (kami_loc) { file_io(kami_fi, kami_fo); } ios_base::sync_with_stdio(0); cin.tie(0); } void just_do_it(); void just_exec_it() { if (kami_loc) { auto pstart = chrono::steady_clock::now(); just_do_it(); auto pend = chrono::steady_clock::now(); long long ptime = chrono::duration_cast<chrono::milliseconds>(pend - pstart).count(); string bar(50, '='); cout << '\n' << bar << '\n'; cout << "Time: " << ptime << " ms" << '\n'; } else { just_do_it(); } } int main() { set_up(); just_exec_it(); return 0; } // END BOILERPLATE CODE // BEGIN MAIN CODE const int ms = 2e3 + 20; int a[ms]; int b[ms]; void just_do_it() { int n, m; cin >> n >> m; for (int i = 0; i < n; i++) { cin >> a[i]; } for (int i = 0; i < m; i++) { cin >> b[i]; } map<int, int> cc; for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { cc[a[j] - a[i]]++; } } long long res = 0; for (int i = 0; i < m; i++) { for (int j = i + 1; j < m; j++) { int d = b[j] - b[i]; res += cc[d]; } } cout << res; } // END MAIN CODE
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 0 ms | 212 KB | Output is correct |
5 | Correct | 0 ms | 212 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 0 ms | 212 KB | Output is correct |
5 | Correct | 0 ms | 212 KB | Output is correct |
6 | Correct | 138 ms | 17128 KB | Output is correct |
7 | Correct | 136 ms | 17100 KB | Output is correct |
8 | Correct | 158 ms | 17092 KB | Output is correct |
9 | Correct | 126 ms | 16604 KB | Output is correct |
10 | Correct | 10 ms | 596 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 0 ms | 212 KB | Output is correct |
5 | Correct | 0 ms | 212 KB | Output is correct |
6 | Correct | 138 ms | 17128 KB | Output is correct |
7 | Correct | 136 ms | 17100 KB | Output is correct |
8 | Correct | 158 ms | 17092 KB | Output is correct |
9 | Correct | 126 ms | 16604 KB | Output is correct |
10 | Correct | 10 ms | 596 KB | Output is correct |
11 | Correct | 1767 ms | 105840 KB | Output is correct |
12 | Correct | 1717 ms | 105704 KB | Output is correct |
13 | Correct | 1688 ms | 105744 KB | Output is correct |
14 | Correct | 1663 ms | 104472 KB | Output is correct |
15 | Correct | 65 ms | 1024 KB | Output is correct |