# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
211252 | Lawliet | Scissors and Tape (CEOI19_scissors) | C++17 | 1100 ms | 106112 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 <bits/stdc++.h>
using namespace std;
struct point
{
double x, y;
point operator + (point a) { return point( x + a.x , y + a.y ); }
bool operator != (point a) { return ( x != a.x ) || ( y != a.y ); }
bool operator == (point a) { return ( x == a.x ) && ( y == a.y ); }
point(double x, double y) : x(x), y(y) {}
};
int globalInd;
vector< point > S;
vector< point > T;
vector< point > readPolygon()
{
int sz;
scanf("%d",&sz);
vector< point > ans;
for(int i = 1 ; i <= sz ; i++)
{
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |