제출 #912299

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
912299		vjudge1	Wish (LMIO19_noras)	C++17	38 / 100	1068 ms	6864 KiB

noras

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

void Press_Fn_with_F11(){
	cin>>n>>k;
	int t=2e4,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];
		for(int h=0;h<=2*t;h++){
			if(check(x[i]+a[i]*h,y[i]+b[i]*h)){
				ans=max(ans,++cal[h]);
			}
		}
	}
	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();
	}
}

• Subtask 1: 23 / 23
• Subtask 2: 0 / 23
• Subtask 3: 15 / 15
• Subtask 4: 0 / 32
• Subtask 5: 0 / 7