1. , 동 ¶
- 번 1 2번 는 35 . 번 는 보 리 랐.
~cpp
#include <iostream>
using namespace std;
struct POINT
{
int x, y;
};
int numOfData;
POINT inputData[10][4];
int outputData[10];
#define max(a,b) (a > b) ? a : b
#define min(a,b) (a < b) ? a : b
void input()
{
cin >> numOfData;
for(int i=0;i<numOfData;i++)
{
for(int j=0;j<4;j++)
{
cin >> inputData[i][j].x;
cin >> inputData[i][j].y;
}
}
}
void process()
{
POINT maxPoint, minPoint;
int overlappedRect;
for(int i=0;i<numOfData;i++) {
maxPoint.x = max(inputData[i][0].x,inputData[i][2].x);
maxPoint.y = max(inputData[i][0].y,inputData[i][2].y);
minPoint.x = min(inputData[i][1].x,inputData[i][3].x);
minPoint.y = min(inputData[i][1].y,inputData[i][3].y);
overlappedRect = (minPoint.x - maxPoint.x) * (minPoint.y - maxPoint.y);
if(overlappedRect < 0) overlappedRect = 0;
outputData[i] = (inputData[i][1].x - inputData[i][0].x) * (inputData[i][1].y - inputData[i][0].y);
outputData[i] -= overlappedRect;
}
}
void output()
{
for(int i=0;i<numOfData;i++)
{
cout << outputData[i] << endl;
}
}
void main()
{
input();
process();
output();
}
2. ¶
- 린
; 문를 대 보 . 무 러; 미 모르.
- , 디 볼 노는데.. 무 대 루 방 . 높는데 .
~cpp
#include <iostream>
#include <cmath>
#include <vector>
using namespace std;
struct Point
{
int x;
int y;
Point(int arg_x, int arg_y)
{
x = arg_x;
y = arg_y;
}
};
class Line
{
public :
int x1;
int y1;
int x2;
int y2;
bool IsVertical()
{
return x1 == x2;
}
bool IsHorizontal()
{
return y1 == y2;
}
bool IsSameVerticalLine(Line& line)
{
return line.x1 == x1;
}
bool IsSameHorizontalLine(Line& line)
{
return line.y1 == y1;
}
Line() {}
Line(int arg_x1, int arg_y1, int arg_x2, int arg_y2)
: x1(arg_x1), y1(arg_y1), x2(arg_x2), y2(arg_y2) {}
bool IsHorizontalCrossVertical(Line& line)
{
return line.y1 >= y1 && line.y1 <= y2 && x1 >= line.x1 && x1 <= line.x2;
}
bool IsVerticalCrossHorizontal(Line& line)
{
return line.x1 >= x1 && line.x1 <= x2 && y1 >= line.y1 && y1 <= line.y2;
}
bool IsMeet(Line& line)
{
if(IsVertical())
{
if( IsSameVerticalLine(line) || IsHorizontalCrossVertical(line) )
return true;
return false;
}
else
{
if( IsSameHorizontalLine(line) || IsVerticalCrossHorizontal(line) )
return true;
return false;
}
return false;
}
};
class Rect
{
public :
int x1;
int y1;
int x2;
int y2;
vector<Point> intersections;
Line GenerateLine(int nth)
{
switch(nth)
{
case 0:
return Line(x1, y1, x2, y1);
case 1:
return Line(x2, y1, x2, y2);
case 2:
return Line(x1, y2, x2, y2);
case 3:
return Line(x1, y1, x1, y2);
default:
return Line(x1, y1, x1, y1);
}
}
bool IsHeapUp()
{
return intersections.size() == 2;
}
bool IsSmallerThan(Rect& rect)
{
return rect.x2 >= x2;
}
void AddIntersectionPoint(Line& rect1Line, Line& rect2Line)
{
if(rect1Line.IsVertical())
intersections.push_back( Point(rect1Line.x1, rect2Line.y1) );
else
intersections.push_back( Point(rect2Line.x1, rect1Line.y1) );
}
Rect(int arg_x1, int arg_y1, int arg_x2, int arg_y2)
: x1(arg_x1), y1(arg_y1), x2(arg_x2), y2(arg_y2) {}
void CountIntersectionPoint(Rect& rect)
{
Line rect1Line, rect2Line;
for(int i = 0 ; i < 4 ; ++i)
{
rect1Line = GenerateLine(i);
for(int j = 0 ; j < 4 ; ++j)
{
rect2Line = rect.GenerateLine(j);
if( rect1Line.IsMeet(rect2Line) )
{
AddIntersectionPoint(rect1Line, rect2Line);
}
}
}
}
int GetRestSquare(Rect& rect)
{
int intersectionSquare = 0;
if( IsHeapUp() )
{
intersectionSquare = abs(intersections[1].x - intersections[0].x)
* abs(intersections[1].y - intersections[0].y);
}
else
{
if( IsSmallerThan(rect) )
intersectionSquare = (x2-x1) * (y2-y1);
else
intersectionSquare = (rect.x2-rect.x1) * (rect.y2-rect.y1);
}
return (x2-x1) * (y2-y1) - intersectionSquare;
}
};
int main()
{
Rect rect1(2,2,4,4);
Rect rect2(1,1,5,5);
rect1.CountIntersectionPoint(rect2);
cout << rect1.GetRestSquare(rect2);
return 0;
}
3. ¶
- .. 마막 막 리 못 며 . A 만 만.. C++ 는 만 C ... 무 내 리 놀 못. 만 났는 벙벙 뿐. 른 부 변 린 부럽.
- STL 부 는 . 배 마 느끼는 바....
~cpp
#include <iostream>
using namespace std;
void input();
int board1Size();
int calDiffSize();
void output();
int jdValue(int a, int b);
void sort(int a[], int size);
int num;
int board1[10];
int diffSize[10];
int x1, x2, x3, x4, y1, y2, y3, y4;
int main()
{
input();
board1Size();
output();
return 0;
}
void input()
{
cin >> num;
for (int i = 0; i < num; i++)
{
cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> x4 >> y4;
diffSize[i] = calDiffSize();
board1[i] = board1Size();
}
}
int board1Size()
{
return (x2 - x1)*(y2 - y1);
}
int calDiffSize()
{
int diffSize;
if (x2 <= x3 || x1 >= x4 || y1 >= y4 || y2 <= y3)
return 0;
int x[4] = {x1, x2, x3, x4};
int y[4] = {y1, y2, y3, y4};
sort(x, 4);
sort(y, 4);
diffSize = jdValue(x[1], x[2]) * jdValue(y[1], y[2]);
return diffSize;
}
void output()
{
for (int i = 0; i < num; i++)
cout << board1[i] - diffSize[i] <<endl;
}
int jdValue(int a, int b)
{
if (a > b)
return b - a;
return a - b;
}
void sort(int a[], int size)
{
for (int k = 0; k < size; k++)
{
for (int i = 0; i < size - 1; i++)
{
if (a[i] > a[i+1])
{
int temp;
temp = a[i];
a[i] = a[i+1];
a[i+1] = temp;
}
}
}
}
// sort 는 #include <algorithm>
// sort(&a[0], &a[size]); 면 남
// 리 jdValue 는 대 는 데
// #include <cmath> , abs() 면 남
3.1. 민(neocoin) ¶
보 . 
뭐, 만 . 들 보 max, min . 는 먹 말..
뭐, 만 . 들 보 max, min . 는 먹 말..~cpp
#include <iostream>
#include <vector>
using namespace std;
struct DataSet{
int underX[2];
int underY[2];
int upperX[2];
int upperY[2];
};
vector< DataSet > datas;
void input(){
int numberOfTestCase =0;
cin >> numberOfTestCase;
for ( int testCaseNum=0;testCaseNum<numberOfTestCase;testCaseNum++){
DataSet data;
for ( int i =0;i<2;i++)
cin >> data.underX[i] >> data.underY[i];
for ( i =0;i<2;i++)
cin >> data.upperX[i] >> data.upperY[i];
datas.push_back(data);
}
}
int getVisibleArea(DataSet& data){
int underArea = ( data.underX[1] - data.underX[0] ) * (data.underY[1]-data.underY[0]);
int x[2];
int y[2];
x[0] = ( data.underX[0] > data.upperX[0] )?data.underX[0]:data.upperX[0];
x[1] = ( data.underX[1] < data.upperX[1] )?data.underX[1]:data.upperX[1];
y[0] = ( data.underY[0] > data.upperY[0] )?data.underY[0]:data.upperY[0];
y[1] = ( data.underY[1] < data.upperY[1] )?data.underY[1]:data.upperY[1];
int overArea = (x[1] - x[0])*(y[1]-y[0]);
return underArea - overArea;
}
void process(){
vector<DataSet>::iterator iter;
for ( iter = datas.begin(); iter != datas.end(); iter++)
cout << getVisibleArea(*iter) << endl;
}
int main(){
input();
process();
return 0;
}
