Pagini recente » Cod sursa (job #1238532) | Cod sursa (job #834358) | Cod sursa (job #233906) | Cod sursa (job #571348) | Cod sursa (job #1946636)
#include <bits/stdc++.h>
using namespace std;
class InputReader {
public:
InputReader() {}
InputReader(const char *file_name) {
input_file = fopen(file_name, "r");
cursor = 0;
fread(buffer, SIZE, 1, input_file);
}
inline InputReader &operator >>(int &n) {
while((buffer[cursor] < '0' || buffer[cursor] > '9')&& buffer[cursor]!='-') {
advance();
}
semn=1;
if(buffer[cursor]=='-')
{
semn=-1;
advance();
}
n = 0;
while('0' <= buffer[cursor] && buffer[cursor] <= '9') {
n = n * 10 + buffer[cursor] - '0';
advance();
}
n*=semn;
return *this;
}
private:
FILE *input_file;
static const int SIZE = 1 << 20;
int cursor,semn;
char buffer[SIZE];
inline void advance() {
++ cursor;
if(cursor == SIZE) {
cursor = 0;
fread(buffer, SIZE, 1, input_file);
}
}
}f("rays.in");
ofstream g("rays.out");
int X,y_,Y_,n,i,nr;
vector<pair<double,double> > V[2];
double x,y,ult;
void solve(int x)
{
sort(V[x].begin(),V[x].end());
ult=-(1<<30);
for(i=0;i<V[x].size();++i)
if(V[x][i].second>ult) ult=V[x][i].first,++nr;
}
int main()
{
f>>n;
for(i=1;i<=n;++i)
{
f>>X>>y_>>Y_;
if(y_>Y_) swap(y_,Y_);
x=1.0*y_/X;
y=1.0*Y_/X;
if(X<0) V[0].push_back(make_pair(-y,-x));
else V[1].push_back(make_pair(y,x));
}
solve(0);
solve(1);
g<<nr;
return 0;
}