Pagini recente » Cod sursa (job #2317547) | Cod sursa (job #194319) | Cod sursa (job #358934) | Cod sursa (job #2030348) | Cod sursa (job #2557846)
#include <vector>
#include <fstream>
#include <iostream>
#include <cmath>
#include <map>
#include <algorithm>
#define ull unsigned long long int
#define error 0.000001
#include <bits/stdc++.h>
using namespace std;
int n;
vector<pair<double,double> > cadran1;
vector<pair <double, double> >cadran2;
int cnt1,cnt2;
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);
}
}
};
int solve(vector<pair< double,double> > cadran)
{
sort(cadran.begin(),cadran.end());
int cnt=0,sol=0,start=0;
for(int i=1;i<cadran.size();i++)
{
if(cadran[i].first>cadran[start].second)
{
cnt++;
start=i;
}
else
{
if(cadran[i].second<cadran[start].second)
start=i;
}
}
cnt++;
return cnt;
}
int main()
{
InputReader f("rays.in");
ofstream g("rays.out");
for(int i=1; i<=n; i++)
{
int x,y,y1;
f>>x>>y>>y1;
if(x<0)
{
double unghi1=double (1.0*y/-x);
double unghi2=double(1.0*y1/-x);
if(unghi1>unghi2) swap(unghi1,unghi2);
cadran2.push_back (make_pair(unghi1,unghi2));
}
else
{
double unghi1=double (1.0*y/x);
double unghi2=double(1.0*y1/x);
if(unghi1>unghi2) swap(unghi1,unghi2);
cadran1.push_back (make_pair (unghi1,unghi2));
}
}
g<<solve(cadran1)+solve(cadran2);
}