#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pii pair<int, int>
#define f first
#define s second
typedef long double T;
typedef complex<T> pt;
#define x real()
#define y imag()
T dot(pt v, pt w) {return (conj(v)*w).x;}
T cross(pt v, pt w) {return (conj(v)*w).y;}
T orient(pt a, pt b, pt c) {return cross(b-a,c-a);} // positive for left, negative for right, 0 for straight
bool half(pt p) {return p.y > 0 || (p.y == 0 && p.x < 0);}
// Warning: polarSort shouldn't contain origin
void polarSort(vector<pt> &v) {sort(v.begin(), v.end(), [](pt v, pt w) {return make_tuple(half(v), 0) < make_tuple(half(w), cross(v,w));});}
bool inDisk(pt a, pt b, pt p) {return dot(a-p, b-p) <= 0;}
bool onSegment(pt a, pt b, pt p) {return orient(a,b,p) == 0 && inDisk(a,b,p);}
bool intersect(pt a, pt b, pt c, pt d) {
if (onSegment(a, b, c)) return true;
if (onSegment(a, b, d)) return true;
if (onSegment(c, d, a)) return true;
if (onSegment(c, d, b)) return true;
T oa = orient(c, d, a), ob = orient(c, d, b), oc = orient(a, b, c), od = orient(a, b, d);
return ((oa > 0 && ob < 0) || (oa < 0 && ob > 0)) && ((oc > 0 && od < 0) || (oc < 0 && od > 0));
}
T area(vector<pt> polygon) {
int n = polygon.size();
T res = 0;
for (int i=0; i<n; i++) res += polygon[i].x * polygon[(i+1)%n].y - polygon[i].y * polygon[(i+1)%n].x;
return abs(res) / 2;
}
vector<vector<pt>> shapes;
void output(vector<pt> polygon) {
printf("%d", polygon.size());
for (pt p : polygon) printf(" %.12f %.12f", p.x, p.y);
printf("\n");
}
vector<int> scissors(int original, vector<vector<pt>> pieces) {
printf("scissors\n%d %d\n", original, pieces.size());
vector<int> res;
for (vector<pt>& piece : pieces) {
res.push_back(shapes.size());
shapes.push_back(piece);
output(piece);
}
return res;
}
int tape(vector<int> pieces, vector<pt> combined) {
printf("tape\n%d", pieces.size());
for (int i : pieces) printf(" %d", i);
printf("\n");
for (int i : pieces) output(shapes[i]);
output(combined);
shapes.push_back(combined);
return shapes.size()-1;
}
int move(int shape, vector<pt> loc) {
printf("tape\n1 %d\n", shape);
output(loc);
output(loc);
shapes.push_back(loc);
return shapes.size()-1;
}
vector<pt> read() {
int n, a, b;
scanf("%d", &n);
vector<pt> polygon;
for (int i=0; i<n; i++) {
scanf("%d%d", &a, &b);
polygon.emplace_back(a, b);
}
return polygon;
}
T width(int rectangle) {
return shapes[rectangle][1].x;
}
T height(int rectangle) {
return shapes[rectangle][2].y;
}
vector<pt> genrect(T lx, T rx, T ly, T ry) {
return {{lx, ly}, {rx, ly}, {rx, ry}, {lx, ry}};
}
int resize(int rectangle, T newwidth) {
T newheight = area(shapes[rectangle]) / newwidth;
T curwidth = width(rectangle), curheight = height(rectangle);
if (abs(newwidth-curheight) <= 1e-11) return rectangle;
if (newwidth > newheight + 1e-11) {
int res = resize(rectangle, newheight);
return move(res, genrect(0, newwidth, 0, newheight));
}
if (curheight >= 2 * newheight) {
vector<int> halves = scissors(rectangle, {genrect(0, curwidth, 0, curheight/2), genrect(0, curwidth, curheight/2, curheight)});
int h2 = move(halves[1], genrect(curwidth, curwidth*2, 0, curheight/2));
int res = tape({halves[0], h2}, genrect(0, 2*curwidth, 0, curheight/2));
return resize(res, newwidth);
}
if (curwidth >= 2 * newwidth) {
vector<int> halves = scissors(rectangle, {genrect(0, curwidth/2, 0, curheight), genrect(curwidth/2, curwidth, 0, curheight)});
int h2 = move(halves[1], genrect(0, curwidth/2, curheight, curheight*2));
int res = tape({halves[0], h2}, genrect(0, curwidth/2, 0, curheight*2));
return resize(res, newwidth);
}
if (curwidth < newwidth) {
int res = move(rectangle, genrect(0, curheight, 0, curwidth));
return resize(res, newwidth);
}
vector<int> pieces = scissors(rectangle, {
{{0, 0}, {newwidth, 0}, {newwidth, newheight-curheight}, {curwidth-newwidth, curheight}, {0, curheight}},
{{newwidth, 0}, {curwidth, 0}, {newwidth, newheight-curheight}},
{{curwidth, 0}, {curwidth, curheight}, {curwidth-newwidth, curheight}}
});
int a = pieces[0];
int b2 = move(pieces[1], {{0, curheight}, {curwidth-newwidth, curheight}, {0, newheight}});
int c2 = move(pieces[2], {{newwidth, newheight-curheight}, {newwidth, newheight}, {0, newheight}});
return tape({a, b2, c2}, genrect(0, newwidth, 0, newheight));
}
int main() {
vector<pt> S = read(), T = read();
shapes = {S};
resize(0, T[1].x-T[0].x);
}
Compilation message
scissors.cpp: In function 'void output(std::vector<std::complex<long double> >)':
scissors.cpp:44:14: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::vector<std::complex<long double> >::size_type' {aka 'long unsigned int'} [-Wformat=]
44 | printf("%d", polygon.size());
| ~^ ~~~~~~~~~~~~~~
| | |
| int std::vector<std::complex<long double> >::size_type {aka long unsigned int}
| %ld
scissors.cpp:45:39: warning: format '%f' expects argument of type 'double', but argument 2 has type 'long double' [-Wformat=]
45 | for (pt p : polygon) printf(" %.12f %.12f", p.x, p.y);
| ~~~~^
| |
| double
| %.12Lf
scissors.cpp:45:45: warning: format '%f' expects argument of type 'double', but argument 3 has type 'long double' [-Wformat=]
45 | for (pt p : polygon) printf(" %.12f %.12f", p.x, p.y);
| ~~~~^
| |
| double
| %.12Lf
scissors.cpp: In function 'std::vector<int> scissors(int, std::vector<std::vector<std::complex<long double> > >)':
scissors.cpp:50:27: warning: format '%d' expects argument of type 'int', but argument 3 has type 'std::vector<std::vector<std::complex<long double> > >::size_type' {aka 'long unsigned int'} [-Wformat=]
50 | printf("scissors\n%d %d\n", original, pieces.size());
| ~^ ~~~~~~~~~~~~~
| | |
| int std::vector<std::vector<std::complex<long double> > >::size_type {aka long unsigned int}
| %ld
scissors.cpp: In function 'int tape(std::vector<int>, std::vector<std::complex<long double> >)':
scissors.cpp:61:20: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wformat=]
61 | printf("tape\n%d", pieces.size());
| ~^ ~~~~~~~~~~~~~
| | |
| int std::vector<int>::size_type {aka long unsigned int}
| %ld
scissors.cpp: In function 'std::vector<std::complex<long double> > read()':
scissors.cpp:80:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
80 | scanf("%d", &n);
| ~~~~~^~~~~~~~~~
scissors.cpp:83:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
83 | scanf("%d%d", &a, &b);
| ~~~~~^~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
212 KB |
Operation 1, Polygon 0: Polygon given in clockwise order, must be counter-clockwise |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
304 KB |
Operation 1, Polygon 0: Polygon given in clockwise order, must be counter-clockwise |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
212 KB |
Operation 1, Polygon 0: Polygon given in clockwise order, must be counter-clockwise |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
Operation 1, Polygon 0: Polygon given in clockwise order, must be counter-clockwise |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Execution timed out |
1089 ms |
79260 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
212 KB |
Operation 1, Polygon 0: Polygon given in clockwise order, must be counter-clockwise |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
212 KB |
Operation 1, Polygon 0: Polygon given in clockwise order, must be counter-clockwise |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
212 KB |
Operation 1, Polygon 0: Polygon given in clockwise order, must be counter-clockwise |
| 2 |
Halted |
0 ms |
0 KB |
- |
