제출 #371013

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
371013		cheissmart	Pairs (IOI07_pairs)	C++14	30 / 100	26 ms	1664 KiB

pairs

#include <bits/stdc++.h>
#define IO_OP std::ios::sync_with_stdio(0); std::cin.tie(0);
#define F first
#define S second
#define V vector
#define PB push_back
#define MP make_pair
#define EB emplace_back
#define ALL(v) (v).begin(), (v).end()
#define debug(x) cerr << "Line(" << __LINE__ << ") -> " << #x << " is " << x << endl

using namespace std;

typedef long long ll;
typedef pair<int, int> pi;
typedef V<int> vi;

const int INF = 1e9 + 7;

int n, d, m;

void solve1() {
	vi a(n);
	for(int i = 0; i < n; i++) {
		cin >> a[i];
	}
	sort(ALL(a));
	ll ans = 0;
	for(int i = 0, j = 0; i < n; i++) {
		while(a[i] - a[j] > d) j++;
		assert(a[i] - a[j] <= d);
		ans += i - j;
	}
	cout << ans << '\n';
}

void solve2() {

}

int bit[76][76][76];

void add(int x, int y, int z, int val) {
	for(int i = x; i < 76; i += i & -i)
		for(int j = y; j < 76; j += j & -j)
			for(int k = z; k < 76; k += k & -k)
				bit[i][j][k] += val;
}

int qry(int x, int y, int z) {
	int res = 0;
	for(int i = x; i; i -= i & -i)
		for(int j = y; j; j -= j & -j)
			for(int k = z; k; k -= k & -k)
				res += bit[i][j][k];
	return res;
}

void solve3() {
	for(int i = 0; i < n; i++) {
		int x, y, z;
		cin >> x >> y >> z;
	}
}

signed main()
{
	IO_OP;

	int b;
	cin >> b >> n >> d >> m;
	if(b == 1) solve1();
	else if(b == 2) solve2();
	else solve3();


}

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