oj.uz

Submission #912322

# Submission time Handle Problem Language Result Execution time Memory
912322 2024-01-19T10:00:17 Z vjudge1 Wish (LMIO19_noras) C++17
38 / 100
 1000 ms 6944 KB 
#include <bits/stdc++.h>
#define f first
#define s second	
#define ent '\n'
#define int long long

#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")

using namespace std;
typedef long long ll;
const int mx=1e6+12;
const int mod=1e9+7;
int dx[]={1,-1,0,0,1,-1,1,-1};
int dy[]={0,0,1,-1,1,-1,-1,1};

int cal[mx];
int L[mx];
int R[mx];
int x[mx];
int y[mx];
int a[mx];
int b[mx];
int n,m,k;

bool check(int x,int y){
	if(max(x,y)>k)return 0;
	return x*x+y*y<=k*k;
}

bool check(int x1,int y1,int x2,int y2){
	__int128 val=(__int128)x1*(__int128)x1+(__int128)y1*(__int128)y1;
	__int128 cal=(__int128)x2*(__int128)x2+(__int128)y2*(__int128)y2;
	if(val>=cal)return 1;
	return 0;
}

void Press_Fn_with_F11(){
	cin>>n>>k;
	int ans=0;
	for(int i=1;i<=n;i++){
		cin>>x[i]>>y[i]>>a[i]>>b[i];
		a[i]-=x[i];
		b[i]-=y[i];
		int l=0,r=2e9,pos0=0;
		while(r-l>10){
			int m1=l+(r-l)/3,m2=r-(r-l)/3;
			if(check(x[i]+m1*a[i],y[i]+m1*b[i],x[i]+m2*a[i],y[i]+m2*b[i])){
				l=m1;
			}
			else r=m2;
		}
		pos0=l;
		for(int v=l+1;v<=r;v++){
			if(check(pos0*a[i]+x[i],pos0*b[i]+y[i],v*a[i]+x[i],v*b[i]+y[i])){
				pos0=v;
			}
		}
		if(!check(x[i]+pos0*a[i],y[i]+pos0*b[i])){
			continue;
		}
		int L=pos0,R=pos0;
		for(int l=0,r=pos0;l<=r;){
			int mid=l+r>>1;
			if(check(mid*a[i]+x[i],mid*b[i]+y[i])){
				L=mid;
				r=mid-1;
			}
			else l=mid+1;
		}
		for(int l=pos0,r=2e9;l<=r;){
			int mid=l+r>>1;
			if(check(mid*a[i]+x[i],mid*b[i]+y[i])){
				R=mid;
				l=mid+1;
			}
			else r=mid-1;
		}
		int mnl=1e18,mnr=-1e18;
		for(int h=L;h<=min(R,(int)4e4);h++){
			if(check(x[i]+a[i]*h,y[i]+b[i]*h)){
				ans=max(ans,++cal[h]);
				assert(h>=L && h<=R);
				mnl=min(mnl,h);
				mnr=min(mnr,h);
			}
			assert(check(x[i]+a[i]*h,y[i]+b[i]*h,pos0*a[i]+x[i],pos0*b[i]+y[i]));
		}
		assert(L==mnl);
	}
	cout<<ans<<ent;
	
}

signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int Alikhan_abi_crush=1;
	// cin>>Alikhan_abi_crush;
	while(Alikhan_abi_crush--){
		Press_Fn_with_F11();
	}
}

Compilation message

noras.cpp: In function 'void Press_Fn_with_F11()':
noras.cpp:64:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   64 |    int mid=l+r>>1;
      |            ~^~
noras.cpp:72:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   72 |    int mid=l+r>>1;
      |            ~^~

Subtask #1
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 2 ms 6492 KB Output is correct
3 Correct 34 ms 6640 KB Output is correct
4 Correct 29 ms 6644 KB Output is correct
5 Correct 32 ms 6632 KB Output is correct
6 Correct 32 ms 6492 KB Output is correct
7 Correct 30 ms 6628 KB Output is correct
8 Correct 1 ms 6608 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 2 ms 6492 KB Output is correct
11 Correct 2 ms 6492 KB Output is correct
12 Correct 3 ms 6492 KB Output is correct
13 Correct 2 ms 6492 KB Output is correct
14 Correct 3 ms 6492 KB Output is correct
15 Correct 3 ms 6492 KB Output is correct
16 Correct 3 ms 6492 KB Output is correct
17 Correct 3 ms 6492 KB Output is correct
18 Correct 3 ms 6492 KB Output is correct
19 Correct 14 ms 6644 KB Output is correct
20 Correct 20 ms 6492 KB Output is correct
21 Correct 26 ms 6488 KB Output is correct
22 Correct 26 ms 6648 KB Output is correct

