제출 #333230

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
333230		CodeTiger927	Pairs (IOI07_pairs)	C++14	72 / 100	4070 ms	524292 KiB

pairs

using namespace std;

#include <iostream>

int B,D,N,M;

struct node1d {
    int l,r,v;
    node1d *c[2];
    node1d(int l,int r) : l{l}, r{r} {
        v = 0;
        c[0] = nullptr;
        c[1] = nullptr;
    } 
    void upd(int x,int v) {
        this -> v += v;
        if(l != r) {
            int m = (l + r) >> 1;
            if(x <= m) {
                if(!c[0]) c[0] = new node1d(l,m);
                c[0] -> upd(x,v);
            }else{
                if(!c[1]) c[1] = new node1d(m + 1,r);
                c[1] -> upd(x,v);
            }
        }
    }
    int qry(int x,int y) {
        if(x <= l && r <= y) return v;
        if(y < l || x > r) return 0;
        int res = 0;
        if(c[0]) res += c[0] -> qry(x,y);
        if(c[1]) res += c[1] -> qry(x,y);
        return res;
    }
};

struct node2d {
    int l,r;
    node1d* v;
    node2d *c[2];
    node2d(int l,int r) : l{l}, r{r} {
        if(B == 3) {
        	v = new node1d(0,160);
        }else{
      		v = new node1d(0,160000);
        }
        c[0] = nullptr;
        c[1] = nullptr;
    } 
    void upd(int x,int y,int v) {
        this -> v -> upd(y,v);
        if(l != r) {
            int m = (l + r) >> 1;
            if(x <= m) {
                if(!c[0]) c[0] = new node2d(l,m);
                c[0] -> upd(x,y,v);
            }else{
                if(!c[1]) c[1] = new node2d(m + 1,r);
                c[1] -> upd(x,y,v);
            }
        }
    }
    int qry(int x1,int x2,int y1,int y2) {
        if(x1 <= l && r <= x2) return v -> qry(y1,y2);
        if(x2 < l || x1 > r) return 0;
        int res = 0;
        if(c[0]) res += c[0] -> qry(x1,x2,y1,y2);
        if(c[1]) res += c[1] -> qry(x1,x2,y1,y2);
        return res;
    }
};

int main() {
	cin >> B >> N >> D >> M;
	long long ans = 0;
	if(B == 1) {
		node1d* st = new node1d(0,75000005);
		for(int i = 0;i < N;++i) {
			int a;
			cin >> a;
			ans += st -> qry(max(0,a - D),a + D);
			st -> upd(a,1);
		}
	}else if(B == 2) {
		node2d* st = new node2d(0,160000);
		for(int i = 0;i < N;++i) {
			int c,d;
			cin >> c >> d;
			int a = (c + d);
			int b = (c - d) + 80000;
			ans += st -> qry(max(0,a - D),a + D,max(0,b - D),b + D);
			st -> upd(a,b,1);
		}
	}else{
		node2d* st[80];
		for(int i = 0;i < 80;++i) {
			st[i] = new node2d(0,160);
		}
		for(int i = 0;i < N;++i) {
			int d,e,f;
			cin >> d >> e >> f;
			int a = (d + e);
			int b = (d - e) + 80;
			int c = f;
			// cout << a << " " << b << " " << c << endl;
			for(int j = 0;j < 80;++j) {
				int curD = D - abs(c - j);
				if(curD < 0) continue;
				ans += st[j] -> qry(max(0,a - curD),a + curD,max(0,b - curD),b + curD);
			}
			st[c] -> upd(a,b,1);
		}
		
	}
	cout << ans << endl;
	return 0;
}

• Subtask 1: 6 / 6
• Subtask 2: 6 / 6
• Subtask 3: 6 / 6
• Subtask 4: 6 / 6
• Subtask 5: 6 / 6
• Subtask 6: 7 / 7
• Subtask 7: 7 / 7
• Subtask 8: 8 / 8
• Subtask 9: 0 / 8
• Subtask 10: 10 / 10
• Subtask 11: 10 / 10
• Subtask 12: 0 / 10
• Subtask 13: 0 / 10