(I2
I142
I4
(dp0
Vsquares.%l
p1
(Vsquares_check.cpp
p2
S'#include<iostream>\n#include<algorithm>\nusing namespace std;\nstruct point\n{\n    int x,y;\n    point(){};\n    point(int a,int b)\n    {\n        x=a;\n        y=b;\n    }\n};\nbool operator<(point a,point b)\n{\n    if(a.x==b.x)\n    {\n        return a.y<b.y;\n    }\n    return a.x<b.x;\n}\nstruct square\n{\n    point v[4],cent;\n    square(){};\n    square(int a,int b,int c,int d)\n    {\n        cent.x=a;\n        cent.y=b;\n        v[0].x=c;\n        v[0].y=d;\n        v[2].x=2*a-c;\n        v[2].y=2*b-d;\n        v[1].x=a+b-d;\n        v[1].y=b+c-a;\n        v[3].x=2*a-v[1].x;\n        v[3].y=2*b-v[1].y;\n        sort(v,v+4);\n    }\n}squares[11];\nint pole[400][400];\nint main(){\n    cin.tie(NULL);\n    ios::sync_with_stdio(false);\n    int n,a,b,c,d,ans;\n    cin>>n;\n    if(n<3)\n    {\n        cout<<8/0<<"\\n";\n    }\n    return 0;\n    for(int i=0;i<n;i++)\n    {\n        cin>>a>>b>>c>>d;\n        squares[i]=square(a,b,c,d);\n        for(int j=squares[i].v[0].x;j<squares[i].v[3].x;j++)\n        {\n            for(int p=squares[i].v[0].y;p<squares[i].v[3].y;p++)\n            {\n                if(pole[j+100][p+100]!=1)\n                {\n                    pole[j+100][p+100]=1;\n                    ans++;\n                }\n            }\n        }\n    }\n    cout<<ans<<"\\n";\n    return 0;\n}\n'
p3
tp4
stp5
.