Submission #866550

#TimeUsernameProblemLanguageResultExecution timeMemory
866550RifalWish (LMIO19_noras)C++14
38 / 100
1064 ms4956 KiB
#include <bits/stdc++.h> #include <fstream> #define endl '\n' #define mod 998244353 #define INF 900000000000000000 //#define cin fin //#define cout fout #define fi first #define se second using namespace std; //ofstream fout("intel.out"); //ifstream fin("intel.in"); const int Max = 5e4; struct Point{ long long x1, x2, y1, y2; }; int main() { ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0); long long n, r; cin >> n >> r; Point arr[n]; for(int i = 0; i < n; i++) { cin >> arr[i].x1 >> arr[i].y1 >> arr[i].x2 >> arr[i].y2; } long long ans = 0; for(long long i = 0; i <= Max; i++) { long long sum = 0; for(int j = 0; j < n; j++) { pair<long long, long long> cur; cur.first = arr[j].x1 + (arr[j].x2-arr[j].x1)*i; cur.second = arr[j].y1 + (arr[j].y2-arr[j].y1)*i; if((cur.first*cur.first+cur.second*cur.second) <= r*r) { sum++; } } ans = max(sum,ans); } cout << ans; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...