//DUEL
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define x first
#define y second
#define pii pair<int,int>
#define pb push_back
#define eb emplace_back
#define shandom_ruffle(a, b) shuffle(a, b, rng)
#define vi vector<int>
#define vl vector<ll>
#define popcnt __builtin_popcount
#define popcntll __builtin_popcountll
#define all(a) begin(a),end(a)
using namespace std;
using namespace __gnu_pbds;
using ll=long long;
using ull=unsigned long long;
using ld=long double;
int MOD=1000000007;
int MOD2=998244353;
vector<int> bases;
const ll LLINF=1ll<<60;
const char en='\n';
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void yes() {cout<<"YES"<<en; exit(0);}
void no() {cout<<"NO"<<en; exit(0);}
inline int rund() {int x576363482791fuweh=rng();return abs(x576363482791fuweh)%RAND_MAX;}
template<class T>
void prVec(vector<T> w,bool fl=false)
{
cout<<w.size()<<en;
for (int i=0;i<int(w.size())-1;++i) cout<<w[i]<<' ';
if (w.size()) cout<<w[w.size()-1]<<en;
if (fl) cout<<flush;
}
void M998()
{
swap(MOD,MOD2);
}
ll raand()
{
ll a=rund();
a*=RAND_MAX;
a+=rund();
return a;
}
#define rand raand
ll raaand()
{
return raand()*(MOD-7)+raand();
}
void compress(vi&v)
{
set<int> s;
for (auto a: v) s.insert(a);
vi o(all(s));
for (auto&a: v) a=lower_bound(all(o),a)-o.begin();
}
void compress(vl&v)
{
set<ll> s;
for (auto a: v) s.insert(a);
vl o(all(s));
for (auto&a: v) a=lower_bound(all(o),a)-o.begin();
}
string to_upper(string a)
{
for (int i=0;i<(int)a.size();++i) if (a[i]>='a' && a[i]<='z') a[i]-='a'-'A';
return a;
}
string to_lower(string a)
{
for (int i=0;i<(int)a.size();++i) if (a[i]>='A' && a[i]<='Z') a[i]+='a'-'A';
return a;
}
ll sti(string a,int base=10)
{
ll k=0;
for (int i=0;i<(int)a.size();++i)
{
k*=base;
k+=a[i]-'0';
}
return k;
}
template<class T>
void eras(vector<T>& a,T b)
{
a.erase(find(a.begin(),a.end(),b));
}
string its(ll k,int base=10)
{
if (k==0) return "0";
string a;
while (k)
{
a.push_back((k%base)+'0');
k/=base;
}
reverse(a.begin(),a.end());
return a;
}
ll min(ll a,int b)
{
if (a<b) return a;
return b;
}
ll min(int a,ll b)
{
if (a<b) return a;
return b;
}
ll max(ll a,int b)
{
if (a>b) return a;
return b;
}
ll max(int a,ll b)
{
if (a>b) return a;
return b;
}
ll gcd(ll a,ll b)
{
if (b==0) return a;
return gcd(b,a%b);
}
ll lcm(ll a,ll b)
{
return a/gcd(a,b)*b;
}
template<class T,class K>
pair<T,K> mp(T a,K b)
{
return make_pair(a,b);
}
inline int mult(ll a,ll b)
{
return (a*b)%MOD;
}
inline int pot(int n,int k)
{
if (k==0) return 1;
ll a=pot(n,k/2);
a=mult(a,a);
if (k%2) return mult(a,n);
else return a;
}
int divide(int a,int b)
{
return mult(a,pot(b,MOD-2));
}
inline int sub(int a,int b)
{
if (a-b>=0) return a-b;
return a-b+MOD;
}
inline int add(int a,int b)
{
if (a+b>=MOD) return a+b-MOD;
return a+b;
}
bool prime(ll a)
{
if (a==1) return 0;
for (int i=2;i<=round(sqrt(a));++i)
{
if (a%i==0) return 0;
}
return 1;
}
const int N=300010,MMM=1<<18,SI=230;
int b,n,d,ooooooooof,sss[MMM*2+10],fen[SI][SI];
int cnr[SI][SI][SI],cna[SI][SI][SI],cn2[SI][SI][SI];
void upd(int j,int i,int x)
{
//cout<<j<<' '<<i<<' '<<x<<endl;
for (++i;i<SI;i+=i&-i) fen[j][i]+=x;
}
int ge1(int j,int r)
{
int an=0;
//cout<<j<<' '<<r<<endl;
for (;r;r-=r&-r) an+=fen[j][r];
return an;
}
int ge2(int j,int l,int r)
{
r=min(r,SI-2);
l=max(l,0);
return ge1(j,r+1)-ge1(j,l);
}
void solve3()
{
const int MM=225;
vector<vector<pair<int,pii>>> im(MM+5);
vector<vector<pii>> pos(MM+5);
for (int i=0;i<n;++i)
{
int x,y,z;
cin>>x>>y>>z;
int a=x+y+z,b=x+y-z+75,c=x-y+z+75,d1=x-y-z+150;
im[a].pb({b,{c,d1}});
pos[b].pb({c,d1});
if (b+d+1<=MM) pos[b+d+1].pb({c,d1});
if (b-d>=0) pos[b-d].pb({c,d1});
//cout<<a<<' '<<b<<' '<<c<<' '<<d1<<en;
}
for (int i=0;i<=MM;++i)
{
sort(all(pos[i]));
pos[i].erase(unique(all(pos[i])),pos[i].end());
}
ll an=0;
for (int i=0;i<=MM;++i)
{
memset(fen,0,sizeof(fen));
for (int j=0;j<=MM;++j)
{
for (auto a: pos[j])
{
int k=a.x,l=a.y;
cn2[j][k][l]=0;
}
}
sort(all(im[i]));
for (auto a: im[i])
{
++cna[a.x][a.y.x][a.y.y];
++cn2[a.x][a.y.x][a.y.y];
//cout<<"U"<<a.x+d+1<<' '<<MM<<endl;
if (a.x+d+1<=MM) ++cnr[a.x+d+1][a.y.x][a.y.y];
}
if (i>d)
{
for (auto a: im[i-d-1])
{
--cna[a.x][a.y.x][a.y.y];
if (a.x+d+1<=MM) --cnr[a.x+d+1][a.y.x][a.y.y];
}
}
for (int j=0;j<=MM;++j)
{
for (auto a: pos[j])
{
int k=a.x,l=a.y;
int s=0;
if (cnr[j][k][l]) s-=cnr[j][k][l];
if (cna[j][k][l]-cn2[j][k][l]) s+=cna[j][k][l]-cn2[j][k][l];
if (s) upd(k,l,s);
}
for (auto a: pos[j])
{
int k=a.x,l=a.y;
if (cn2[j][k][l])
{
int an2=0;
for (int k1=max(0,k-d);k1<=min(MM,k+d);++k1)
{
//an2+=ge2(k1,l-d,l+d);
an+=ge2(k1,l-d,l+d)*1ll*cn2[j][k][l];
}
//cout<<i<<' '<<j<<' '<<k<<' '<<l<<' '<<an2<<endl;
upd(k,l,cn2[j][k][l]);
an+=cn2[j][k][l]*1ll*(cn2[j][k][l]-1)/2;
}
//if (cna[j][k][l]) upd(k,l,cna[j][k][l]);
}
}
continue;
}
//cout<<"BREAK "<<an<<endl;
memset(cna,0,sizeof(cna));
memset(cnr,0,sizeof(cnr));
for (int i=0;i<=MM;++i)
{
memset(fen,0,sizeof(fen));
for (int j=0;j<=MM;++j)
{
for (auto a: pos[j])
{
int k=a.x,l=a.y;
cn2[j][k][l]=0;
}
}
sort(all(im[i]));
if (i>d)
{
for (auto a: im[i-d-1])
{
--cna[a.x][a.y.x][a.y.y];
if (a.x-d>=0) --cnr[a.x-d][a.y.x][a.y.y];
}
}
for (auto a: im[i]) ++cn2[a.x][a.y.x][a.y.y];
for (int j=MM;j>=0;--j)
{
for (auto a: pos[j])
{
int k=a.x,l=a.y;
if (cn2[j][k][l])
{
int an2=0;
for (int k1=max(0,k-d);k1<=min(MM,k+d);++k1)
{
//an2+=ge2(k1,l-d,l+d);
an+=ge2(k1,l-d,l+d)*1ll*cn2[j][k][l];
}
//cout<<i<<' '<<j<<' '<<k<<' '<<l<<' '<<an2<<endl;
}
}
for (auto a: pos[j])
{
int k=a.x,l=a.y;
if (cna[j][k][l]-cnr[j][k][l]) upd(k,l,cna[j][k][l]-cnr[j][k][l]);
}
}
for (auto a: im[i])
{
++cna[a.x][a.y.x][a.y.y];
if (a.x-d>=0) ++cnr[a.x-d][a.y.x][a.y.y];
}
}
cout<<an<<en;
}
void uuu(int i,int x)
{
for (i+=MMM;i;i/=2) sss[i]+=x;
}
int ggg(int l,int r,int lo=0,int hi=MMM,int i=1)
{
if (lo>=l && hi<=r) return sss[i];
if (lo>=r || hi<=l) return 0;
int mid=(lo+hi)/2;
return ggg(l,r,lo,mid,i*2)+ggg(l,r,mid,hi,i*2+1);
}
void solve2()
{
const int MM=75000;
vector<vi> im(MM*2+10);
for (int i=0;i<n;++i)
{
int x,y;
cin>>x>>y;
int x1=x-y+MM,y1=x+y;
im[x1].pb(y1);
}
ll an=0;
for (int i=0;i<=MM*2;++i)
{
if (i>=d+1) for (auto a: im[i-d-1]) uuu(a,-1);
for (auto a: im[i])
{
an+=ggg(a-d,a+d+1);
uuu(a,1);
}
}
cout<<an<<en;
}
void solve1()
{
vi v(n);
for (auto&a: v) cin>>a;
sort(all(v));
int l=0;
ll an=0;
for (int i=1;i<n;++i)
{
while (v[i]-v[l]>d) ++l;
an+=i-l;
}
cout<<an<<en;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
for (int i=0;i<10;++i) bases.push_back(rand()%(MOD-13893829*2)+13893829);
//freopen("tc.txt","r",stdin);
cin>>b>>n>>d>>ooooooooof;
if (b==1) solve1();
if (b==2) solve2();
if (b==3) solve3();
}
Compilation message
pairs.cpp: In function 'void solve3()':
pairs.cpp:291:10: warning: unused variable 'an2' [-Wunused-variable]
291 | int an2=0;
| ^~~
pairs.cpp:337:10: warning: unused variable 'an2' [-Wunused-variable]
337 | int an2=0;
| ^~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
Output is correct |
| 2 |
Correct |
1 ms |
384 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
18 ms |
768 KB |
Output is correct |
| 2 |
Correct |
15 ms |
768 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
28 ms |
768 KB |
Output is correct |
| 2 |
Correct |
24 ms |
768 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
22 ms |
768 KB |
Output is correct |
| 2 |
Correct |
27 ms |
768 KB |
Output is correct |
| 3 |
Correct |
19 ms |
768 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
5120 KB |
Output is correct |
| 2 |
Correct |
8 ms |
5120 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
52 ms |
4556 KB |
Output is correct |
| 2 |
Correct |
44 ms |
4560 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
58 ms |
4704 KB |
Output is correct |
| 2 |
Correct |
53 ms |
4608 KB |
Output is correct |
| 3 |
Correct |
52 ms |
4600 KB |
Output is correct |
| 4 |
Correct |
51 ms |
4608 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
106 ms |
7032 KB |
Output is correct |
| 2 |
Correct |
92 ms |
7032 KB |
Output is correct |
| 3 |
Correct |
56 ms |
5752 KB |
Output is correct |
| 4 |
Correct |
59 ms |
5752 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
105 ms |
105080 KB |
Output is correct |
| 2 |
Correct |
77 ms |
99580 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
117 ms |
100572 KB |
Output is correct |
| 2 |
Correct |
122 ms |
101624 KB |
Output is correct |
| 3 |
Correct |
134 ms |
102392 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2254 ms |
117112 KB |
Output is correct |
| 2 |
Correct |
2969 ms |
126928 KB |
Output is correct |
| 3 |
Correct |
1958 ms |
117964 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3561 ms |
130784 KB |
Output is correct |
| 2 |
Execution timed out |
4093 ms |
137080 KB |
Time limit exceeded |
| 3 |
Halted |
0 ms |
0 KB |
- |
