| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 866549 |
2023-10-26T11:07:09 Z |
Rifal |
Wish (LMIO19_noras) |
C++14 |
|
69 ms |
604 KB |
#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 = 4e4;
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 = 1; 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 time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
500 KB |
Output is correct |
| 3 |
Correct |
65 ms |
464 KB |
Output is correct |
| 4 |
Correct |
69 ms |
344 KB |
Output is correct |
| 5 |
Correct |
64 ms |
348 KB |
Output is correct |
| 6 |
Correct |
66 ms |
604 KB |
Output is correct |
| 7 |
Incorrect |
63 ms |
348 KB |
Output isn't correct |
| 8 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
500 KB |
Output is correct |
| 3 |
Correct |
65 ms |
464 KB |
Output is correct |
| 4 |
Correct |
69 ms |
344 KB |
Output is correct |
| 5 |
Correct |
64 ms |
348 KB |
Output is correct |
| 6 |
Correct |
66 ms |
604 KB |
Output is correct |
| 7 |
Incorrect |
63 ms |
348 KB |
Output isn't correct |
| 8 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
500 KB |
Output is correct |
| 3 |
Correct |
65 ms |
464 KB |
Output is correct |
| 4 |
Correct |
69 ms |
344 KB |
Output is correct |
| 5 |
Correct |
64 ms |
348 KB |
Output is correct |
| 6 |
Correct |
66 ms |
604 KB |
Output is correct |
| 7 |
Incorrect |
63 ms |
348 KB |
Output isn't correct |
| 8 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
500 KB |
Output is correct |
| 3 |
Correct |
65 ms |
464 KB |
Output is correct |
| 4 |
Correct |
69 ms |
344 KB |
Output is correct |
| 5 |
Correct |
64 ms |
348 KB |
Output is correct |
| 6 |
Correct |
66 ms |
604 KB |
Output is correct |
| 7 |
Incorrect |
63 ms |
348 KB |
Output isn't correct |
| 8 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
500 KB |
Output is correct |
| 3 |
Correct |
65 ms |
464 KB |
Output is correct |
| 4 |
Correct |
69 ms |
344 KB |
Output is correct |
| 5 |
Correct |
64 ms |
348 KB |
Output is correct |
| 6 |
Correct |
66 ms |
604 KB |
Output is correct |
| 7 |
Incorrect |
63 ms |
348 KB |
Output isn't correct |
| 8 |
Halted |
0 ms |
0 KB |
- |
