oj.uz

Submission #232119

# Submission time Handle Problem Language Result Execution time Memory
232119 2020-05-16T05:51:06 Z SorahISA Count Squares (CEOI19_countsquares) C++17
100 / 100
 2503 ms 141292 KB 
// #pragma GCC target("avx2")
#pragma GCC optimize("O3", "unroll-loops")

// #include <bits/extc++.h>
// using namespace __gnu_pbds;

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define double long double
// template <typename T>
// using pbds_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
using pii = pair<int, int>;
template<typename T>
using prior = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using Prior = priority_queue<T>;

#define X first
#define Y second
#define ALL(x) (x).begin(), (x).end()
#define eb emplace_back
#define pb push_back

#define fastIO() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define RANDOM() random_device __rd; \
                 mt19937 __gen = mt19937(__rd()); \
                 uniform_int_distribution<int> __dis(1, 1E5); \
                 auto rnd = bind(__dis, __gen);

const int INF = 1E18;
const int mod = 1E9 + 7;
const double eps = 1e-8;

int32_t main() {
    fastIO();
    
    int h, v, ans = 0;
    cin >> h >> v;
    
    vector<int> vecX(h), vecY(v);
    for (auto &x : vecX) cin >> x;
    for (auto &x : vecY) cin >> x;
    
    map<int, int> allWidth;
    for (int i = 0; i < v; ++i) {
        for (int j = i+1; j < v; ++j) ++allWidth[vecY[j] - vecY[i]];
    }
    
    for (int i = 0; i < h; ++i) {
        for (int j = i+1; j < h; ++j) ans += allWidth[vecX[j] - vecX[i]];
    }
    
    cout << ans << "\n";
    
    return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 6 ms 256 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 6 ms 256 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 243 ms 23032 KB Output is correct
7 Correct 206 ms 22752 KB Output is correct
8 Correct 205 ms 22824 KB Output is correct
9 Correct 184 ms 22136 KB Output is correct
10 Correct 13 ms 768 KB Output is correct

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 6 ms 256 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 243 ms 23032 KB Output is correct
7 Correct 206 ms 22752 KB Output is correct
8 Correct 205 ms 22824 KB Output is correct
9 Correct 184 ms 22136 KB Output is correct
10 Correct 13 ms 768 KB Output is correct
11 Correct 2333 ms 141292 KB Output is correct
12 Correct 2461 ms 140912 KB Output is correct
13 Correct 2503 ms 140968 KB Output is correct
14 Correct 2177 ms 139144 KB Output is correct
15 Correct 90 ms 1528 KB Output is correct