Subtask #2
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 2 ms 6492 KB Output is correct
3 Correct 34 ms 6640 KB Output is correct
4 Correct 29 ms 6644 KB Output is correct
5 Correct 32 ms 6632 KB Output is correct
6 Correct 32 ms 6492 KB Output is correct
7 Correct 30 ms 6628 KB Output is correct
8 Correct 1 ms 6608 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 2 ms 6492 KB Output is correct
11 Correct 2 ms 6492 KB Output is correct
12 Correct 3 ms 6492 KB Output is correct
13 Correct 2 ms 6492 KB Output is correct
14 Correct 3 ms 6492 KB Output is correct
15 Correct 3 ms 6492 KB Output is correct
16 Correct 3 ms 6492 KB Output is correct
17 Correct 3 ms 6492 KB Output is correct
18 Correct 3 ms 6492 KB Output is correct
19 Correct 14 ms 6644 KB Output is correct
20 Correct 20 ms 6492 KB Output is correct
21 Correct 26 ms 6488 KB Output is correct
22 Correct 26 ms 6648 KB Output is correct
23 Execution timed out 1051 ms 6944 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 2 ms 6492 KB Output is correct
3 Correct 34 ms 6640 KB Output is correct
4 Correct 29 ms 6644 KB Output is correct
5 Correct 32 ms 6632 KB Output is correct
6 Correct 32 ms 6492 KB Output is correct
7 Correct 30 ms 6628 KB Output is correct
8 Correct 1 ms 6608 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 2 ms 6492 KB Output is correct
11 Correct 2 ms 6492 KB Output is correct
12 Correct 3 ms 6492 KB Output is correct
13 Correct 2 ms 6492 KB Output is correct
14 Correct 3 ms 6492 KB Output is correct
15 Correct 3 ms 6492 KB Output is correct
16 Correct 3 ms 6492 KB Output is correct
17 Correct 3 ms 6492 KB Output is correct
18 Correct 3 ms 6492 KB Output is correct
19 Correct 14 ms 6644 KB Output is correct
20 Correct 20 ms 6492 KB Output is correct
21 Correct 26 ms 6488 KB Output is correct
22 Correct 26 ms 6648 KB Output is correct
23 Correct 2 ms 6492 KB Output is correct
24 Correct 97 ms 6628 KB Output is correct
25 Correct 3 ms 6492 KB Output is correct
26 Correct 5 ms 6492 KB Output is correct
27 Correct 22 ms 6492 KB Output is correct
28 Correct 36 ms 6492 KB Output is correct

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 2 ms 6492 KB Output is correct
3 Correct 34 ms 6640 KB Output is correct
4 Correct 29 ms 6644 KB Output is correct
5 Correct 32 ms 6632 KB Output is correct
6 Correct 32 ms 6492 KB Output is correct
7 Correct 30 ms 6628 KB Output is correct
8 Correct 1 ms 6608 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 2 ms 6492 KB Output is correct
11 Correct 2 ms 6492 KB Output is correct
12 Correct 3 ms 6492 KB Output is correct
13 Correct 2 ms 6492 KB Output is correct
14 Correct 3 ms 6492 KB Output is correct
15 Correct 3 ms 6492 KB Output is correct
16 Correct 3 ms 6492 KB Output is correct
17 Correct 3 ms 6492 KB Output is correct
18 Correct 3 ms 6492 KB Output is correct
19 Correct 14 ms 6644 KB Output is correct
20 Correct 20 ms 6492 KB Output is correct
21 Correct 26 ms 6488 KB Output is correct
22 Correct 26 ms 6648 KB Output is correct
23 Execution timed out 1051 ms 6944 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #5
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 2 ms 6492 KB Output is correct
3 Correct 34 ms 6640 KB Output is correct
4 Correct 29 ms 6644 KB Output is correct
5 Correct 32 ms 6632 KB Output is correct
6 Correct 32 ms 6492 KB Output is correct
7 Correct 30 ms 6628 KB Output is correct
8 Correct 1 ms 6608 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 2 ms 6492 KB Output is correct
11 Correct 2 ms 6492 KB Output is correct
12 Correct 3 ms 6492 KB Output is correct
13 Correct 2 ms 6492 KB Output is correct
14 Correct 3 ms 6492 KB Output is correct
15 Correct 3 ms 6492 KB Output is correct
16 Correct 3 ms 6492 KB Output is correct
17 Correct 3 ms 6492 KB Output is correct
18 Correct 3 ms 6492 KB Output is correct
19 Correct 14 ms 6644 KB Output is correct
20 Correct 20 ms 6492 KB Output is correct
21 Correct 26 ms 6488 KB Output is correct
22 Correct 26 ms 6648 KB Output is correct
23 Execution timed out 1051 ms 6944 KB Time limit exceeded
24 Halted 0 ms 0 KB -