# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
26604 | kriii | Bulldozer (JOI17_bulldozer) | C++14 | 1477 ms | 188492 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 <stdio.h>
#include <algorithm>
using namespace std;
long long gcd(long long a, long long b)
{
return b ? gcd(b, a%b) : a;
}
int N; long long A, B;
struct point{
int x, y, c, i;
bool operator <(const point &t) const{
if (y != t.y) return y < t.y;
return x < t.x;
}
}P[2000];
int R[2000];
struct turn{
turn(){
dx = dy = 0;
}
turn(point a, point b){
dx = b.x - a.x;
dy = b.y - a.y;
long long g = gcd(abs(dx), abs(dy));
dx /= g;
dy /= g;
Compilation message (stderr)
# | 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... |