oj.uz

Submission #818842

# Submission time Handle Problem Language Result Execution time Memory
818842 2023-08-10T06:58:19 Z tengiz05 Cell Automaton (JOI23_cell) C++17
8 / 100
 8000 ms 1116 KB 
#include <bits/stdc++.h>

using i64 = long long;
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int n, q;
    cin >> n >> q;
    
    vector<int> x(n), y(n);
    for (int i = 0; i < n; i++) {
        cin >> x[i] >> y[i];
    }
    
    while (q--) {
        i64 k;
        cin >> k;

        sort(x.begin(), x.end());

        auto calc = [&](i64 k) {
            if (k % 2 == 0) {
                i64 ans = 0;
                for (int i = 0; i < n; i++) {
                    ans += (k + 1) * (k + 1) + k * k;
                    if (i + 1 < n && x[i + 1] - x[i] <= k) {
                        i64 f = k - (x[i + 1] - x[i]) + 1;
                        ans -= f * (k + 1);
                        ans -= (f - 1) * k;
                    }
                }
                return ans;
            } else {
                i64 ans = 0;
                for (int i = 0; i < n; i++) {
                    ans += (k + 1) * (k + 1) + k * k;
                    if (i + 1 < n && x[i + 1] - x[i] <= k) {
                        i64 f = k - (x[i + 1] - x[i]) + 1;
                        ans -= f * (k + 1);
                        ans -= (f - 1) * k;
                    }
                }
                return ans;
            }
        };

        if (k == 0) cout << n << "\n";
        else {
            cout << calc(k) - calc(k - 1) << "\n";
        }
    }
    
    return 0;
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 1108 KB Output is correct
2 Correct 27 ms 1108 KB Output is correct
3 Correct 26 ms 1108 KB Output is correct
4 Correct 24 ms 1108 KB Output is correct
5 Correct 26 ms 1108 KB Output is correct
6 Correct 24 ms 1108 KB Output is correct
7 Correct 25 ms 1108 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 23 ms 1108 KB Output is correct

Subtask #4
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 1108 KB Output is correct
2 Correct 27 ms 1108 KB Output is correct
3 Correct 26 ms 1108 KB Output is correct
4 Correct 24 ms 1108 KB Output is correct
5 Correct 26 ms 1108 KB Output is correct
6 Correct 24 ms 1108 KB Output is correct
7 Correct 25 ms 1108 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 23 ms 1108 KB Output is correct
12 Execution timed out 8053 ms 1116 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -