oj.uz

Submission #417065

# Submission time Handle Problem Language Result Execution time Memory
417065 2021-06-03T11:19:19 Z codebuster_10 Pairs (IOI07_pairs) C++17
100 / 100
 395 ms 37348 KB 
#include <bits/stdc++.h>

using namespace std ;

#define int int64_t //be careful about this 
#define endl "\n"
#define f(i,a,b) for(int i=int(a);i<int(b);++i)

#define pr pair
#define ar array
#define fr first
#define sc second
#define vt vector
#define pb push_back
#define eb emplace_back
#define LB lower_bound  
#define UB upper_bound
#define PQ priority_queue

#define sz(x) ((int)(x).size())
#define all(a) (a).begin(),(a).end()
#define allr(a) (a).rbegin(),(a).rend()
#define mem0(a) memset(a, 0, sizeof(a))
#define mem1(a) memset(a, -1, sizeof(a))

template<class A> void rd(vt<A>& v);
template<class T> void rd(T& x){ cin >> x; }
template<class H, class... T> void rd(H& h, T&... t) { rd(h) ; rd(t...) ;}
template<class A> void rd(vt<A>& x) { for(auto& a : x) rd(a) ;}

template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

template<typename T>
void __p(T a) {
  cout<<a; 
}
template<typename T, typename F>
void __p(pair<T, F> a) {
  cout<<"{";
  __p(a.first);
  cout<<",";
  __p(a.second);
  cout<<"}\n"; 
}
template<typename T>
void __p(std::vector<T> a) {
  cout<<"{";
  for(auto it=a.begin(); it<a.end(); it++)
    __p(*it),cout<<",}\n"[it+1==a.end()]; 
}
template<typename T, typename ...Arg>
void __p(T a1, Arg ...a) {
  __p(a1);
  __p(a...);
}
template<typename Arg1>
void __f(const char *name, Arg1 &&arg1) {
  cout<<name<<" : ";
  __p(arg1);
  cout<<endl;
}
template<typename Arg1, typename ... Args>
void __f(const char *names, Arg1 &&arg1, Args &&... args) {
  int bracket=0,i=0;
  for(;; i++)
    if(names[i]==','&&bracket==0)
      break;
    else if(names[i]=='(')
      bracket++;
    else if(names[i]==')')
      bracket--;
  const char *comma=names+i;
  cout.write(names,comma-names)<<" : ";
  __p(arg1);
  cout<<" | ";
  __f(comma+1,args...);
}

void setIO(string s = "") {
  ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); 
  cin.exceptions(cin.failbit); 
	cout.precision(15);	cout << fixed;
  #ifdef ONLINE_JUDGE
  if(sz(s)){
  	freopen((s+".in").c_str(),"r",stdin);
  	freopen((s+".out").c_str(),"w",stdout);
  }
  #define __f(...) 0
  #endif
}

template <class T, int ...Ns> struct BIT {
	T val = 0; void upd(T v) { val += v; }
	T query() { return val; }
};
template <class T, int N, int... Ns> struct BIT<T, N, Ns...> {
	BIT<T,Ns...> bit[N+1];
	template<typename... Args> void upd(int pos, Args... args) { assert(pos > 0);
		for (; pos<=N; pos+=pos&-pos) bit[pos].upd(args...); }
	template<typename... Args> T sum(int r, Args... args) {
		T res=0; for (;r;r-=r&-r) res += bit[r].query(args...); 
		return res; }
	template<typename... Args> T query(int l, int r, Args... 
		args) { return sum(r,args...)-sum(l-1,args...); }
}; 



int B, N, D, M;


void solve1(){
	vt<int> p(N);
	rd(p);
	sort(all(p));
	int ans = 0;
	for(auto i : p){
		ans += UB(all(p),i+D) - LB(all(p),i-D) - 1;
	}
	cout << ans/2 << endl;
}




void solve2(){
	
	const int MAX_M = 3 * 75000;
	BIT<int,MAX_M> bit;
	
	auto get_x = [&](int x, int y) -> int {
		return x - y + M;
	};
	
	auto get_y = [&](int x,int y) -> int {
		return x + y - 1;
	};
	
	vt<ar<int,2>> points;
	f(i,0,N){
		int _x, _y;
		rd(_x, _y);
		int x = get_x(_x,_y), y = get_y(_x,_y);
		points.pb({x,y});
	}
	sort(all(points));
	int lo = 0, hi = -1, ans = 0;
	
	for(auto [x,y] : points){
		while(hi + 1 < N && points[hi + 1][0] - x <= D) bit.upd(points[++hi][1],1);
		while(lo < N && x - points[lo][0] > D) bit.upd(points[lo++][1],-1);
		int L = max(int(1),y-D), R = min(2*M-1,y+D);
		ans += bit.query(L,R) - 1;
	}
	cout << ans/2 << endl;
}
#undef int
const int MAX_M = 330;
BIT<int,MAX_M,MAX_M,MAX_M> bit;
#define int int64_t
void solve3(){
	vt<ar<int,4>> a;
	f(i,0,N){
		int x,y,z;
		rd(x,y,z);
		a.pb({x+y+z+2*M,x+y-z+2*M,x-y+z+2*M,x-y-z+2*M});
	}
	sort(all(a));
	int lo = 0, hi = -1, ans = 0;
	f(i,0,N){
		while(hi + 1 < N && a[hi+1][0] - a[i][0] <= D) {
			++hi;
			bit.upd(a[hi][1], a[hi][2], a[hi][3], 1);
		}
		while (lo < N && a[i][0] - a[lo][0] > D) {
			bit.upd(a[lo][1], a[lo][2], a[lo][3], -1);
			lo++;
		}
		ans +=  bit.query(max(int(1), a[i][1] - D), min(a[i][1] + D, 4*M),
											 max(int(1), a[i][2] - D), min(a[i][2] + D, 4*M),
											 max(int(1), a[i][3] - D), min(a[i][3] + D, 4*M));
		--ans;
	}
	cout << ans/2;
}
signed main(){
  setIO();
  rd(B, N, D, M);
  if(B == 1){
  	solve1();
  }else if(B == 2){
  	solve2();
  }else{
  	solve3();
  }
  
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 1484 KB Output is correct
2 Correct 19 ms 1480 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 1876 KB Output is correct
2 Correct 25 ms 1868 KB Output is correct

Subtask #5
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 1872 KB Output is correct
2 Correct 26 ms 1868 KB Output is correct
3 Correct 24 ms 1868 KB Output is correct

Subtask #6
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2124 KB Output is correct
2 Correct 2 ms 2124 KB Output is correct

Subtask #7
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 4780 KB Output is correct
2 Correct 39 ms 4832 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 4992 KB Output is correct
2 Correct 41 ms 4936 KB Output is correct
3 Correct 42 ms 4964 KB Output is correct
4 Correct 40 ms 4936 KB Output is correct

Subtask #9
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 5056 KB Output is correct
2 Correct 50 ms 5088 KB Output is correct
3 Correct 43 ms 5044 KB Output is correct
4 Correct 42 ms 5056 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 15436 KB Output is correct
2 Correct 8 ms 15564 KB Output is correct

Subtask #11
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 158 ms 5840 KB Output is correct
2 Correct 120 ms 5868 KB Output is correct
3 Correct 83 ms 5864 KB Output is correct

Subtask #12
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 248 ms 26472 KB Output is correct
2 Correct 243 ms 26436 KB Output is correct
3 Correct 122 ms 26440 KB Output is correct

Subtask #13
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 395 ms 37348 KB Output is correct
2 Correct 328 ms 37196 KB Output is correct
3 Correct 139 ms 37292 KB Output is correct