제출 #638402

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
638402		LeticiaFCS	Wish (LMIO19_noras)	C++17	93 / 100	141 ms	18944 KiB

noras

#include "bits/stdc++.h"
#define st first
#define nd second
using lint = int64_t;
constexpr int MOD = int(1e9) + 7;
constexpr int INF = 0x3f3f3f3f;
constexpr int NINF = 0xcfcfcfcf;
constexpr lint LINF = 0x3f3f3f3f3f3f3f3f;
const long double PI = acosl(-1.0);
// Returns -1 if a < b, 0 if a = b and 1 if a > b.
int cmp_double(double a, double b = 0, double eps = 1e-9) {
	return a + eps > b ? b + eps > a ? 0 : 1 : -1;
}
using namespace std;


using ld = long double;




vector<lint> intersection(lint x, lint y, lint dx, lint dy, lint r){
	vector<lint> answer;
	
	lint a = (dx*dx + dy*dy);
	lint b = (2*x*dx + 2*y*dy);
	lint c = -(r*r - x*x - y*y);
	lint delta = b*b - 4*a*c;
	
	if(delta < 0) return answer;
	if(delta == 0){
		ld t = ld(-b) / ld(2*a);
		answer = {ceil(t), floor(t)};
		return answer;
	}
	answer = {ceil( ( ld(-b) - sqrtl((ld)delta))/ ld(2*a) ),
		floor( (ld(-b) + sqrtl((ld)delta))/ ld(2*a) )
	};
	if(answer[0] > answer[1]) answer = {};
	if(answer.back() < 0) answer = {};
	else if(answer[0] < 0) answer[0] = 0;
	
	return answer;
}

vector<lint> comprTime;

int main() {
	cin.tie(nullptr)->sync_with_stdio(false);
	comprTime = {-1};
	int n, r; cin>>n>>r;
	vector<vector<lint>> stars;
	for(int i=0; i<n; i++){
		int x1, y1, x2, y2;
		cin>>x1>>y1>>x2>>y2;
		auto v = intersection(x1, y1, x2-x1, y2-y1, r);
		if(!v.empty()){
			stars.push_back(v);
			comprTime.push_back(v[0]);
			comprTime.push_back(v[1]);
		}
	}
	sort(comprTime.begin(), comprTime.end());
	comprTime.resize(distance(
		comprTime.begin(),
		unique(comprTime.begin(), comprTime.end())	
	));
	comprTime.push_back(comprTime.back()+1);
	
	vector<lint> pref(comprTime.size());
	for(auto star : stars){
		int l = lower_bound(comprTime.begin(),comprTime.end(), star[0]) - comprTime.begin();
		int r = upper_bound(comprTime.begin(),comprTime.end(), star[1]) - comprTime.begin();
		pref[l]++;
		pref[r]--;
	}
	for(int i=1; i<int(comprTime.size()); i++)
		pref[i] += pref[i-1];
	cout<<*max_element(pref.begin(), pref.end())<<"\n";
	

	return 0;
}
/*
[  ]Leu o problema certo???
[  ]Ver se precisa de long long
[  ]Viu o limite dos fors (é n? é m?)
[  ]Tamanho do vetor, será que é 2e5 em vez de 1e5??
[  ]Testar sample
[  ]Testar casos de  borda
[  ]1LL no 1LL << i
[  ]Testar mod (é 1e9+7, mesmo?, será que o mod não ficou negativo?)
*/

컴파일 시 표준 에러 (stderr) 메시지

noras.cpp: In function 'std::vector<long int> intersection(lint, lint, lint, lint, lint)':
noras.cpp:33:17: warning: narrowing conversion of 'std::ceil(t)' from 'long double' to 'long int' [-Wnarrowing]
   33 |   answer = {ceil(t), floor(t)};
      |             ~~~~^~~
noras.cpp:33:17: warning: narrowing conversion of 'std::ceil(t)' from 'long double' to 'long int' [-Wnarrowing]
noras.cpp:33:27: warning: narrowing conversion of 'std::floor(t)' from 'long double' to 'long int' [-Wnarrowing]
   33 |   answer = {ceil(t), floor(t)};
      |                      ~~~~~^~~
noras.cpp:33:27: warning: narrowing conversion of 'std::floor(t)' from 'long double' to 'long int' [-Wnarrowing]
noras.cpp:36:16: warning: narrowing conversion of 'std::ceil((((ld)-(b) - sqrtl((ld)delta)) / (ld)(2 * a)))' from 'long double' to 'long int' [-Wnarrowing]
   36 |  answer = {ceil( ( ld(-b) - sqrtl((ld)delta))/ ld(2*a) ),
      |            ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
noras.cpp:36:16: warning: narrowing conversion of 'std::ceil((((ld)-(b) - sqrtl((ld)delta)) / (ld)(2 * a)))' from 'long double' to 'long int' [-Wnarrowing]
noras.cpp:37:8: warning: narrowing conversion of 'std::floor((((ld)-(b) + sqrtl((ld)delta)) / (ld)(2 * a)))' from 'long double' to 'long int' [-Wnarrowing]
   37 |   floor( (ld(-b) + sqrtl((ld)delta))/ ld(2*a) )
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
noras.cpp:37:8: warning: narrowing conversion of 'std::floor((((ld)-(b) + sqrtl((ld)delta)) / (ld)(2 * a)))' from 'long double' to 'long int' [-Wnarrowing]

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