# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
626592 | mkisic | Wish (LMIO19_noras) | C++14 | 475 ms | 11960 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
#define X first
#define Y second
typedef long long ll;
typedef pair<long long, long long> pii;
const int MAXN = 2e5 + 5;
const ll INF = (1LL << 50) + 5;
const ll INF_binary = (1 << 30);
int n;
ll R;
vector<pii> dogadaji;
double udaljenost(pii T) { return sqrt((double)T.X * T.X + (double)T.Y * T.Y); }
pii izracunaj_tocku(ll x, ll y, ll sx, ll sy, ll t) {
ll x2 = min(INF, x + t * sx);
ll y2 = min(INF, y + t * sy);
// cerr << x2 << ' ' << y2 << '\n';
return {x2, y2};
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |