oj.uz

답안 #888254

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
888254 2023-12-16T16:49:38 Z Macker Pairs (IOI07_pairs) C++17
30 / 100
 182 ms 31040 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
#define all(v) v.begin(), v.end()
#define pii pair<int, int>

class Seg{
    vector<ll> st;
    int len = 1;

public:
    Seg(int n){
        while(len < n) len *= 2;
        st.resize(len * 2, 0);
    }

    void add(int idx, ll val, int i, int s, int e){
        if(idx < s || idx >= e) return;
        if(idx == s && s + 1 == e){
            st[i] += val;
            return;
        }
        add(idx, val, i * 2, s, (s + e) / 2);
        add(idx, val, i * 2 + 1, (s + e) / 2, e);
        st[i] = st[i * 2] + st[i * 2 + 1];
    }
    void add(int idx, ll val){
        add(idx, val, 1, 0, len);
    }

    ll qry(int l, int r, int i, int s, int e){
        if(l >= e || s >= r) return 0;
        if(l <= s && e <= r) return st[i];
        return qry(l, r, i * 2, s, (s + e) / 2) + qry(l, r, i * 2 + 1, (s + e) / 2, e);
    }
    ll qry(int l, int r){
        return qry(l, r, 1, 0, len);
    }
};

int d;
vector<int> coords;

int cmpr(int x){
    return lower_bound(all(coords), x) - coords.begin();
}

tuple<int, int, int> cget(int x, int y){
    if((x + y) % 2 == 1) return {1, (x + y + 1) / 2 + d, (x - y + 1) / 2 + d};
    else return {0, (x + y) / 2 + d, (x - y) / 2 + d};
}

int main()
{
    int b, n, m; cin >> b >> n >> d >> m;
    if(b == 1){
        vector<pair<int, int>> q;
        vector<int> ad;
        for (int i = 0; i < n; i++) {
            int a; cin >> a;
            ad.push_back(a);
            q.push_back({a - d, a + d});
            coords.push_back(a);
            coords.push_back(a - d);
            coords.push_back(a + d);
        }
        sort(all(coords));
        Seg st(coords.size() + 1);
        for (auto &i : ad)
            st.add(cmpr(i), 1);
        
        ll res = 0;
        for (auto &[f, t] : q)
            res += st.qry(cmpr(f), cmpr(t) + 1) - 1;
        
        cout << res / 2 << endl;
    }
    if(b == 2){
        vector<array<int, 5>> evo; // t (0s, 1, 2e), y, x, xx, i
        vector<array<int, 5>> eve; // t (0s, 1, 2e), y, x, xx, i
        for (int i = 0; i < n; i++)
        {
            int sx, sy; cin >> sx >> sy;
            int p, x, y; tie(p, x, y) = cget(sx, sy);
            if(p == 0) eve.push_back({x, 1, y, -1, -1});
            else evo.push_back({x, 1, y, -1, -1});

            for (int j = 0; j < 2; j++)
            {    
                pii up, ri, dw, lf;
                up = {sx, sy + d - j};
                ri = {sx + d - j, sy};
                dw = {sx, sy - d + j};
                lf = {sx - d + j, sy};
                tie(p, up.first, up.second) = cget(up.first, up.second);
                tie(p, ri.first, ri.second) = cget(ri.first, ri.second);
                tie(p, dw.first, dw.second) = cget(dw.first, dw.second);
                tie(p, lf.first, lf.second) = cget(lf.first, lf.second);
                if(p == 0){
                    eve.push_back({up.first, 2, ri.second, up.second, i});
                    eve.push_back({dw.first, 0, dw.second, up.second, i});
                }
                else{
                    evo.push_back({up.first, 2, ri.second, up.second, i});
                    evo.push_back({dw.first, 0, dw.second, up.second, i});
                }
            }
        }
        
        ll res = 0;
        for (auto &ev : vector<vector<array<int, 5>>>({eve, evo})) {
            sort(all(ev));
            Seg st(m + d + 3);
            for (auto &e : ev) {
                auto& [y, t, x, xx, i] = e;
                if(t == 1){
                    st.add(x, 1);
                }
                if(t == 0){
                    res -= st.qry(xx, x + 1);
                }
                if(t == 2){
                    res += st.qry(xx, x + 1);
                }
            }
        }
        cout << (res - n) / 2 << endl;
    }
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 102 ms 11888 KB Output is correct
2 Correct 104 ms 11888 KB Output is correct

Subtask #4
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 126 ms 12092 KB Output is correct
2 Correct 124 ms 12096 KB Output is correct

Subtask #5
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 126 ms 12256 KB Output is correct
2 Correct 137 ms 12276 KB Output is correct
3 Correct 123 ms 12272 KB Output is correct

Subtask #6
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 2652 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 142 ms 30484 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 149 ms 30568 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 182 ms 31040 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #11
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #12
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #13
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -