oj.uz

Submission #416926

# Submission time Handle Problem Language Result Execution time Memory
416926 2021-06-03T07:28:54 Z codebuster_10 Pairs (IOI07_pairs) C++17
52 / 100
 4000 ms 368216 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
}

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;
}

const int MAX_M = 6 * 75000;
unordered_map<int,int> bit[MAX_M];
void solve2(){
	
	auto get_x = [&](int x, int y) -> int {
		return x - y + M;
	};
	
	auto get_y = [&](int x,int y) -> int {
		return x + y - 1;
	};
	
	auto upd = [&](int _x,int _y) -> void {
		//__f("_x,_y",_x,_y);
		for(int x = _x; x < 2 * M; x += (x&(-x))){
			for(int y = _y; y < 2 * M; y += (y&(-y))){
				++bit[x][y];
			}
		}
	};
	
	auto query = [&](int _x,int _y) -> int {
		int ans = 0;
		for(int x = _x; x; x -= (x&(-x))){
			for(int y = _y; y; y -= (y&(-y))){
				ans += bit[x][y];	
			}
		}
		return ans;
	};
	
	auto make_good = [&](int &x,int &y) -> void {
		if(x <= 0) x = 1;
		if(y <= 0) y = 1; 
		if(x >= 2 * M) x = 2 * M - 1;
		if(y >= 2 * M) y = 2 * M - 1;
	};
	
	auto get = [&](int x,int y,int D) -> int {
		int x1 = x + D, y1 = y + D;// upper right
		int x2 = x - D, y2 = y + D;// upper left
		int x3 = x + D, y3 = y - D;// lower right
		int x4 = x - D, y4 = y - D;// lower left
		make_good(x1,y1);
		make_good(x2,y2);
		make_good(x3,y3);
		make_good(x4,y4);
		return query(x1,y1) + query(x4-1,y4-1) - query(x2-1,y2) - query(x3,y3-1);
	};
	vt<pr<int,int>> points;
	f(i,0,N){
		int x,y;
		rd(x,y);
		points.eb(x,y);
		upd(get_x(x,y), get_y(x,y));
	}
	int ans = 0;
	
	for(auto [_x,_y] : points){
		int x = get_x(_x, _y), y = get_y(_x, _y);
		int tmp = get(x,y,D) - 1;
		//__f("tmp",tmp);
		ans += tmp;
	}
	cout << ans/2 << endl;
}

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 18 ms 24884 KB Output is correct
2 Correct 19 ms 24896 KB Output is correct

Subtask #2
6.0 / 6.0

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

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 25712 KB Output is correct
2 Correct 35 ms 25664 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 25676 KB Output is correct
2 Correct 40 ms 25744 KB Output is correct

Subtask #5
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 25700 KB Output is correct
2 Correct 43 ms 25652 KB Output is correct
3 Correct 41 ms 25676 KB Output is correct

Subtask #6
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 33764 KB Output is correct
2 Correct 83 ms 37360 KB Output is correct

Subtask #7
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 170 ms 27612 KB Output is correct
2 Correct 113 ms 28252 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2001 ms 81760 KB Output is correct
2 Correct 1769 ms 83496 KB Output is correct
3 Correct 1568 ms 69936 KB Output is correct
4 Correct 1464 ms 73808 KB Output is correct

Subtask #9
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4089 ms 368216 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

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

Subtask #11
0 / 10.0

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

Subtask #12
0 / 10.0

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

Subtask #13
0 / 10.0

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