# 2070883, 2024-11-02 13:28:39, ----P-PP-P (40%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
int x, y;
vector<pair <int, int>> alldata;
map <int, int> Q1;
map <int, int> Q2;
map <int, int> Q3;
map <int, int> Q4;
while(n--){
cin >> x >> y;
alldata.push_back({x,y});
}
for(auto e : alldata){
if(e.first > 0 && e.second > 0){
Q1[e.first] = e.second;
}
if(e.first < 0 && e.second > 0){
Q2[e.first] = e.second;
}
if(e.first < 0 && e.second < 0){
Q3[e.first] = e.second;
}
if(e.first > 0 && e.second < 0){
Q4[e.first] = e.second;
}
}
int XminQ1 = INT_MAX;
int YminQ1 = INT_MAX;
for(auto e : Q1){
if(XminQ1 > e.first){
XminQ1 = e.first;
}
if(YminQ1 > e.second){
YminQ1 = e.second;
}
}
//cout << XminQ1 << " " << YminQ1;
int XmaxQ1 = INT_MIN;
int YmaxQ1 = INT_MIN;
for(auto e : Q1){
if(XmaxQ1 < e.first){
XmaxQ1 = e.first;
}
if(YmaxQ1 < e.second){
YmaxQ1 = e.second;
}
}
//cout << endl << "max" << endl;
//cout << XmaxQ1 << " " << YmaxQ1;
int XminQ2 = INT_MAX;
int YminQ2 = INT_MAX;
for(auto e : Q2){
if(XminQ2 > e.first){
XminQ2 = e.first;
}
if(YminQ2 > e.second){
YminQ2 = e.second;
}
}
//cout << endl << XminQ2 << " " << YminQ2;
int XmaxQ2 = INT_MIN;
int YmaxQ2 = INT_MIN;
for(auto e : Q2){
if(XmaxQ2 < e.first){
XmaxQ2 = e.first;
}
if(YmaxQ2 < e.second){
YmaxQ2 = e.second;
}
}
//cout << endl << "max" <<endl;
//cout << XmaxQ2 << " " << YmaxQ2;
int XminQ3 = INT_MAX;
int YminQ3 = INT_MAX;
for(auto e : Q3){
if(XminQ3 > e.first){
XminQ3 = e.first;
}
if(YminQ3 > e.second){
YminQ3 = e.second;
}
}
//cout << endl << XminQ3 << " " << YminQ3;
int XmaxQ3 = INT_MIN;
int YmaxQ3 = INT_MIN;
for(auto e : Q3){
if(XmaxQ3 < e.first){
XmaxQ3 = e.first;
}
if(YmaxQ3 < e.second){
YmaxQ3 = e.second;
}
}
//cout << endl << "max" <<endl;
//cout << XmaxQ3 << " " << YmaxQ3;
int XminQ4 = INT_MAX;
int YminQ4 = INT_MAX;
for(auto e : Q4){
if(XminQ4 > e.first){
XminQ4 = e.first;
}
if(YminQ4 > e.second){
YminQ4 = e.second;
}
}
//cout << endl << XminQ4 << " " << YminQ4;
int XmaxQ4 = INT_MIN;
int YmaxQ4 = INT_MIN;
for(auto e : Q4){
if(XmaxQ4 < e.first){
XmaxQ4 = e.first;
}
if(YmaxQ4 < e.second){
YmaxQ4 = e.second;
}
}
//cout << endl << "max" <<endl;
//cout << XmaxQ4 << " " << YmaxQ4;
cout << "Q1:" << " (" << XminQ1 << ", " << YminQ1 << ") (" << XmaxQ1 << ", " << YmaxQ1 <<") "<< ((XmaxQ1 - XminQ1) * (YmaxQ1 - YminQ1)) << endl;
cout << "Q2:" << " (" << XminQ2 << ", " << YminQ2 << ") (" << XmaxQ2 << ", " << YmaxQ2 <<") "<< ((XmaxQ2 - XminQ2) * (YmaxQ2 - YminQ2)) << endl;
cout << "Q3:" << " (" << XminQ3 << ", " << YminQ3 << ") (" << XmaxQ3 << ", " << YmaxQ3 <<") "<< ((XmaxQ3 - XminQ3) * (YmaxQ3 - YminQ3)) << endl;
cout << "Q4:" << " (" << XminQ4 << ", " << YminQ4 << ") (" << XmaxQ4 << ", " << YmaxQ4 <<") "<< ((XmaxQ4 - XminQ4) * (YmaxQ4 - YminQ4)) << endl;
} | # 2070925, 2024-11-02 13:34:35, PP-PPPPPPP (90%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
int x, y;
vector<pair <int, int>> alldata;
map <int, int> Q1;
map <int, int> Q2;
map <int, int> Q3;
map <int, int> Q4;
while(n--){
cin >> x >> y;
alldata.push_back({x,y});
}
for(auto e : alldata){
if(e.first > 0 && e.second > 0){
Q1[e.first] = e.second;
}
if(e.first < 0 && e.second > 0){
Q2[e.first] = e.second;
}
if(e.first < 0 && e.second < 0){
Q3[e.first] = e.second;
}
if(e.first > 0 && e.second < 0){
Q4[e.first] = e.second;
}
}
int XminQ1 = INT_MAX;
int YminQ1 = INT_MAX;
for(auto e : Q1){
if(XminQ1 > e.first){
XminQ1 = e.first;
}
if(YminQ1 > e.second){
YminQ1 = e.second;
}
}
//cout << XminQ1 << " " << YminQ1;
int XmaxQ1 = INT_MIN;
int YmaxQ1 = INT_MIN;
for(auto e : Q1){
if(XmaxQ1 < e.first){
XmaxQ1 = e.first;
}
if(YmaxQ1 < e.second){
YmaxQ1 = e.second;
}
}
//cout << endl << "max" << endl;
//cout << XmaxQ1 << " " << YmaxQ1;
int XminQ2 = INT_MAX;
int YminQ2 = INT_MAX;
for(auto e : Q2){
if(XminQ2 > e.first){
XminQ2 = e.first;
}
if(YminQ2 > e.second){
YminQ2 = e.second;
}
}
//cout << endl << XminQ2 << " " << YminQ2;
int XmaxQ2 = INT_MIN;
int YmaxQ2 = INT_MIN;
for(auto e : Q2){
if(XmaxQ2 < e.first){
XmaxQ2 = e.first;
}
if(YmaxQ2 < e.second){
YmaxQ2 = e.second;
}
}
//cout << endl << "max" <<endl;
//cout << XmaxQ2 << " " << YmaxQ2;
int XminQ3 = INT_MAX;
int YminQ3 = INT_MAX;
for(auto e : Q3){
if(XminQ3 > e.first){
XminQ3 = e.first;
}
if(YminQ3 > e.second){
YminQ3 = e.second;
}
}
//cout << endl << XminQ3 << " " << YminQ3;
int XmaxQ3 = INT_MIN;
int YmaxQ3 = INT_MIN;
for(auto e : Q3){
if(XmaxQ3 < e.first){
XmaxQ3 = e.first;
}
if(YmaxQ3 < e.second){
YmaxQ3 = e.second;
}
}
//cout << endl << "max" <<endl;
//cout << XmaxQ3 << " " << YmaxQ3;
int XminQ4 = INT_MAX;
int YminQ4 = INT_MAX;
for(auto e : Q4){
if(XminQ4 > e.first){
XminQ4 = e.first;
}
if(YminQ4 > e.second){
YminQ4 = e.second;
}
}
//cout << endl << XminQ4 << " " << YminQ4;
int XmaxQ4 = INT_MIN;
int YmaxQ4 = INT_MIN;
for(auto e : Q4){
if(XmaxQ4 < e.first){
XmaxQ4 = e.first;
}
if(YmaxQ4 < e.second){
YmaxQ4 = e.second;
}
}
//cout << endl << "max" <<endl;
//cout << XmaxQ4 << " " << YmaxQ4;
if(!Q1.empty()){
cout << "Q1:" << " (" << XminQ1 << ", " << YminQ1 << ") (" << XmaxQ1 << ", " << YmaxQ1 <<") "<< ((XmaxQ1 - XminQ1) * (YmaxQ1 - YminQ1)) << endl;
}
if(!Q2.empty()){
cout << "Q2:" << " (" << XminQ2 << ", " << YminQ2 << ") (" << XmaxQ2 << ", " << YmaxQ2 <<") "<< ((XmaxQ2 - XminQ2) * (YmaxQ2 - YminQ2)) << endl;
}
if(!Q3.empty()){
cout << "Q3:" << " (" << XminQ3 << ", " << YminQ3 << ") (" << XmaxQ3 << ", " << YmaxQ3 <<") "<< ((XmaxQ3 - XminQ3) * (YmaxQ3 - YminQ3)) << endl;
}
if(!Q4.empty()){
cout << "Q4:" << " (" << XminQ4 << ", " << YminQ4 << ") (" << XmaxQ4 << ", " << YmaxQ4 <<") "<< ((XmaxQ4 - XminQ4) * (YmaxQ4 - YminQ4)) << endl;
}
if(Q1.empty() && Q2.empty() && Q3.empty() && Q4.empty()){
cout <<"No point in any quadrant";
}
} | # 2071767, 2024-11-02 15:13:42, PP-PPPPPPP (90%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
int x, y;
vector<pair <int, int>> alldata;
map <int, int> Q1;
map <int, int> Q2;
map <int, int> Q3;
map <int, int> Q4;
while(n--){
cin >> x >> y;
alldata.push_back({x,y});
}
for(auto e : alldata){
if(e.first > 0 && e.second > 0){
Q1[e.first] = e.second;
}
if(e.first < 0 && e.second > 0){
Q2[e.first] = e.second;
}
if(e.first < 0 && e.second < 0){
Q3[e.first] = e.second;
}
if(e.first > 0 && e.second < 0){
Q4[e.first] = e.second;
}
}
int XminQ1 = INT_MAX;
int YminQ1 = INT_MAX;
for(auto e : Q1){
if(XminQ1 > e.first){
XminQ1 = e.first;
}
if(YminQ1 > e.second){
YminQ1 = e.second;
}
}
int XmaxQ1 = INT_MIN;
int YmaxQ1 = INT_MIN;
for(auto e : Q1){
if(XmaxQ1 < e.first){
XmaxQ1 = e.first;
}
if(YmaxQ1 < e.second){
YmaxQ1 = e.second;
}
}
int XminQ2 = INT_MAX;
int YminQ2 = INT_MAX;
for(auto e : Q2){
if(XminQ2 > e.first){
XminQ2 = e.first;
}
if(YminQ2 > e.second){
YminQ2 = e.second;
}
}
int XmaxQ2 = INT_MIN;
int YmaxQ2 = INT_MIN;
for(auto e : Q2){
if(XmaxQ2 < e.first){
XmaxQ2 = e.first;
}
if(YmaxQ2 < e.second){
YmaxQ2 = e.second;
}
}
int XminQ3 = INT_MAX;
int YminQ3 = INT_MAX;
for(auto e : Q3){
if(XminQ3 > e.first){
XminQ3 = e.first;
}
if(YminQ3 > e.second){
YminQ3 = e.second;
}
}
int XmaxQ3 = INT_MIN;
int YmaxQ3 = INT_MIN;
for(auto e : Q3){
if(XmaxQ3 < e.first){
XmaxQ3 = e.first;
}
if(YmaxQ3 < e.second){
YmaxQ3 = e.second;
}
}
int XminQ4 = INT_MAX;
int YminQ4 = INT_MAX;
for(auto e : Q4){
if(XminQ4 > e.first){
XminQ4 = e.first;
}
if(YminQ4 > e.second){
YminQ4 = e.second;
}
}
int XmaxQ4 = INT_MIN;
int YmaxQ4 = INT_MIN;
for(auto e : Q4){
if(XmaxQ4 < e.first){
XmaxQ4 = e.first;
}
if(YmaxQ4 < e.second){
YmaxQ4 = e.second;
}
}
if(!Q1.empty()){
cout << "Q1:" << " (" << XminQ1 << ", " << YminQ1 << ") (" << XmaxQ1 << ", " << YmaxQ1 <<") "<< ((XmaxQ1 - XminQ1) * (YmaxQ1 - YminQ1)) << endl;
}
if(!Q2.empty()){
cout << "Q2:" << " (" << XminQ2 << ", " << YminQ2 << ") (" << XmaxQ2 << ", " << YmaxQ2 <<") "<< ((XmaxQ2 - XminQ2) * (YmaxQ2 - YminQ2)) << endl;
}
if(!Q3.empty()){
cout << "Q3:" << " (" << XminQ3 << ", " << YminQ3 << ") (" << XmaxQ3 << ", " << YmaxQ3 <<") "<< ((XmaxQ3 - XminQ3) * (YmaxQ3 - YminQ3)) << endl;
}
if(!Q4.empty()){
cout << "Q4:" << " (" << XminQ4 << ", " << YminQ4 << ") (" << XmaxQ4 << ", " << YmaxQ4 <<") "<< ((XmaxQ4 - XminQ4) * (YmaxQ4 - YminQ4)) << endl;
}
if(Q1.empty() && Q2.empty() && Q3.empty() && Q4.empty()){
cout <<"No point in any quadrant";
}
} |
# 2071183, 2024-11-02 14:05:53, ----P-PP-P (40%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<pair<int,int>> point,Q1,Q2,Q3,Q4,ans1,ans2,ans3,ans4;
pair<int,int> tem1,tem2;
int a,b;
for(int i=0;i<n;i++){
cin>>a;
cin>>b;
point.push_back(make_pair(a,b));
}
for(auto x : point){
if(x.first>0&&x.second>0){
Q1.push_back(make_pair(x.first,x.second));
}
else if(x.first<0&&x.second>0){
Q2.push_back(make_pair(x.first,x.second));
}
else if(x.first<0&&x.second<0){
Q3.push_back(make_pair(x.first,x.second));
}
else if(x.first>0&&x.second<0){
Q4.push_back(make_pair(x.first,x.second));
}
}
int max_x=-100000000,max_y=-10000000,min_x=1000000,min_y=1000000;
for(auto l:Q1){
max_x=max(max_x,l.first);
max_y=max(max_y,l.second);
min_x=min(min_x,l.first);
min_y=min(min_y,l.second);
}
ans1.push_back(make_pair(max_x,max_y));
ans1.push_back(make_pair(min_x,min_y));
sort(ans1.begin(),ans1.end());
cout<<"Q1:";
for(auto s:ans1){
cout<<" ("<<s.first<<", "<<s.second<<")";
}
cout<<" "<<(max_x-min_x)*(max_y-min_y)<<endl;
int max_x1=-10000000,max_y1=-10000000,min_x1=1000000,min_y1=1000000;
for(auto l:Q2){
max_x1=max(max_x1,l.first);
max_y1=max(max_y1,l.second);
min_x1=min(min_x1,l.first);
min_y1=min(min_y1,l.second);
}
ans2.push_back(make_pair(max_x1,max_y1));
ans2.push_back(make_pair(min_x1,min_y1));
sort(ans2.begin(),ans2.end());
cout<<"Q2:";
for(auto s:ans2){
cout<<" ("<<s.first<<", "<<s.second<<")";
}
cout<<" "<<(max_x1-min_x1)*(max_y1-min_y1)<<endl;
int max_x2=-10000000,max_y2=-10000000,min_x2=1000000,min_y2=1000000;
for(auto l:Q3){
max_x2=max(max_x2,l.first);
max_y2=max(max_y2,l.second);
min_x2=min(min_x2,l.first);
min_y2=min(min_y2,l.second);
}
ans3.push_back(make_pair(max_x2,max_y2));
ans3.push_back(make_pair(min_x2,min_y2));
sort(ans3.begin(),ans3.end());
cout<<"Q3:";
for(auto s:ans3){
cout<<" ("<<s.first<<", "<<s.second<<")";
}
cout<<" "<<(max_x2-min_x2)*(max_y2-min_y2)<<endl;
int max_x3=-10000000,max_y3=-10000000,min_x3=1000000,min_y3=1000000;
for(auto l:Q4){
max_x3=max(max_x3,l.first);
max_y3=max(max_y3,l.second);
min_x3=min(min_x3,l.first);
min_y3=min(min_y3,l.second);
}
ans4.push_back(make_pair(max_x3,max_y3));
ans4.push_back(make_pair(min_x3,min_y3));
sort(ans4.begin(),ans4.end());
cout<<"Q4:";
for(auto s:ans4){
cout<<" ("<<s.first<<", "<<s.second<<")";
}
cout<<" "<<(max_x3-min_x3)*(max_y3-min_y3)<<endl;
if(Q1.size()==0&&Q2.size()==0&&Q3.size()==0&&Q4.size()==1)
cout<<"No point in any quadrant";
} | # 2071225, 2024-11-02 14:10:29, PPPPP-PPPP (90%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<pair<int,int>> point,Q1,Q2,Q3,Q4,ans1,ans2,ans3,ans4;
pair<int,int> tem1,tem2;
int a,b;
for(int i=0;i<n;i++){
cin>>a;
cin>>b;
point.push_back(make_pair(a,b));
}
for(auto x : point){
if(x.first>0&&x.second>0){
Q1.push_back(make_pair(x.first,x.second));
}
else if(x.first<0&&x.second>0){
Q2.push_back(make_pair(x.first,x.second));
}
else if(x.first<0&&x.second<0){
Q3.push_back(make_pair(x.first,x.second));
}
else if(x.first>0&&x.second<0){
Q4.push_back(make_pair(x.first,x.second));
}
}
int max_x=-100000000,max_y=-10000000,min_x=1000000,min_y=1000000;
for(auto l:Q1){
max_x=max(max_x,l.first);
max_y=max(max_y,l.second);
min_x=min(min_x,l.first);
min_y=min(min_y,l.second);
}
ans1.push_back(make_pair(max_x,max_y));
ans1.push_back(make_pair(min_x,min_y));
sort(ans1.begin(),ans1.end());
while(1){
if(Q1.size()==0) break;
cout<<"Q1:";
for(auto s:ans1){
cout<<" ("<<s.first<<", "<<s.second<<")";
}
cout<<" "<<(max_x-min_x)*(max_y-min_y)<<endl;
break;
}
int max_x1=-10000000,max_y1=-10000000,min_x1=1000000,min_y1=1000000;
for(auto l:Q2){
max_x1=max(max_x1,l.first);
max_y1=max(max_y1,l.second);
min_x1=min(min_x1,l.first);
min_y1=min(min_y1,l.second);
}
ans2.push_back(make_pair(max_x1,max_y1));
ans2.push_back(make_pair(min_x1,min_y1));
sort(ans2.begin(),ans2.end());
while(1){
if(Q2.size()==0) break;
cout<<"Q2:";
for(auto s:ans2){
cout<<" ("<<s.first<<", "<<s.second<<")";
}
cout<<" "<<(max_x1-min_x1)*(max_y1-min_y1)<<endl;
break;
}
int max_x2=-10000000,max_y2=-10000000,min_x2=1000000,min_y2=1000000;
for(auto l:Q3){
max_x2=max(max_x2,l.first);
max_y2=max(max_y2,l.second);
min_x2=min(min_x2,l.first);
min_y2=min(min_y2,l.second);
}
ans3.push_back(make_pair(max_x2,max_y2));
ans3.push_back(make_pair(min_x2,min_y2));
sort(ans3.begin(),ans3.end());
while(1){
if(Q3.size()==0) break;
cout<<"Q3:";
for(auto s:ans3){
cout<<" ("<<s.first<<", "<<s.second<<")";
}
cout<<" "<<(max_x2-min_x2)*(max_y2-min_y2)<<endl;
break;
}
int max_x3=-10000000,max_y3=-10000000,min_x3=1000000,min_y3=1000000;
for(auto l:Q4){
max_x3=max(max_x3,l.first);
max_y3=max(max_y3,l.second);
min_x3=min(min_x3,l.first);
min_y3=min(min_y3,l.second);
}
ans4.push_back(make_pair(max_x3,max_y3));
ans4.push_back(make_pair(min_x3,min_y3));
sort(ans4.begin(),ans4.end());
while(1){
if(Q4.size()==0) break;
cout<<"Q4:";
for(auto s:ans4){
cout<<" ("<<s.first<<", "<<s.second<<")";
}
cout<<" "<<(max_x3-min_x3)*(max_y3-min_y3)<<endl;
break;
}
if(Q1.size()==0&&Q2.size()==0&&Q3.size()==0&&Q4.size()==1)
cout<<"No point in any quadrant";
} |
# 2069675, 2024-11-02 11:11:44, xxxx-x--x- (0%)
#include<bits/stdc++.h>
using namespace std ;
int main(){
int n ; cin >> n ;
int x , y ;
vector<vector<int>> Q1 ;
vector<vector<int>> Q2 ;
vector<vector<int>> Q3 ;
vector<vector<int>> Q4 ;
while (n--) {
cin >> x >> y ;
if(x> 0 && y > 0) Q1.push_back({x,y}) ;
else if (x > 0 && y < 0) Q4.push_back({x,y}) ;
else if (x < 0 && y < 0) Q3.push_back({x,y}) ;
else if (x < 0 && y > 0) Q2.push_back({x,y}) ;
}
int minx = Q1[0][0] , miny = Q1[0][1], maxx = Q1[0][0] , maxy = Q1[0][1] ;
for(int i = 0 ; i < Q1.size() ; i++){
for (int j = 0; j < 2; j++) {
if(Q1[i][0] > maxx) maxx = Q1[i][0] ;
if(Q1[i][1] > maxy) maxy = Q1[i][1] ;
if(Q1[i][0] < minx) minx = Q1[i][0] ;
if(Q1[i][1] < miny) miny = Q1[i][1] ;
}
}
cout << "Q1: " << "(" << minx <<" , " << miny<<") " << "(" << maxx <<" , " << maxy<<") " << (maxx-minx)*(maxy-miny) << endl ;
minx = Q2[0][0] , miny = Q2[0][1], maxx = Q2[0][0] , maxy = Q2[0][1] ;
for(int i = 0 ; i < Q2.size() ; i++){
for (int j = 0; j < 2; j++) {
if(Q2[i][0] > maxx) maxx = Q2[i][0] ;
if(Q2[i][1] > maxy) maxy = Q2[i][1] ;
if(Q2[i][0] < minx) minx = Q2[i][0] ;
if(Q2[i][1] < miny) miny = Q2[i][1] ;
}
}
cout << "Q2: " << "(" << minx <<" , " << miny<<") " << "(" << maxx <<" , " << maxy<<") " << (maxx-minx)*(maxy-miny) <<endl ;
minx = Q3[0][0] , miny = Q3[0][1], maxx = Q3[0][0] , maxy = Q3[0][1] ;
for(int i = 0 ; i < Q3.size() ; i++){
for (int j = 0; j < 2; j++) {
if(Q3[i][0] > maxx) maxx = Q3[i][0] ;
if(Q3[i][1] > maxy) maxy = Q3[i][1] ;
if(Q3[i][0] < minx) minx = Q3[i][0] ;
if(Q3[i][1] < miny) miny = Q3[i][1] ;
}
}
cout << "Q3: " << "(" << minx <<" , " << miny<<") " << "(" << maxx <<" , " << maxy<<") " << (maxx-minx)*(maxy-miny) <<endl ;
minx = Q4[0][0] , miny = Q4[0][1], maxx = Q4[0][0] , maxy = Q4[0][1] ;
for(int i = 0 ; i < Q4.size() ; i++){
for (int j = 0; j < 2; j++) {
if(Q4[i][0] > maxx) maxx = Q4[i][0] ;
if(Q4[i][1] > maxy) maxy = Q4[i][1] ;
if(Q4[i][0] < minx) minx = Q4[i][0] ;
if(Q4[i][1] < miny) miny = Q4[i][1] ;
}
}
cout << "Q4: " << "(" << minx <<" , " << miny<<") " << "(" << maxx <<" , " << maxy<<") " << (maxx-minx)*(maxy-miny) <<endl ;
} | # 2069725, 2024-11-02 11:18:40, -x-x-P--x- (10%)
#include<bits/stdc++.h>
using namespace std ;
int main(){
int n ; cin >> n ;
int x , y ;
bool check = false ;
vector<vector<int>> Q1 ;
vector<vector<int>> Q2 ;
vector<vector<int>> Q3 ;
vector<vector<int>> Q4 ;
while (n--) {
cin >> x >> y ;
if(x> 0 && y > 0){ Q1.push_back({x,y}); check = true ; }
else if (x > 0 && y < 0){ Q4.push_back({x,y}) ; check = true ; }
else if (x < 0 && y < 0) {Q3.push_back({x,y}) ; check = true ;}
else if (x < 0 && y > 0) {Q2.push_back({x,y}) ; check = true ;}
}
if(!check) {
cout << "No point in any quadrant" ;
return 0 ;
}
int minx = Q1[0][0] , miny = Q1[0][1], maxx = Q1[0][0] , maxy = Q1[0][1] ;
if(Q1.size()> 0){
for(int i = 0 ; i < Q1.size() ; i++){
for (int j = 0; j < 2; j++) {
if(Q1[i][0] > maxx) maxx = Q1[i][0] ;
if(Q1[i][1] > maxy) maxy = Q1[i][1] ;
if(Q1[i][0] < minx) minx = Q1[i][0] ;
if(Q1[i][1] < miny) miny = Q1[i][1] ;
}
}
cout << "Q1: " << "(" << minx <<" , " << miny<<") " << "(" << maxx <<" , " << maxy<<") " << (maxx-minx)*(maxy-miny) << endl ;
}
if(Q2.size()> 0){
minx = Q2[0][0] , miny = Q2[0][1], maxx = Q2[0][0] , maxy = Q2[0][1] ;
for(int i = 0 ; i < Q2.size() ; i++){
for (int j = 0; j < 2; j++) {
if(Q2[i][0] > maxx) maxx = Q2[i][0] ;
if(Q2[i][1] > maxy) maxy = Q2[i][1] ;
if(Q2[i][0] < minx) minx = Q2[i][0] ;
if(Q2[i][1] < miny) miny = Q2[i][1] ;
}
}
cout << "Q2: " << "(" << minx <<" , " << miny<<") " << "(" << maxx <<" , " << maxy<<") " << (maxx-minx)*(maxy-miny) <<endl ;
}
if(Q3.size()> 0){
minx = Q3[0][0] , miny = Q3[0][1], maxx = Q3[0][0] , maxy = Q3[0][1] ;
for(int i = 0 ; i < Q3.size() ; i++){
for (int j = 0; j < 2; j++) {
if(Q3[i][0] > maxx) maxx = Q3[i][0] ;
if(Q3[i][1] > maxy) maxy = Q3[i][1] ;
if(Q3[i][0] < minx) minx = Q3[i][0] ;
if(Q3[i][1] < miny) miny = Q3[i][1] ;
}
}
cout << "Q3: " << "(" << minx <<" , " << miny<<") " << "(" << maxx <<" , " << maxy<<") " << (maxx-minx)*(maxy-miny) <<endl ;
}
if(Q4.size()> 0){
minx = Q4[0][0] , miny = Q4[0][1], maxx = Q4[0][0] , maxy = Q4[0][1] ;
for(int i = 0 ; i < Q4.size() ; i++){
for (int j = 0; j < 2; j++) {
if(Q4[i][0] > maxx) maxx = Q4[i][0] ;
if(Q4[i][1] > maxy) maxy = Q4[i][1] ;
if(Q4[i][0] < minx) minx = Q4[i][0] ;
if(Q4[i][1] < miny) miny = Q4[i][1] ;
}
}
cout << "Q4: " << "(" << minx <<" , " << miny<<") " << "(" << maxx <<" , " << maxy<<") " << (maxx-minx)*(maxy-miny) <<endl ;
}
} | # 2069746, 2024-11-02 11:21:17, PxPxPPPPxP (70%)
#include<bits/stdc++.h>
using namespace std ;
int main(){
int n ; cin >> n ;
int x , y ;
bool check = false ;
vector<vector<int>> Q1 ;
vector<vector<int>> Q2 ;
vector<vector<int>> Q3 ;
vector<vector<int>> Q4 ;
while (n--) {
cin >> x >> y ;
if(x> 0 && y > 0){ Q1.push_back({x,y}); check = true ; }
else if (x > 0 && y < 0){ Q4.push_back({x,y}) ; check = true ; }
else if (x < 0 && y < 0) {Q3.push_back({x,y}) ; check = true ;}
else if (x < 0 && y > 0) {Q2.push_back({x,y}) ; check = true ;}
}
if(!check) {
cout << "No point in any quadrant" <<endl;
return 0 ;
}
int minx = Q1[0][0] , miny = Q1[0][1], maxx = Q1[0][0] , maxy = Q1[0][1] ;
if(Q1.size()> 0){
for(int i = 0 ; i < Q1.size() ; i++){
for (int j = 0; j < 2; j++) {
if(Q1[i][0] > maxx) maxx = Q1[i][0] ;
if(Q1[i][1] > maxy) maxy = Q1[i][1] ;
if(Q1[i][0] < minx) minx = Q1[i][0] ;
if(Q1[i][1] < miny) miny = Q1[i][1] ;
}
}
cout << "Q1: " << "(" << minx <<", " << miny<<") " << "(" << maxx <<", " << maxy<<") " << (maxx-minx)*(maxy-miny) << endl ;
}
if(Q2.size()> 0){
minx = Q2[0][0] , miny = Q2[0][1], maxx = Q2[0][0] , maxy = Q2[0][1] ;
for(int i = 0 ; i < Q2.size() ; i++){
for (int j = 0; j < 2; j++) {
if(Q2[i][0] > maxx) maxx = Q2[i][0] ;
if(Q2[i][1] > maxy) maxy = Q2[i][1] ;
if(Q2[i][0] < minx) minx = Q2[i][0] ;
if(Q2[i][1] < miny) miny = Q2[i][1] ;
}
}
cout << "Q2: " << "(" << minx <<", " << miny<<") " << "(" << maxx <<", " << maxy<<") " << (maxx-minx)*(maxy-miny) <<endl ;
}
if(Q3.size()> 0){
minx = Q3[0][0] , miny = Q3[0][1], maxx = Q3[0][0] , maxy = Q3[0][1] ;
for(int i = 0 ; i < Q3.size() ; i++){
for (int j = 0; j < 2; j++) {
if(Q3[i][0] > maxx) maxx = Q3[i][0] ;
if(Q3[i][1] > maxy) maxy = Q3[i][1] ;
if(Q3[i][0] < minx) minx = Q3[i][0] ;
if(Q3[i][1] < miny) miny = Q3[i][1] ;
}
}
cout << "Q3: " << "(" << minx <<", " << miny<<") " << "(" << maxx <<", " << maxy<<") " << (maxx-minx)*(maxy-miny) <<endl ;
}
if(Q4.size()> 0){
minx = Q4[0][0] , miny = Q4[0][1], maxx = Q4[0][0] , maxy = Q4[0][1] ;
for(int i = 0 ; i < Q4.size() ; i++){
for (int j = 0; j < 2; j++) {
if(Q4[i][0] > maxx) maxx = Q4[i][0] ;
if(Q4[i][1] > maxy) maxy = Q4[i][1] ;
if(Q4[i][0] < minx) minx = Q4[i][0] ;
if(Q4[i][1] < miny) miny = Q4[i][1] ;
}
}
cout << "Q4: " << "(" << minx <<", " << miny<<") " << "(" << maxx <<", " << maxy<<") " << (maxx-minx)*(maxy-miny) <<endl ;
}
} |
# 2071262, 2024-11-02 14:14:25, -----P---- (10%)
#include <iostream>
#include <map>
using namespace std;
int main(){
map<int, int> Q1, Q2, Q3, Q4;
int n; cin >> n;
while(n--){
int a, b;
cin >> a >> b;
if(a == 0 || b == 0) continue;
else{
if(a > 0 && b > 0) Q1[a] = b;
else if(a < 0 && b > 0) Q2[a] = b;
else if(a < 0 && b < 0) Q3[a] = b;
else if(a > 0 && b < 0) Q4[a] = b;
}
}
// cout << "/////////////////////////////" << endl;
// for (auto &m: Q1){
// cout << m.first << " " << m.second << endl;
// }
if (Q1.empty() && Q2.empty() && Q3.empty() && Q4.empty()) cout << "No point in any quadrant" << endl;
else{
return 0;
}
} | # 2071868, 2024-11-02 15:24:09, xxxxPPPPxP (50%)
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
int main(){
vector<int> fQ1, sQ1, fQ2, sQ2, fQ3, sQ3, fQ4, sQ4;
int n; cin >> n;
while(n--){
int a, b; cin >> a >> b;
if(a == 0 || b == 0){
continue;
}
else if(a > 0 && b > 0){
fQ1.push_back(a);
sQ1.push_back(b);
}
else if(a < 0 && b > 0){
fQ2.push_back(a);
sQ2.push_back(b);
}
else if(a < 0 && b < 0){
fQ3.push_back(a);
sQ3.push_back(b);
}
else if(a > 0 && b < 0){
fQ4.push_back(a);
sQ4.push_back(b);
}
}
if(fQ1.size() == 0 && fQ2.size() == 0 && fQ3.size() == 0 && fQ4.size() == 0){
cout << "No point in any quadrant" << endl;
return 0;
}
else{
sort(fQ1.rbegin(), fQ1.rend()); sort(sQ1.rbegin(), sQ1.rend());
sort(fQ2.rbegin(), fQ2.rend()); sort(sQ2.rbegin(), sQ2.rend());
sort(fQ3.rbegin(), fQ3.rend()); sort(sQ3.rbegin(), sQ3.rend());
sort(fQ4.rbegin(), fQ4.rend()); sort(sQ4.rbegin(), sQ4.rend());
int aQ1 = abs(fQ1[fQ1.size()-1] - fQ1[0]) * abs(sQ1[sQ1.size()-1] - sQ1[0]);
int aQ2 = abs(fQ2[fQ2.size()-1] - fQ2[0]) * abs(sQ2[sQ2.size()-1] - sQ2[0]);
int aQ3 = (abs(fQ3[fQ3.size()-1]) - abs(fQ3[0])) * (abs(sQ3[sQ3.size()-1]) - abs(sQ3[0]));
int aQ4 = abs((abs(fQ4[fQ4.size()-1]) - fQ4[0]) * (abs(sQ4[sQ4.size()-1]) - abs(sQ4[0])));
cout << "Q1: (" << fQ1[fQ1.size()-1] << ", " << sQ1[sQ1.size()-1] << ") (" << fQ1[0] << ", " << sQ1[0] << ") " << aQ1 << endl;
cout << "Q2: (" << fQ2[fQ2.size()-1] << ", " << sQ2[sQ2.size()-1] << ") (" << fQ2[0] << ", " << sQ2[0] << ") " << aQ2 << endl;
cout << "Q3: (" << fQ3[fQ3.size()-1] << ", " << sQ3[sQ3.size()-1] << ") (" << fQ3[0] << ", " << sQ3[0] << ") " << aQ3 << endl;
cout << "Q4: (" << fQ4[fQ4.size()-1] << ", " << sQ4[sQ4.size()-1] << ") (" << fQ4[0] << ", " << sQ4[0] << ") " << aQ4 << endl;
}
} | # 2072005, 2024-11-02 15:32:00, xx-xPPPPxP (50%)
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
int main(){
vector<int> fQ1, sQ1, fQ2, sQ2, fQ3, sQ3, fQ4, sQ4;
int n; cin >> n;
while(n--){
int a, b; cin >> a >> b;
if(a == 0 || b == 0){
continue;
}
else if(a > 0 && b > 0){
fQ1.push_back(a);
sQ1.push_back(b);
}
else if(a < 0 && b > 0){
fQ2.push_back(a);
sQ2.push_back(b);
}
else if(a < 0 && b < 0){
fQ3.push_back(a);
sQ3.push_back(b);
}
else if(a > 0 && b < 0){
fQ4.push_back(a);
sQ4.push_back(b);
}
}
if(fQ1.size() == 0 && fQ2.size() == 0 && fQ3.size() == 0 && fQ4.size() == 0){
cout << "No point in any quadrant" << endl;
return 0;
}
else{
if (fQ1.size() != 0 && sQ1.size() != 0 && fQ2.size() != 0 && sQ2.size() != 0 && fQ4.size() != 0 && sQ4.size() != 0 && fQ3.size() != 0 && sQ3.size() != 0){
sort(fQ1.rbegin(), fQ1.rend()); sort(sQ1.rbegin(), sQ1.rend());
sort(fQ2.rbegin(), fQ2.rend()); sort(sQ2.rbegin(), sQ2.rend());
sort(fQ3.rbegin(), fQ3.rend()); sort(sQ3.rbegin(), sQ3.rend());
sort(fQ4.rbegin(), fQ4.rend()); sort(sQ4.rbegin(), sQ4.rend());
int aQ1 = abs(fQ1[fQ1.size()-1] - fQ1[0]) * abs(sQ1[sQ1.size()-1] - sQ1[0]);
int aQ2 = abs(fQ2[fQ2.size()-1] - fQ2[0]) * abs(sQ2[sQ2.size()-1] - sQ2[0]);
int aQ3 = (abs(fQ3[fQ3.size()-1]) - abs(fQ3[0])) * (abs(sQ3[sQ3.size()-1]) - abs(sQ3[0]));
int aQ4 = abs((abs(fQ4[fQ4.size()-1]) - fQ4[0]) * (abs(sQ4[sQ4.size()-1]) - abs(sQ4[0])));
cout << "Q1: (" << fQ1[fQ1.size()-1] << ", " << sQ1[sQ1.size()-1] << ") (" << fQ1[0] << ", " << sQ1[0] << ") " << aQ1 << endl;
cout << "Q2: (" << fQ2[fQ2.size()-1] << ", " << sQ2[sQ2.size()-1] << ") (" << fQ2[0] << ", " << sQ2[0] << ") " << aQ2 << endl;
cout << "Q3: (" << fQ3[fQ3.size()-1] << ", " << sQ3[sQ3.size()-1] << ") (" << fQ3[0] << ", " << sQ3[0] << ") " << aQ3 << endl;
cout << "Q4: (" << fQ4[fQ4.size()-1] << ", " << sQ4[sQ4.size()-1] << ") (" << fQ4[0] << ", " << sQ4[0] << ") " << aQ4 << endl;
}
else if(fQ1.size() == 0 && sQ1.size() == 0){
sort(fQ1.rbegin(), fQ1.rend()); sort(sQ1.rbegin(), sQ1.rend());
sort(fQ3.rbegin(), fQ3.rend()); sort(sQ3.rbegin(), sQ3.rend());
sort(fQ4.rbegin(), fQ4.rend()); sort(sQ4.rbegin(), sQ4.rend());
int aQ1 = abs(fQ1[fQ1.size()-1] - fQ1[0]) * abs(sQ1[sQ1.size()-1] - sQ1[0]);
int aQ3 = (abs(fQ3[fQ3.size()-1]) - abs(fQ3[0])) * (abs(sQ3[sQ3.size()-1]) - abs(sQ3[0]));
int aQ4 = abs((abs(fQ4[fQ4.size()-1]) - fQ4[0]) * (abs(sQ4[sQ4.size()-1]) - abs(sQ4[0])));
cout << "Q1: (" << fQ1[fQ1.size()-1] << ", " << sQ1[sQ1.size()-1] << ") (" << fQ1[0] << ", " << sQ1[0] << ") " << aQ1 << endl;
cout << "Q3: (" << fQ3[fQ3.size()-1] << ", " << sQ3[sQ3.size()-1] << ") (" << fQ3[0] << ", " << sQ3[0] << ") " << aQ3 << endl;
cout << "Q4: (" << fQ4[fQ4.size()-1] << ", " << sQ4[sQ4.size()-1] << ") (" << fQ4[0] << ", " << sQ4[0] << ") " << aQ4 << endl;
}
else if(fQ2.size() == 0 && sQ2.size() == 0){
sort(fQ1.rbegin(), fQ1.rend()); sort(sQ1.rbegin(), sQ1.rend());
sort(fQ3.rbegin(), fQ3.rend()); sort(sQ3.rbegin(), sQ3.rend());
sort(fQ4.rbegin(), fQ4.rend()); sort(sQ4.rbegin(), sQ4.rend());
int aQ1 = abs(fQ1[fQ1.size()-1] - fQ1[0]) * abs(sQ1[sQ1.size()-1] - sQ1[0]);
int aQ3 = (abs(fQ3[fQ3.size()-1]) - abs(fQ3[0])) * (abs(sQ3[sQ3.size()-1]) - abs(sQ3[0]));
int aQ4 = abs((abs(fQ4[fQ4.size()-1]) - fQ4[0]) * (abs(sQ4[sQ4.size()-1]) - abs(sQ4[0])));
cout << "Q1: (" << fQ1[fQ1.size()-1] << ", " << sQ1[sQ1.size()-1] << ") (" << fQ1[0] << ", " << sQ1[0] << ") " << aQ1 << endl;
cout << "Q3: (" << fQ3[fQ3.size()-1] << ", " << sQ3[sQ3.size()-1] << ") (" << fQ3[0] << ", " << sQ3[0] << ") " << aQ3 << endl;
cout << "Q4: (" << fQ4[fQ4.size()-1] << ", " << sQ4[sQ4.size()-1] << ") (" << fQ4[0] << ", " << sQ4[0] << ") " << aQ4 << endl;
}
// cout << "Q1: (" << fQ1[fQ1.size()-1] << ", " << sQ1[sQ1.size()-1] << ") (" << fQ1[0] << ", " << sQ1[0] << ") " << aQ1 << endl;
// cout << "Q2: (" << fQ2[fQ2.size()-1] << ", " << sQ2[sQ2.size()-1] << ") (" << fQ2[0] << ", " << sQ2[0] << ") " << aQ2 << endl;
// cout << "Q3: (" << fQ3[fQ3.size()-1] << ", " << sQ3[sQ3.size()-1] << ") (" << fQ3[0] << ", " << sQ3[0] << ") " << aQ3 << endl;
// cout << "Q4: (" << fQ4[fQ4.size()-1] << ", " << sQ4[sQ4.size()-1] << ") (" << fQ4[0] << ", " << sQ4[0] << ") " << aQ4 << endl;
}
} |
# 2069330, 2024-11-02 10:37:03, -----P---- (10%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
double x,y;
vector<pair<double,double>> Q1;
vector<pair<double,double>> Q2;
vector<pair<double,double>> Q3;
vector<pair<double,double>> Q4;
while(n--){
cin >> x >> y;
if(x>0 && y>0){
Q1.push_back(make_pair(x,y));
}else if(x<0 && y>0){
Q2.push_back(make_pair(x,y));
}else if(x<0 && y<0){
Q3.push_back(make_pair(x,y));
}else if(x>0 && y<0){
Q4.push_back(make_pair(x,y));
}
}
if(Q1.empty() && Q2.empty() && Q3.empty() && Q4.empty()){
cout << "No point in any quadrant" ;
}
} | # 2069748, 2024-11-02 11:21:18, ---------- (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int x,y;
vector<pair<int,int>> Q1;
vector<pair<int,int>> Q2;
vector<pair<int,int>> Q3;
vector<pair<int,int>> Q4;
while(n--){
cin >> x >> y;
if(x>0 && y>0){
Q1.push_back(make_pair(x,y));
}else if(x<0 && y>0){
Q2.push_back(make_pair(x,y));
}else if(x<0 && y<0){
Q3.push_back(make_pair(x,y));
}else if(x>0 && y<0){
Q4.push_back(make_pair(x,y));
}
}
if(Q1.empty() && Q2.empty() && Q3.empty() && Q4.empty()){
cout << "No point in any quadrant" ;
}
//max min Q1
int minx=0,miny=0,maxx=0,maxy=0;
for(auto c:Q1){
minx=c.first,miny=c.second;
maxx=c.first,maxy=c.second;
minx = min(minx,c.first);
miny = min(miny,c.second);
maxx = max(maxx,c.first);
maxy = max(maxy,c.second);
}
vector<pair<int,int>> Q1res;
int mul1=(maxx-minx)*(maxy-miny);
Q1res.push_back(make_pair(minx,miny));
Q1res.push_back(make_pair(maxx,maxy));
//Q2
for(auto c:Q2){
minx=c.first,miny=c.second;
maxx=c.first,maxy=c.second;
minx = min(minx,c.first);
miny = min(miny,c.second);
maxx = max(maxx,c.first);
maxy = max(maxy,c.second);
}
vector<pair<int,int>> Q2res;
int mul2=(maxx-minx)*(maxy-miny);
Q2res.push_back(make_pair(minx,miny));
Q2res.push_back(make_pair(maxx,maxy));
//Q3
for(auto c:Q3){
minx=c.first,miny=c.second;
maxx=c.first,maxy=c.second;
minx = min(minx,c.first);
miny = min(miny,c.second);
maxx = max(maxx,c.first);
maxy = max(maxy,c.second);
}
vector<pair<int,int>> Q3res;
int mul3=(maxx-minx)*(maxy-miny);
Q3res.push_back(make_pair(minx,miny));
Q3res.push_back(make_pair(maxx,maxy));
//Q4
for(auto c:Q4){
minx=c.first,miny=c.second;
maxx=c.first,maxy=c.second;
minx = min(minx,c.first);
miny = min(miny,c.second);
maxx = max(maxx,c.first);
maxy = max(maxy,c.second);
}
vector<pair<int,int>> Q4res;
int mul4=(maxx-minx)*(maxy-miny);
Q4res.push_back(make_pair(minx,miny));
Q4res.push_back(make_pair(maxx,maxy));
int k1=0,k2=0,k3=0,k4=0;
cout << "Q1: ";
k1+=Q1res[0].first, k2+=Q1res[0].second, k3+=Q1res[1].first, k4+=Q1res[1].second;
cout << "(" << k1 << ", " << k2 << ") (" << k3 << ", " << k4 << ") " << mul1 << endl;
cout << "Q2: ";
k1+=Q2res[0].first, k2+=Q2res[0].second, k3+=Q2res[1].first, k4+=Q2res[1].second;
cout << "(" << k1 << ", " << k2 << ") (" << k3 << ", " << k4 << ") " << mul2 << endl;
cout << "Q3: ";
k1+=Q3res[0].first, k2+=Q3res[0].second, k3+=Q3res[1].first, k4+=Q3res[1].second;
cout << "(" << k1 << ", " << k2 << ") (" << k3 << ", " << k4 << ") " << mul3 << endl;
cout << "Q4: ";
k1+=Q4res[0].first, k2+=Q4res[0].second, k3+=Q4res[1].first, k4+=Q4res[1].second;
cout << "(" << k1 << ", " << k2 << ") (" << k3 << ", " << k4 << ") " << mul4 << endl;
} | # 2069788, 2024-11-02 11:25:01, xxxx-x--x- (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int x,y;
vector<pair<int,int>> Q1;
vector<pair<int,int>> Q2;
vector<pair<int,int>> Q3;
vector<pair<int,int>> Q4;
while(n--){
cin >> x >> y;
if(x>0 && y>0){
Q1.push_back(make_pair(x,y));
}else if(x<0 && y>0){
Q2.push_back(make_pair(x,y));
}else if(x<0 && y<0){
Q3.push_back(make_pair(x,y));
}else if(x>0 && y<0){
Q4.push_back(make_pair(x,y));
}
}
if(Q1.empty() && Q2.empty() && Q3.empty() && Q4.empty()){
cout << "No point in any quadrant" ;
}
//max min Q1
int minx=0,miny=0,maxx=0,maxy=0;
minx=Q1[0].first,miny=Q1[0].second;
maxx=Q1[0].first,maxy=Q1[0].second;
for(auto c:Q1){
minx = min(minx,c.first);
miny = min(miny,c.second);
maxx = max(maxx,c.first);
maxy = max(maxy,c.second);
}
vector<pair<int,int>> Q1res;
int mul1=(maxx-minx)*(maxy-miny);
Q1res.push_back(make_pair(minx,miny));
Q1res.push_back(make_pair(maxx,maxy));
//Q2
minx=Q2[0].first,miny=Q2[0].second;
maxx=Q2[0].first,maxy=Q2[0].second;
for(auto c:Q2){
minx = min(minx,c.first);
miny = min(miny,c.second);
maxx = max(maxx,c.first);
maxy = max(maxy,c.second);
}
vector<pair<int,int>> Q2res;
int mul2=(maxx-minx)*(maxy-miny);
Q2res.push_back(make_pair(minx,miny));
Q2res.push_back(make_pair(maxx,maxy));
//Q3
minx=Q3[0].first,miny=Q3[0].second;
maxx=Q3[0].first,maxy=Q3[0].second;
for(auto c:Q3){
minx = min(minx,c.first);
miny = min(miny,c.second);
maxx = max(maxx,c.first);
maxy = max(maxy,c.second);
}
vector<pair<int,int>> Q3res;
int mul3=(maxx-minx)*(maxy-miny);
Q3res.push_back(make_pair(minx,miny));
Q3res.push_back(make_pair(maxx,maxy));
//Q4
minx=Q4[0].first,miny=Q4[0].second;
maxx=Q4[0].first,maxy=Q4[0].second;
for(auto c:Q4){
minx = min(minx,c.first);
miny = min(miny,c.second);
maxx = max(maxx,c.first);
maxy = max(maxy,c.second);
}
vector<pair<int,int>> Q4res;
int mul4=(maxx-minx)*(maxy-miny);
Q4res.push_back(make_pair(minx,miny));
Q4res.push_back(make_pair(maxx,maxy));
int k1=0,k2=0,k3=0,k4=0;
cout << "Q1: ";
k1+=Q1res[0].first, k2+=Q1res[0].second, k3+=Q1res[1].first, k4+=Q1res[1].second;
cout << "(" << k1 << ", " << k2 << ") (" << k3 << ", " << k4 << ") " << mul1 << endl;
cout << "Q2: ";
k1+=Q2res[0].first, k2+=Q2res[0].second, k3+=Q2res[1].first, k4+=Q2res[1].second;
cout << "(" << k1 << ", " << k2 << ") (" << k3 << ", " << k4 << ") " << mul2 << endl;
cout << "Q3: ";
k1+=Q3res[0].first, k2+=Q3res[0].second, k3+=Q3res[1].first, k4+=Q3res[1].second;
cout << "(" << k1 << ", " << k2 << ") (" << k3 << ", " << k4 << ") " << mul3 << endl;
cout << "Q4: ";
k1+=Q4res[0].first, k2+=Q4res[0].second, k3+=Q4res[1].first, k4+=Q4res[1].second;
cout << "(" << k1 << ", " << k2 << ") (" << k3 << ", " << k4 << ") " << mul4 << endl;
} | # 2069792, 2024-11-02 11:25:22, xxxx-x--x- (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int x,y;
vector<pair<int,int>> Q1;
vector<pair<int,int>> Q2;
vector<pair<int,int>> Q3;
vector<pair<int,int>> Q4;
while(n--){
cin >> x >> y;
if(x>0 && y>0){
Q1.push_back(make_pair(x,y));
}else if(x<0 && y>0){
Q2.push_back(make_pair(x,y));
}else if(x<0 && y<0){
Q3.push_back(make_pair(x,y));
}else if(x>0 && y<0){
Q4.push_back(make_pair(x,y));
}
}
if(Q1.empty() && Q2.empty() && Q3.empty() && Q4.empty()){
cout << "No point in any quadrant" ;
}
//max min Q1
int minx=0,miny=0,maxx=0,maxy=0;
minx=Q1[0].first,miny=Q1[0].second;
maxx=Q1[0].first,maxy=Q1[0].second;
for(auto c:Q1){
minx = min(minx,c.first);
miny = min(miny,c.second);
maxx = max(maxx,c.first);
maxy = max(maxy,c.second);
}
vector<pair<int,int>> Q1res;
int mul1=(maxx-minx)*(maxy-miny);
Q1res.push_back(make_pair(minx,miny));
Q1res.push_back(make_pair(maxx,maxy));
//Q2
minx=Q2[0].first,miny=Q2[0].second;
maxx=Q2[0].first,maxy=Q2[0].second;
for(auto c:Q2){
minx = min(minx,c.first);
miny = min(miny,c.second);
maxx = max(maxx,c.first);
maxy = max(maxy,c.second);
}
vector<pair<int,int>> Q2res;
int mul2=(maxx-minx)*(maxy-miny);
Q2res.push_back(make_pair(minx,miny));
Q2res.push_back(make_pair(maxx,maxy));
//Q3
minx=Q3[0].first,miny=Q3[0].second;
maxx=Q3[0].first,maxy=Q3[0].second;
for(auto c:Q3){
minx = min(minx,c.first);
miny = min(miny,c.second);
maxx = max(maxx,c.first);
maxy = max(maxy,c.second);
}
vector<pair<int,int>> Q3res;
int mul3=(maxx-minx)*(maxy-miny);
Q3res.push_back(make_pair(minx,miny));
Q3res.push_back(make_pair(maxx,maxy));
//Q4
minx=Q4[0].first,miny=Q4[0].second;
maxx=Q4[0].first,maxy=Q4[0].second;
for(auto c:Q4){
minx = min(minx,c.first);
miny = min(miny,c.second);
maxx = max(maxx,c.first);
maxy = max(maxy,c.second);
}
vector<pair<int,int>> Q4res;
int mul4=(maxx-minx)*(maxy-miny);
Q4res.push_back(make_pair(minx,miny));
Q4res.push_back(make_pair(maxx,maxy));
int k1=0,k2=0,k3=0,k4=0;
cout << "Q1: ";
k1+=Q1res[0].first, k2+=Q1res[0].second, k3+=Q1res[1].first, k4+=Q1res[1].second;
cout << "(" << k1 << ", " << k2 << ") (" << k3 << ", " << k4 << ") " << mul1 << endl;
cout << "Q2: ";
k1+=Q2res[0].first, k2+=Q2res[0].second, k3+=Q2res[1].first, k4+=Q2res[1].second;
cout << "(" << k1 << ", " << k2 << ") (" << k3 << ", " << k4 << ") " << mul2 << endl;
cout << "Q3: ";
k1+=Q3res[0].first, k2+=Q3res[0].second, k3+=Q3res[1].first, k4+=Q3res[1].second;
cout << "(" << k1 << ", " << k2 << ") (" << k3 << ", " << k4 << ") " << mul3 << endl;
cout << "Q4: ";
k1+=Q4res[0].first, k2+=Q4res[0].second, k3+=Q4res[1].first, k4+=Q4res[1].second;
cout << "(" << k1 << ", " << k2 << ") (" << k3 << ", " << k4 << ") " << mul4 << endl;
} | # 2069805, 2024-11-02 11:26:08, xxxx-x--x- (0%)
#include <iostream>
#include <vector>
#include <utility>
using namespace std;
int main(){
int n;
cin >> n;
int x,y;
vector<pair<int,int>> Q1;
vector<pair<int,int>> Q2;
vector<pair<int,int>> Q3;
vector<pair<int,int>> Q4;
while(n--){
cin >> x >> y;
if(x>0 && y>0){
Q1.push_back(make_pair(x,y));
}else if(x<0 && y>0){
Q2.push_back(make_pair(x,y));
}else if(x<0 && y<0){
Q3.push_back(make_pair(x,y));
}else if(x>0 && y<0){
Q4.push_back(make_pair(x,y));
}
}
if(Q1.empty() && Q2.empty() && Q3.empty() && Q4.empty()){
cout << "No point in any quadrant" ;
}
//max min Q1
int minx=0,miny=0,maxx=0,maxy=0;
minx=Q1[0].first,miny=Q1[0].second;
maxx=Q1[0].first,maxy=Q1[0].second;
for(auto c:Q1){
minx = min(minx,c.first);
miny = min(miny,c.second);
maxx = max(maxx,c.first);
maxy = max(maxy,c.second);
}
vector<pair<int,int>> Q1res;
int mul1=(maxx-minx)*(maxy-miny);
Q1res.push_back(make_pair(minx,miny));
Q1res.push_back(make_pair(maxx,maxy));
//Q2
minx=Q2[0].first,miny=Q2[0].second;
maxx=Q2[0].first,maxy=Q2[0].second;
for(auto c:Q2){
minx = min(minx,c.first);
miny = min(miny,c.second);
maxx = max(maxx,c.first);
maxy = max(maxy,c.second);
}
vector<pair<int,int>> Q2res;
int mul2=(maxx-minx)*(maxy-miny);
Q2res.push_back(make_pair(minx,miny));
Q2res.push_back(make_pair(maxx,maxy));
//Q3
minx=Q3[0].first,miny=Q3[0].second;
maxx=Q3[0].first,maxy=Q3[0].second;
for(auto c:Q3){
minx = min(minx,c.first);
miny = min(miny,c.second);
maxx = max(maxx,c.first);
maxy = max(maxy,c.second);
}
vector<pair<int,int>> Q3res;
int mul3=(maxx-minx)*(maxy-miny);
Q3res.push_back(make_pair(minx,miny));
Q3res.push_back(make_pair(maxx,maxy));
//Q4
minx=Q4[0].first,miny=Q4[0].second;
maxx=Q4[0].first,maxy=Q4[0].second;
for(auto c:Q4){
minx = min(minx,c.first);
miny = min(miny,c.second);
maxx = max(maxx,c.first);
maxy = max(maxy,c.second);
}
vector<pair<int,int>> Q4res;
int mul4=(maxx-minx)*(maxy-miny);
Q4res.push_back(make_pair(minx,miny));
Q4res.push_back(make_pair(maxx,maxy));
int k1=0,k2=0,k3=0,k4=0;
cout << "Q1: ";
k1+=Q1res[0].first, k2+=Q1res[0].second, k3+=Q1res[1].first, k4+=Q1res[1].second;
cout << "(" << k1 << ", " << k2 << ") (" << k3 << ", " << k4 << ") " << mul1 << endl;
cout << "Q2: ";
k1+=Q2res[0].first, k2+=Q2res[0].second, k3+=Q2res[1].first, k4+=Q2res[1].second;
cout << "(" << k1 << ", " << k2 << ") (" << k3 << ", " << k4 << ") " << mul2 << endl;
cout << "Q3: ";
k1+=Q3res[0].first, k2+=Q3res[0].second, k3+=Q3res[1].first, k4+=Q3res[1].second;
cout << "(" << k1 << ", " << k2 << ") (" << k3 << ", " << k4 << ") " << mul3 << endl;
cout << "Q4: ";
k1+=Q4res[0].first, k2+=Q4res[0].second, k3+=Q4res[1].first, k4+=Q4res[1].second;
cout << "(" << k1 << ", " << k2 << ") (" << k3 << ", " << k4 << ") " << mul4 << endl;
} | # 2069839, 2024-11-02 11:29:17, xxxxPxPPxP (40%)
#include <iostream>
#include <vector>
#include <utility>
using namespace std;
int main(){
int n;
cin >> n;
int x,y;
vector<pair<int,int>> Q1;
vector<pair<int,int>> Q2;
vector<pair<int,int>> Q3;
vector<pair<int,int>> Q4;
while(n--){
cin >> x >> y;
if(x>0 && y>0){
Q1.push_back(make_pair(x,y));
}else if(x<0 && y>0){
Q2.push_back(make_pair(x,y));
}else if(x<0 && y<0){
Q3.push_back(make_pair(x,y));
}else if(x>0 && y<0){
Q4.push_back(make_pair(x,y));
}
}
if(Q1.empty() && Q2.empty() && Q3.empty() && Q4.empty()){
cout << "No point in any quadrant" ;
}
//max min Q1
int minx=0,miny=0,maxx=0,maxy=0;
minx=Q1[0].first,miny=Q1[0].second;
maxx=Q1[0].first,maxy=Q1[0].second;
for(auto c:Q1){
minx = min(minx,c.first);
miny = min(miny,c.second);
maxx = max(maxx,c.first);
maxy = max(maxy,c.second);
}
vector<pair<int,int>> Q1res;
int mul1=(maxx-minx)*(maxy-miny);
Q1res.push_back(make_pair(minx,miny));
Q1res.push_back(make_pair(maxx,maxy));
//Q2
minx=Q2[0].first,miny=Q2[0].second;
maxx=Q2[0].first,maxy=Q2[0].second;
for(auto c:Q2){
minx = min(minx,c.first);
miny = min(miny,c.second);
maxx = max(maxx,c.first);
maxy = max(maxy,c.second);
}
vector<pair<int,int>> Q2res;
int mul2=(maxx-minx)*(maxy-miny);
Q2res.push_back(make_pair(minx,miny));
Q2res.push_back(make_pair(maxx,maxy));
//Q3
minx=Q3[0].first,miny=Q3[0].second;
maxx=Q3[0].first,maxy=Q3[0].second;
for(auto c:Q3){
minx = min(minx,c.first);
miny = min(miny,c.second);
maxx = max(maxx,c.first);
maxy = max(maxy,c.second);
}
vector<pair<int,int>> Q3res;
int mul3=(maxx-minx)*(maxy-miny);
Q3res.push_back(make_pair(minx,miny));
Q3res.push_back(make_pair(maxx,maxy));
//Q4
minx=Q4[0].first,miny=Q4[0].second;
maxx=Q4[0].first,maxy=Q4[0].second;
for(auto c:Q4){
minx = min(minx,c.first);
miny = min(miny,c.second);
maxx = max(maxx,c.first);
maxy = max(maxy,c.second);
}
vector<pair<int,int>> Q4res;
int mul4=(maxx-minx)*(maxy-miny);
Q4res.push_back(make_pair(minx,miny));
Q4res.push_back(make_pair(maxx,maxy));
int k1=0,k2=0,k3=0,k4=0;
cout << "Q1: ";
k1+=Q1res[0].first, k2+=Q1res[0].second, k3+=Q1res[1].first, k4+=Q1res[1].second;
cout << "(" << k1 << ", " << k2 << ") (" << k3 << ", " << k4 << ") " << mul1 << endl;
k1=0,k2=0,k3=0,k4=0;
cout << "Q2: ";
k1+=Q2res[0].first, k2+=Q2res[0].second, k3+=Q2res[1].first, k4+=Q2res[1].second;
cout << "(" << k1 << ", " << k2 << ") (" << k3 << ", " << k4 << ") " << mul2 << endl;
k1=0,k2=0,k3=0,k4=0;
cout << "Q3: ";
k1+=Q3res[0].first, k2+=Q3res[0].second, k3+=Q3res[1].first, k4+=Q3res[1].second;
cout << "(" << k1 << ", " << k2 << ") (" << k3 << ", " << k4 << ") " << mul3 << endl;
k1=0,k2=0,k3=0,k4=0;
cout << "Q4: ";
k1+=Q4res[0].first, k2+=Q4res[0].second, k3+=Q4res[1].first, k4+=Q4res[1].second;
cout << "(" << k1 << ", " << k2 << ") (" << k3 << ", " << k4 << ") " << mul4 << endl;
} |
# 2071539, 2024-11-02 14:46:38, xxxx-x--x- (0%)
#include<iostream>
#include<vector>
using namespace std;
int main(){
int N;
cin>>N;
vector<pair<int,int>> q1;
vector<pair<int,int>> q2;
vector<pair<int,int>> q3;
vector<pair<int,int>> q4;
int x,y;
while(N--){
cin>>x>>y;
if(x>0 && y>0) {
q1.push_back({x,y});
} else if(x>0 && y<0){
q4.push_back({x,y});
} else if(x<0 && y<0){
q3.push_back({x,y});
} else if(x<0 && y>0){
q2.push_back({x,y});
}
}
int area1;
int maxx1=q1[0].first, minx1=q1[0].first, maxy1=q1[0].second, miny1=q1[0].second;
for(auto e : q1){
if(e.first>maxx1) maxx1 = e.first;
if(e.first<minx1) minx1 = e.first;
if(e.second>maxy1) maxy1 = e.second;
if(e.second<miny1) miny1 = e.second;
}
area1 = (maxx1-minx1) * (maxy1-miny1);
//cout<<area1<<endl;
int area2;
int maxx2=q2[0].first, minx2=q2[0].first,maxy2=q2[0].second,miny2=q2[0].second;
for(auto e : q2){
if(abs(e.first)>maxx2) maxx2 = e.first;
if(abs(e.first)<minx2) minx2 = e.first;
if(e.second>maxy2) maxy2 = e.second;
if(e.second<miny2) miny2 = e.second;
}
area2 = (maxx2-minx2) * (maxy2-miny2);
//cout<<abs(area2)<<endl;
int area3;
int maxx3=q3[0].first, minx3=q3[0].first, maxy3=q3[0].second, miny3=q3[0].second;
for(auto e : q3){
if(abs(e.first)>maxx3) maxx3 = e.first;
if(abs(e.first)<minx3) minx3 = e.first;
if(abs(e.second)>maxy3) maxy3 = e.second;
if(abs(e.second)<miny3) miny3 = e.second;
}
area3 = (maxx3-minx3) * (maxy3-miny3);
//cout<<abs(area3)<<endl;
int area4;
int maxx4=q4[0].first,minx4=q4[0].first, maxy4=q4[0].second, miny4=q4[0].second;
for(auto e : q4){
if(e.first>maxx4) maxx4 = e.first;
if(e.first<minx4) minx4 = e.first;
if(e.second<miny4) miny4 = e.second;
if(e.second>maxy4) maxy4 = e.second;
}
cout<<maxx4-minx4<<" "<<maxy4-miny4<<endl;
area4 = (maxx4-minx4) * (maxy4-miny4);
//cout<<abs(area4)<<endl;
if(q1.size()!= 0){
cout<<"Q1: ("<<minx1<<", "<<miny1<<") ("<<maxx1<<", "<<maxy1<<") "<<area1<<endl;
}
if(q2.size()!= 0){
cout<<"Q2: ("<<minx2<<", "<<miny2<<") ("<<maxx2<<", "<<maxy2<<") "<<abs(area2)<<endl;
}
if(q3.size()!= 0){
cout<<"Q3: ("<<minx3<<", "<<miny3<<") ("<<maxx3<<", "<<maxy3<<") "<<area3<<endl;
}
if(q4.size()!= 0){
cout<<"Q4: ("<<minx4<<", "<<miny4<<") ("<<maxx4<<", "<<maxy4<<") "<<area4<<endl;
}
} | # 2071547, 2024-11-02 14:47:44, xxxxPx-Px- (20%)
#include<iostream>
#include<vector>
using namespace std;
int main(){
int N;
cin>>N;
vector<pair<int,int>> q1;
vector<pair<int,int>> q2;
vector<pair<int,int>> q3;
vector<pair<int,int>> q4;
int x,y;
while(N--){
cin>>x>>y;
if(x>0 && y>0) {
q1.push_back({x,y});
} else if(x>0 && y<0){
q4.push_back({x,y});
} else if(x<0 && y<0){
q3.push_back({x,y});
} else if(x<0 && y>0){
q2.push_back({x,y});
}
}
int area1;
int maxx1=q1[0].first, minx1=q1[0].first, maxy1=q1[0].second, miny1=q1[0].second;
for(auto e : q1){
if(e.first>maxx1) maxx1 = e.first;
if(e.first<minx1) minx1 = e.first;
if(e.second>maxy1) maxy1 = e.second;
if(e.second<miny1) miny1 = e.second;
}
area1 = (maxx1-minx1) * (maxy1-miny1);
//cout<<area1<<endl;
int area2;
int maxx2=q2[0].first, minx2=q2[0].first,maxy2=q2[0].second,miny2=q2[0].second;
for(auto e : q2){
if(abs(e.first)>maxx2) maxx2 = e.first;
if(abs(e.first)<minx2) minx2 = e.first;
if(e.second>maxy2) maxy2 = e.second;
if(e.second<miny2) miny2 = e.second;
}
area2 = (maxx2-minx2) * (maxy2-miny2);
//cout<<abs(area2)<<endl;
int area3;
int maxx3=q3[0].first, minx3=q3[0].first, maxy3=q3[0].second, miny3=q3[0].second;
for(auto e : q3){
if(abs(e.first)>maxx3) maxx3 = e.first;
if(abs(e.first)<minx3) minx3 = e.first;
if(abs(e.second)>maxy3) maxy3 = e.second;
if(abs(e.second)<miny3) miny3 = e.second;
}
area3 = (maxx3-minx3) * (maxy3-miny3);
//cout<<abs(area3)<<endl;
int area4;
int maxx4=q4[0].first,minx4=q4[0].first, maxy4=q4[0].second, miny4=q4[0].second;
for(auto e : q4){
if(e.first>maxx4) maxx4 = e.first;
if(e.first<minx4) minx4 = e.first;
if(e.second<miny4) miny4 = e.second;
if(e.second>maxy4) maxy4 = e.second;
}
//cout<<maxx4-minx4<<" "<<maxy4-miny4<<endl;
area4 = (maxx4-minx4) * (maxy4-miny4);
//cout<<abs(area4)<<endl;
if(q1.size()!= 0){
cout<<"Q1: ("<<minx1<<", "<<miny1<<") ("<<maxx1<<", "<<maxy1<<") "<<area1<<endl;
}
if(q2.size()!= 0){
cout<<"Q2: ("<<minx2<<", "<<miny2<<") ("<<maxx2<<", "<<maxy2<<") "<<abs(area2)<<endl;
}
if(q3.size()!= 0){
cout<<"Q3: ("<<minx3<<", "<<miny3<<") ("<<maxx3<<", "<<maxy3<<") "<<area3<<endl;
}
if(q4.size()!= 0){
cout<<"Q4: ("<<minx4<<", "<<miny4<<") ("<<maxx4<<", "<<maxy4<<") "<<area4<<endl;
}
} | # 2071850, 2024-11-02 15:22:42, xxxxPP-Px- (30%)
#include<iostream>
#include<vector>
using namespace std;
int main(){
int N;
cin>>N;
vector<pair<int,int>> q1;
vector<pair<int,int>> q2;
vector<pair<int,int>> q3;
vector<pair<int,int>> q4;
int x,y;
while(N--){
cin>>x>>y;
if(x>0 && y>0) {
q1.push_back({x,y});
} else if(x>0 && y<0){
q4.push_back({x,y});
} else if(x<0 && y<0){
q3.push_back({x,y});
} else if(x<0 && y>0){
q2.push_back({x,y});
}
}
if(q1.size() == 0 && q2.size() == 0 && q3.size() == 0 && q4.size() == 0){
cout<<"No point in any quadrant";
} else {
int area1;
int maxx1=q1[0].first, minx1=q1[0].first, maxy1=q1[0].second, miny1=q1[0].second;
for(auto e : q1){
if(e.first>maxx1) maxx1 = e.first;
if(e.first<minx1) minx1 = e.first;
if(e.second>maxy1) maxy1 = e.second;
if(e.second<miny1) miny1 = e.second;
}
area1 = (maxx1-minx1) * (maxy1-miny1);
//cout<<area1<<endl;
int area2;
int maxx2=q2[0].first, minx2=q2[0].first,maxy2=q2[0].second,miny2=q2[0].second;
for(auto e : q2){
if(abs(e.first)>maxx2) maxx2 = e.first;
if(abs(e.first)<minx2) minx2 = e.first;
if(e.second>maxy2) maxy2 = e.second;
if(e.second<miny2) miny2 = e.second;
}
area2 = (maxx2-minx2) * (maxy2-miny2);
//cout<<abs(area2)<<endl;
int area3;
int maxx3=q3[0].first, minx3=q3[0].first, maxy3=q3[0].second, miny3=q3[0].second;
for(auto e : q3){
if(abs(e.first)>maxx3) maxx3 = e.first;
if(abs(e.first)<minx3) minx3 = e.first;
if(abs(e.second)>maxy3) maxy3 = e.second;
if(abs(e.second)<miny3) miny3 = e.second;
}
area3 = (maxx3-minx3) * (maxy3-miny3);
//cout<<abs(area3)<<endl;
int area4;
int maxx4=q4[0].first,minx4=q4[0].first, maxy4=q4[0].second, miny4=q4[0].second;
for(auto e : q4){
if(e.first>maxx4) maxx4 = e.first;
if(e.first<minx4) minx4 = e.first;
if(e.second<miny4) miny4 = e.second;
if(e.second>maxy4) maxy4 = e.second;
}
//cout<<maxx4-minx4<<" "<<maxy4-miny4<<endl;
area4 = (maxx4-minx4) * (maxy4-miny4);
//cout<<abs(area4)<<endl;
if(q1.size()!= 0){
cout<<"Q1: ("<<minx1<<", "<<miny1<<") ("<<maxx1<<", "<<maxy1<<") "<<area1<<endl;
}
if(q2.size()!= 0){
cout<<"Q2: ("<<minx2<<", "<<miny2<<") ("<<maxx2<<", "<<maxy2<<") "<<abs(area2)<<endl;
}
if(q3.size()!= 0){
cout<<"Q3: ("<<minx3<<", "<<miny3<<") ("<<maxx3<<", "<<maxy3<<") "<<area3<<endl;
}
if(q4.size()!= 0){
cout<<"Q4: ("<<minx4<<", "<<miny4<<") ("<<maxx4<<", "<<maxy4<<") "<<area4<<endl;
}
}
} |
# 2069496, 2024-11-02 10:52:27, -----P---- (10%)
#include<bits/stdc++.h>
using namespace std ;
int main(){
int n ; cin>>n ;
int x,y ;
vector<pair<int,int>> Q1 ;
vector<pair<int,int>> Q2 ;
vector<pair<int,int>> Q3 ;
vector<pair<int,int>> Q4 ;
while(n--){
cin>>x>>y ;
if(x == 0 || y == 0) continue;
if(x>0 && y>0){
Q1.push_back(make_pair(x,y)) ;
}
else if(x<0 && y>0){
Q2.push_back(make_pair(x,y)) ;
}
else if(x<0 && y<0){
Q3.push_back(make_pair(x,y)) ;
}
else if(x>0 && y<0){
Q4.push_back(make_pair(x,y)) ;
}
}
if(Q1.empty() && Q2.empty() &&Q3.empty() && Q4.empty()){
cout<<"No point in any quadrant" ;
return 0 ;
}
} | # 2069723, 2024-11-02 11:18:23, -----P---- (10%)
#include<bits/stdc++.h>
using namespace std ;
pair<int,int> find_most(vector<pair<int,int>> &v , pair<int,int> point){
pair<int,int> res ;
int x = point.first , y = point.second ;
for(auto &p : v){
if(p.first>x && p.second>y){
x = p.first ;
y = p.second ;
}
else if(p.first == x && p.second>y){
y = p.second ;
}
else if(p.first > x && p.second==y){
x = p.first ;
}
}
res = make_pair(x,y) ;
return res ;
}
pair<int,int> find_min(vector<pair<int,int>> &v , pair<int,int> point){
pair<int,int> res ;
int x = point.first , y = point.second ;
for(auto &p : v){
if(p.first<x && p.second<y){
x = p.first ;
y = p.second ;
}
else if(p.first == x && p.second<y){
y = p.second ;
}
else if(p.first < x && p.second==y){
x = p.first ;
}
}
res = make_pair(x,y) ;
return res ;
}
int main(){
int n ; cin>>n ;
int x,y ;
vector<pair<int,int>> Q1 ;
vector<pair<int,int>> Q2 ;
vector<pair<int,int>> Q3 ;
vector<pair<int,int>> Q4 ;
pair<int,int> max1 , min1 , max2 ,min2 , max3 ,min3 ,max4,min4 ;
bool firsttime1 = true ;
bool firsttime2 = true ;
bool firsttime3 = true ;
bool firsttime4 = true ;
while(n--){
cin>>x>>y ;
if(x == 0 || y == 0) continue;
if(x>0 && y>0){
Q1.push_back(make_pair(x,y)) ;
if(firsttime1){
max1 = make_pair(x,y) ;
min1 = make_pair(x,y) ;
firsttime1 = false ;
}
max1 = find_most(Q1,max1) ;
min1 = find_min(Q1,min1) ;
}
else if(x<0 && y>0){
Q2.push_back(make_pair(x,y)) ;
if(firsttime2){
max2 = make_pair(x,y) ;
min2 = make_pair(x,y) ;
firsttime2 = false ;
}
max2 = find_most(Q1,max2) ;
min2 = find_min(Q1,min2) ;
}
else if(x<0 && y<0){
Q3.push_back(make_pair(x,y)) ;
if(firsttime3){
max3 = make_pair(x,y) ;
min3 = make_pair(x,y) ;
firsttime3 = false ;
}
max3 = find_most(Q1,max3) ;
min3 = find_min(Q1,min3) ;
}
else if(x>0 && y<0){
Q4.push_back(make_pair(x,y)) ;
if(firsttime4){
max4 = make_pair(x,y) ;
min4 = make_pair(x,y) ;
firsttime4 = false ;
}
max4 = find_most(Q1,max4) ;
min4 = find_min(Q1,min4) ;
}
}
if(Q1.empty() && Q2.empty() &&Q3.empty() && Q4.empty()){
cout<<"No point in any quadrant" ;
return 0 ;
}
int A1 = abs((max1.first - min1.first) * (max1.second - min1.second)) ;
int A2 = abs((max2.first - min2.first) * (max2.second - min2.second)) ;
int A3 = abs((max3.first - min3.first) * (max3.second - min3.second)) ;
int A4 = abs((max4.first - min4.first) * (max4.second - min4.second)) ;
cout<<"Q1: ("<<min1.first<<", "<<min1.second<<") ("<<max1.first<<", "<<max1.second<<") "<<A1;
cout<<"Q2: ("<<min2.first<<", "<<min2.second<<") ("<<max2.first<<", "<<max2.second<<") "<<A2;
cout<<"Q3: ("<<min3.first<<", "<<min3.second<<") ("<<max3.first<<", "<<max3.second<<") "<<A3;
cout<<"Q4: ("<<min4.first<<", "<<min4.second<<") ("<<max4.first<<", "<<max4.second<<") "<<A4;
return 0 ;
} | # 2069764, 2024-11-02 11:22:39, ----PP---- (20%)
#include<bits/stdc++.h>
using namespace std ;
pair<int,int> find_most(vector<pair<int,int>> &v , pair<int,int> point){
pair<int,int> res ;
int x = point.first , y = point.second ;
for(auto &p : v){
if(p.first>x && p.second>y){
x = p.first ;
y = p.second ;
}
else if(p.first == x && p.second>y){
y = p.second ;
}
else if(p.first > x && p.second==y){
x = p.first ;
}
}
res = make_pair(x,y) ;
return res ;
}
pair<int,int> find_min(vector<pair<int,int>> &v , pair<int,int> point){
pair<int,int> res ;
int x = point.first , y = point.second ;
for(auto &p : v){
if(p.first<x && p.second<y){
x = p.first ;
y = p.second ;
}
else if(p.first == x && p.second<y){
y = p.second ;
}
else if(p.first < x && p.second==y){
x = p.first ;
}
}
res = make_pair(x,y) ;
return res ;
}
int main(){
int n ; cin>>n ;
int x,y ;
vector<pair<int,int>> Q1 ;
vector<pair<int,int>> Q2 ;
vector<pair<int,int>> Q3 ;
vector<pair<int,int>> Q4 ;
pair<int,int> max1 , min1 , max2 ,min2 , max3 ,min3 ,max4,min4 ;
bool firsttime1 = true ;
bool firsttime2 = true ;
bool firsttime3 = true ;
bool firsttime4 = true ;
while(n--){
cin>>x>>y ;
if(x == 0 || y == 0) continue;
if(x>0 && y>0){
Q1.push_back(make_pair(x,y)) ;
if(firsttime1){
max1 = make_pair(x,y) ;
min1 = make_pair(x,y) ;
firsttime1 = false ;
}
max1 = find_most(Q1,max1) ;
min1 = find_min(Q1,min1) ;
}
if(x<0 && y>0){
Q2.push_back(make_pair(x,y)) ;
if(firsttime2){
max2 = make_pair(x,y) ;
min2 = make_pair(x,y) ;
firsttime2 = false ;
}
max2 = find_most(Q1,max2) ;
min2 = find_min(Q1,min2) ;
}
if(x<0 && y<0){
Q3.push_back(make_pair(x,y)) ;
if(firsttime3){
max3 = make_pair(x,y) ;
min3 = make_pair(x,y) ;
firsttime3 = false ;
}
max3 = find_most(Q1,max3) ;
min3 = find_min(Q1,min3) ;
}
if(x>0 && y<0){
Q4.push_back(make_pair(x,y)) ;
if(firsttime4){
max4 = make_pair(x,y) ;
min4 = make_pair(x,y) ;
firsttime4 = false ;
}
max4 = find_most(Q1,max4) ;
min4 = find_min(Q1,min4) ;
}
}
if(Q1.empty() && Q2.empty() &&Q3.empty() && Q4.empty()){
cout<<"No point in any quadrant" ;
return 0 ;
}
int A1 = abs((max1.first - min1.first) * (max1.second - min1.second)) ;
int A2 = abs((max2.first - min2.first) * (max2.second - min2.second)) ;
int A3 = abs((max3.first - min3.first) * (max3.second - min3.second)) ;
int A4 = abs((max4.first - min4.first) * (max4.second - min4.second)) ;
if(Q1.size() != 0){
cout<<"Q1: ("<<min1.first<<", "<<min1.second<<") ("<<max1.first<<", "<<max1.second<<") "<<A1<<endl;
}
if(Q2.size() != 0){
cout<<"Q2: ("<<min2.first<<", "<<min2.second<<") ("<<max2.first<<", "<<max2.second<<") "<<A2<<endl;
}
if(Q3.size() != 0){
cout<<"Q3: ("<<min3.first<<", "<<min3.second<<") ("<<max3.first<<", "<<max3.second<<") "<<A3<<endl;
}
if(Q4.size() != 0){
cout<<"Q4: ("<<min4.first<<", "<<min4.second<<") ("<<max4.first<<", "<<max4.second<<") "<<A4<<endl;
}
return 0 ;
} | # 2070074, 2024-11-02 11:49:20, ----PP---- (20%)
#include<bits/stdc++.h>
using namespace std ;
pair<int,int> find_most(vector<pair<int,int>> &v , pair<int,int> point){
pair<int,int> res = point ;
int x = point.first , y = point.second ;
for(auto &p : v){
if(p.first>x && p.second>y){
x = p.first ;
y = p.second ;
}
else if(p.first == x && p.second>y){
y = p.second ;
}
else if(p.first > x && p.second==y){
x = p.first ;
}
}
res = make_pair(x,y) ;
return res ;
}
pair<int,int> find_min(vector<pair<int,int>> &v , pair<int,int> point){
pair<int,int> res = point ;
int x = point.first , y = point.second ;
for(auto &p : v){
if(p.first<x && p.second<y){
x = p.first ;
y = p.second ;
}
else if(p.first == x && p.second<y){
y = p.second ;
}
else if(p.first < x && p.second==y){
x = p.first ;
}
}
res = make_pair(x,y) ;
return res ;
}
int main(){
int n ; cin>>n ;
int x,y ;
vector<pair<int,int>> Q1 ;
vector<pair<int,int>> Q2 ;
vector<pair<int,int>> Q3 ;
vector<pair<int,int>> Q4 ;
pair<int,int> max1 , min1 , max2 ,min2 , max3 ,min3 ,max4,min4 ;
bool firsttime1 = true ;
bool firsttime2 = true ;
bool firsttime3 = true ;
bool firsttime4 = true ;
while(n--){
cin>>x>>y ;
if(x == 0 || y == 0) continue;
if(x>0 && y>0){
Q1.push_back(make_pair(x,y)) ;
if(firsttime1){
max1 = make_pair(x,y) ;
min1 = make_pair(x,y) ;
firsttime1 = false ;
}
max1 = find_most(Q1,max1) ;
min1 = find_min(Q1,min1) ;
}
if(x<0 && y>0){
Q2.push_back(make_pair(x,y)) ;
if(firsttime2){
max2 = make_pair(x,y) ;
min2 = make_pair(x,y) ;
firsttime2 = false ;
}
max2 = find_most(Q1,max2) ;
min2 = find_min(Q1,min2) ;
}
if(x<0 && y<0){
Q3.push_back(make_pair(x,y)) ;
if(firsttime3){
max3 = make_pair(x,y) ;
min3 = make_pair(x,y) ;
firsttime3 = false ;
}
max3 = find_most(Q1,max3) ;
min3 = find_min(Q1,min3) ;
}
if(x>0 && y<0){
Q4.push_back(make_pair(x,y)) ;
if(firsttime4){
max4 = make_pair(x,y) ;
min4 = make_pair(x,y) ;
firsttime4 = false ;
}
max4 = find_most(Q1,max4) ;
min4 = find_min(Q1,min4) ;
}
}
if(Q1.empty() && Q2.empty() &&Q3.empty() && Q4.empty()){
cout<<"No point in any quadrant" ;
return 0 ;
}
int A1 = abs((max1.first - min1.first) * (max1.second - min1.second)) ;
int A2 = abs((max2.first - min2.first) * (max2.second - min2.second)) ;
int A3 = abs((max3.first - min3.first) * (max3.second - min3.second)) ;
int A4 = abs((max4.first - min4.first) * (max4.second - min4.second)) ;
if(Q1.size() != 0){
cout<<"Q1: ("<<min1.first<<", "<<min1.second<<") ("<<max1.first<<", "<<max1.second<<") "<<A1<<endl;
}
if(Q2.size() != 0){
cout<<"Q2: ("<<min2.first<<", "<<min2.second<<") ("<<max2.first<<", "<<max2.second<<") "<<A2<<endl;
}
if(Q3.size() != 0){
cout<<"Q3: ("<<min3.first<<", "<<min3.second<<") ("<<max3.first<<", "<<max3.second<<") "<<A3<<endl;
}
if(Q4.size() != 0){
cout<<"Q4: ("<<min4.first<<", "<<min4.second<<") ("<<max4.first<<", "<<max4.second<<") "<<A4<<endl;
}
return 0 ;
} | # 2070496, 2024-11-02 12:10:41, xxxx-P--x- (10%)
#include<bits/stdc++.h>
using namespace std ;
vector<tuple<double,int,int>> find_sed(vector<pair<int,int>> &a){
vector<tuple<double,int,int>> res ;
for(auto &e : a){
double c = 0 ;
c = sqrt(e.first*e.first + e.second*e.second) ;
res.push_back(make_tuple(c,e.first,e.second)) ;
}
return res ;
}
int main(){
int n ; cin>>n ;
int x,y ;
vector<pair<int,int>> q1 ;
vector<pair<int,int>> q2 ;
vector<pair<int,int>> q3 ;
vector<pair<int,int>> q4 ;
while(n--){
cin>>x>>y ;
if(x==0 || y==0) continue;
if(x>0 && y>0){
q1.push_back(make_pair(x,y)) ;
}
if(x<0 && y>0){
q2.push_back(make_pair(x,y)) ;
}
if(x<0 && y<0){
q3.push_back(make_pair(x,y)) ;
}
else{
q4.push_back(make_pair(x,y)) ;
}
}
if(q1.empty() && q2.empty() &&q3.empty() && q4.empty()){
cout<<"No point in any quadrant" ;
return 0 ;
}
vector<tuple<double,int,int>> nq1 = find_sed(q1) ;
vector<tuple<double,int,int>> nq2 = find_sed(q2) ;
vector<tuple<double,int,int>> nq3 = find_sed(q3) ;
vector<tuple<double,int,int>> nq4 = find_sed(q4) ;
sort(nq1.begin(),nq1.end()) ;
sort(nq2.begin(),nq2.end()) ;
sort(nq3.begin(),nq3.end()) ;
sort(nq4.begin(),nq4.end()) ;
tuple<double,int,int> min1 = nq1[0] ;
tuple<double,int,int> max1 = nq1[nq1.size()-1] ;
tuple<double,int,int> min2 = nq2[0] ;
tuple<double,int,int> max2 = nq2[nq2.size()-1] ;
tuple<double,int,int> min3 = nq3[0] ;
tuple<double,int,int> max3 = nq3[nq3.size()-1] ;
tuple<double,int,int> min4 = nq4[0] ;
tuple<double,int,int> max4 = nq4[nq4.size()-1] ;
int A1 = (get<1>(max1) - get<1>(min1)) * (get<2>(max1) - get<2>(min1)) ;
int A2 = (get<1>(max2) - get<1>(min2)) * (get<2>(max2) - get<2>(min2)) ;
int A3 = (get<1>(max3) - get<1>(min3)) * (get<2>(max3) - get<2>(min3)) ;
int A4 = (get<1>(max4) - get<1>(min4)) * (get<2>(max4) - get<2>(min4)) ;
if(q1.size() != 0){
cout<<"Q1: ("<<get<1>(min1)<<", "<<get<2>(min1)<<") ("<<get<1>(max1)<<", "<<get<2>(max1)<<") "<<A1<<endl;
}
if(q2.size() != 0){
cout<<"Q2: ("<<get<1>(min2)<<", "<<get<2>(min2)<<") ("<<get<1>(max2)<<", "<<get<2>(max2)<<") "<<A2<<endl;
}
if(q3.size() != 0){
cout<<"Q3: ("<<get<1>(min3)<<", "<<get<2>(min3)<<") ("<<get<1>(max3)<<", "<<get<2>(max3)<<") "<<A3<<endl;
}
if(q4.size() != 0){
cout<<"Q4: ("<<get<1>(min4)<<", "<<get<2>(min4)<<") ("<<get<1>(max4)<<", "<<get<2>(max4)<<") "<<A4<<endl;
}
return 0 ;
} |
# 2071383, 2024-11-02 14:29:46, ----PP---- (20%)
#include<iostream>
#include<map>
#include<vector>
using namespace std;
int main() {
map<string,vector<pair<int,int>>> total;
int x,y,n;
int xmin,ymin,xmax,ymax;
//set<pair<int,int>> point;
cin>>n;
while(n--){
cin>>x>>y;
if(x>0 &&y>0) {
total["Q1"]=vector<pair<int,int>>();
total["Q1"].push_back(make_pair(x,y));
}
if(x<0 &&y>0) {
total["Q2"]=vector<pair<int,int>>();
total["Q2"].push_back(make_pair(x,y));
}
if(x<0 &&y<0) {
total["Q3"]=vector<pair<int,int>>();
total["Q3"].push_back(make_pair(x,y));
}
if(x>0 &&y<0) {
total["Q4"]=vector<pair<int,int>>();
total["Q4"].push_back(make_pair(x,y));
}
}
vector<pair<int,int>> min,max;
vector<int> pt ;
for(auto c:total) {
xmin = (c.second)[0].first;
xmax=xmin;
ymin = (c.second)[0].second;
ymax=ymin;
for(auto s: c.second){
if(s.first>xmax) xmax==s.first;
if(s.first<xmin) xmin==s.first;
if(s.second>ymax) ymax==s.second;
if(s.second<ymin) ymin==s.second;
}
int tx=xmax-xmin;
int ty=ymax-ymin;
pt.push_back(tx*ty);
min.push_back(make_pair(xmin,ymin));
max.push_back(make_pair(xmax,ymax));
}
auto itr=total.begin();
for(int i=0; i<min.size() && itr!=total.end();i++){
cout<<(*itr).first<<": ("<<min[i].first<<", "<<min[i].second<<") ";
cout<<"("<<max[i].first<<", "<<max[i].second<<") ";
cout<<pt[i];
itr++;
cout<<endl;
}
if(total["Q1"].size()==0 && total["Q2"].size()==0 && total["Q3"].size()==0 && total["Q4"].size()==0){
cout<<"No point in any quadrant";
}
} | # 2071986, 2024-11-02 15:31:21, -x-x-x--x- (0%)
#include<iostream>
#include<map>
#include<vector>
using namespace std;
int main() {
vector<pair<int,int>> Q1,Q2,Q3,Q4;
int x,y,n;
//set<pair<int,int>> point;
cin>>n;
while(n--){
cin>>x>>y;
if(x>0 &&y>0) {
Q1.push_back(make_pair(x,y));
}
if(x<0 &&y>0) {
Q2.push_back(make_pair(x,y));
}
if(x<0 &&y<0) {
Q3.push_back(make_pair(x,y));
}
if(x>0 &&y<0) {
Q4.push_back(make_pair(x,y));
}
}
int xmin=Q1[0].first,ymin=Q1[0].second,xmax=xmin,ymax=ymin;
for(auto c:Q1){
if(c.first>xmax) xmax==c.first;
if(c.second>ymax) ymax==c.second;
if(c.first<xmin) xmin==c.first;
if(c.second<ymin) ymin==c.second;
}
vector<pair<int,int>> min,max;
int tx=xmax-xmin;
int ty=ymax-ymin;
vector<int> pt;
pt.push_back(tx*ty);
min.push_back(make_pair(xmin,ymin));
max.push_back(make_pair(xmax,ymax));
for(auto c:Q2){
if(c.first>xmax) xmax==c.first;
if(c.second>ymax) ymax==c.second;
if(c.first<xmin) xmin==c.first;
if(c.second<ymin) ymin==c.second;
}
tx=xmax-xmin;
ty=ymax-ymin;
pt.push_back(tx*ty);
min.push_back(make_pair(xmin,ymin));
max.push_back(make_pair(xmax,ymax));
for(auto c:Q3){
if(c.first>xmax) xmax==c.first;
if(c.second>ymax) ymax==c.second;
if(c.first<xmin) xmin==c.first;
if(c.second<ymin) ymin==c.second;
}
tx=xmax-xmin;
ty=ymax-ymin;
pt.push_back(tx*ty);
min.push_back(make_pair(xmin,ymin));
max.push_back(make_pair(xmax,ymax));
for(auto c:Q4){
if(c.first>xmax) xmax==c.first;
if(c.second>ymax) ymax==c.second;
if(c.first<xmin) xmin==c.first;
if(c.second<ymin) ymin==c.second;
}
tx=xmax-xmin;
ty=ymax-ymin;
pt.push_back(tx*ty);
min.push_back(make_pair(xmin,ymin));
max.push_back(make_pair(xmax,ymax));
if(Q1.size()==0 && Q2.size()==0 && Q3.size()==0 && Q4.size()==0){
cout<<"No point in any quadrant";
}
else {
cout<<"Q1: ("<<min[0].first<<", "<<min[0].second<<") ";
cout<<"("<<max[0].first<<", "<<max[0].second<<") ";
cout<<pt[0]<<endl;
cout<<"Q2: ("<<min[1].first<<", "<<min[1].second<<") ";
cout<<"("<<max[1].first<<", "<<max[1].second<<") ";
cout<<pt[0]<<endl;
cout<<"Q3: ("<<min[2].first<<", "<<min[2].second<<") ";
cout<<"("<<max[2].first<<", "<<max[2].second<<") ";
cout<<pt[0]<<endl;
cout<<"Q4: ("<<min[3].first<<", "<<min[3].second<<") ";
cout<<"("<<max[3].first<<", "<<max[3].second<<") ";
cout<<pt[0]<<endl;
}
} | # 2072001, 2024-11-02 15:31:47, ----PP---- (20%)
#include<iostream>
#include<map>
#include<vector>
using namespace std;
int main() {
map<string,vector<pair<int,int>>> total;
int x,y,n;
int xmin,ymin,xmax,ymax;
//set<pair<int,int>> point;
cin>>n;
while(n--){
cin>>x>>y;
if(x>0 &&y>0) {
total["Q1"]=vector<pair<int,int>>();
total["Q1"].push_back(make_pair(x,y));
}
if(x<0 &&y>0) {
total["Q2"]=vector<pair<int,int>>();
total["Q2"].push_back(make_pair(x,y));
}
if(x<0 &&y<0) {
total["Q3"]=vector<pair<int,int>>();
total["Q3"].push_back(make_pair(x,y));
}
if(x>0 &&y<0) {
total["Q4"]=vector<pair<int,int>>();
total["Q4"].push_back(make_pair(x,y));
}
}
vector<pair<int,int>> min,max;
vector<int> pt ;
for(auto c:total) {
xmin = (c.second)[0].first;
xmax=xmin;
ymin = (c.second)[0].second;
ymax=ymin;
for(auto s: c.second){
if(s.first>xmax) xmax==s.first;
if(s.first<xmin) xmin==s.first;
if(s.second>ymax) ymax==s.second;
if(s.second<ymin) ymin==s.second;
}
int tx=xmax-xmin;
int ty=ymax-ymin;
pt.push_back(tx*ty);
min.push_back(make_pair(xmin,ymin));
max.push_back(make_pair(xmax,ymax));
}
auto itr=total.begin();
for(int i=0; i<min.size() && itr!=total.end();i++){
cout<<(*itr).first<<": ("<<min[i].first<<", "<<min[i].second<<") ";
cout<<"("<<max[i].first<<", "<<max[i].second<<") ";
cout<<pt[i];
itr++;
cout<<endl;
}
if(total["Q1"].size()==0 && total["Q2"].size()==0 && total["Q3"].size()==0 && total["Q4"].size()==0){
cout<<"No point in any quadrant";
}
} |
# 2071250, 2024-11-02 14:13:06, -----P---- (10%)
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> x, y;
for (int i = 0; i < n; i++)
{
int xx, yy;
cin >> xx >> yy;
x.push_back(xx);
y.push_back(yy);
}
// cout << "Q1: " << endl;
cout << "No point in any quadrant" << endl;
} | # 2071847, 2024-11-02 15:22:14, ----PP---- (20%)
#include <bits/stdc++.h>
using namespace std;
void output(string q, int x1, int y1, int x2, int y2);
int main()
{
int n;
cin >> n;
vector<int> q1x, q1y;
vector<int> q2x, q2y;
vector<int> q3x, q3y;
vector<int> q4x, q4y;
for (int i = 0; i < n; i++)
{
int xx, yy;
cin >> xx >> yy;
if (xx > 0 && yy > 0)
{
q1x.push_back(xx);
q1y.push_back(yy);
}
else if (xx < 0 && yy > 0)
{
q2x.push_back(xx);
q2y.push_back(yy);
}
else if (xx < 0 && yy < 0)
{
q3x.push_back(xx);
q3y.push_back(yy);
}
else if (xx > 0 && yy < 0)
{
q4x.push_back(xx);
q4y.push_back(yy);
}
}
if (q1x.empty() && q2x.empty() && q3x.empty() && q4x.empty())
{
cout << "No point in any quadrant" << endl;
return 0;
}
if (!q1x.empty())
{
int x1 = INT16_MAX,
x2 = INT16_MIN,
y1 = INT16_MAX,
y2 = INT16_MIN;
for (size_t i = 0; i < q1x.size(); i++)
{
x1 = min(q1x[i], x1);
x2 = max(q1x[i], x2);
y1 = min(q1y[i], y1);
y2 = max(q1y[i], y2);
}
string q = "Q1: (";
output(q, x1, y1, x2, y2);
}
if (!q2x.empty())
{
int x1 = INT16_MAX,
x2 = INT16_MIN,
y1 = INT16_MAX,
y2 = INT16_MIN;
for (size_t i = 0; i < q2x.size(); i++)
{
x1 = min(q2x[i], x1);
x2 = max(q2x[i], x2);
y1 = min(q2y[i], y1);
y2 = max(q2y[i], y2);
}
string q = "Q2: (";
output(q, x1, y1, x2, y2);
}
if (!q3x.empty())
{
int x1 = INT16_MAX,
x2 = INT16_MIN,
y1 = INT16_MAX,
y2 = INT16_MIN;
for (size_t i = 0; i < q3x.size(); i++)
{
x1 = min(q3x[i], x1);
x2 = max(q3x[i], x2);
y1 = min(q3y[i], y1);
y2 = max(q3y[i], y2);
}
string q = "Q3: (";
output(q, x1, y1, x2, y2);
}
if (!q4x.empty())
{
int x1 = INT16_MAX,
x2 = INT16_MIN,
y1 = INT16_MAX,
y2 = INT16_MIN;
for (size_t i = 0; i < q4x.size(); i++)
{
x1 = min(q4x[i], x1);
x2 = max(q4x[i], x2);
y1 = min(q4y[i], y1);
y2 = max(q4y[i], y2);
}
string q = "Q4: (";
output(q, x1, y1, x2, y2);
}
}
void output(string q, int x1, int y1, int x2, int y2)
{
int p = 0;
cout << q << x1 << ", " << y1 << ") (" << x2 << ", " << y2 << ") " << p << endl;
} | # 2072018, 2024-11-02 15:32:40, ----PP---- (20%)
#include <bits/stdc++.h>
using namespace std;
void output(string q, int x1, int y1, int x2, int y2);
int main()
{
int n;
cin >> n;
vector<int> q1x, q1y;
vector<int> q2x, q2y;
vector<int> q3x, q3y;
vector<int> q4x, q4y;
for (int i = 0; i < n; i++)
{
int xx, yy;
cin >> xx >> yy;
if (xx > 0 && yy > 0)
{
q1x.push_back(xx);
q1y.push_back(yy);
}
else if (xx < 0 && yy > 0)
{
q2x.push_back(xx);
q2y.push_back(yy);
}
else if (xx < 0 && yy < 0)
{
q3x.push_back(xx);
q3y.push_back(yy);
}
else if (xx > 0 && yy < 0)
{
q4x.push_back(xx);
q4y.push_back(yy);
}
}
if (q1x.empty() && q2x.empty() && q3x.empty() && q4x.empty())
{
cout << "No point in any quadrant" << endl;
return 0;
}
if (!q1x.empty())
{
int x1 = INT16_MAX,
x2 = INT16_MIN,
y1 = INT16_MAX,
y2 = INT16_MIN;
for (size_t i = 0; i < q1x.size(); i++)
{
x1 = min(q1x[i], x1);
x2 = max(q1x[i], x2);
y1 = min(q1y[i], y1);
y2 = max(q1y[i], y2);
}
string q = "Q1: (";
output(q, x1, y1, x2, y2);
}
if (!q2x.empty())
{
int x1 = INT16_MAX,
x2 = INT16_MIN,
y1 = INT16_MAX,
y2 = INT16_MIN;
for (size_t i = 0; i < q2x.size(); i++)
{
x1 = min(q2x[i], x1);
x2 = max(q2x[i], x2);
y1 = min(q2y[i], y1);
y2 = max(q2y[i], y2);
}
string q = "Q2: (";
output(q, x1, y1, x2, y2);
}
if (!q3x.empty())
{
int x1 = INT16_MAX,
x2 = INT16_MIN,
y1 = INT16_MAX,
y2 = INT16_MIN;
for (size_t i = 0; i < q3x.size(); i++)
{
x1 = min(q3x[i], x1);
x2 = max(q3x[i], x2);
y1 = min(q3y[i], y1);
y2 = max(q3y[i], y2);
}
string q = "Q3: (";
output(q, x1, y1, x2, y2);
}
if (!q4x.empty())
{
int x1 = INT16_MAX,
x2 = INT16_MIN,
y1 = INT16_MAX,
y2 = INT16_MIN;
for (size_t i = 0; i < q4x.size(); i++)
{
x1 = min(q4x[i], x1);
x2 = max(q4x[i], x2);
y1 = min(q4y[i], y1);
y2 = max(q4y[i], y2);
}
string q = "Q4: (";
output(q, x1, y1, x2, y2);
}
}
void output(string q, int x1, int y1, int x2, int y2)
{
int p = y2-x1 * x1-y1;
if (x1 == x2)
p = 0;
cout << q << x1 << ", " << y1 << ") (" << x2 << ", " << y2 << ") " << p << endl;
} |
# 2069767, 2024-11-02 11:22:48, -----P---- (10%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<pair<int,int> >quad;
vector<pair<int,int> >quad1;
vector<pair<int,int> >quad2;
vector<pair<int,int> >quad3;
vector<pair<int,int> >quad4;
int x, y;
while(n--){
cin>>x>>y;
quad.push_back(make_pair(x,y));
}
for(auto p:quad){
if(p.first>0 && p.second>0){
quad1.push_back(p);
}
else if(p.first<0 && p.second>0){
quad2.push_back(p);
}
else if(p.first<0 && p.second<0){
quad3.push_back(p);
}
else if(p.first>0 && p.second>0){
quad4.push_back(p);
}
}
if(quad1.size()!=0){
cout<<"Q1: ";
for(auto e:quad1){
cout<<"("<<e.first<<", "<<e.second<<")"<<" ";
}
cout<<endl;
}
if(quad2.size()!=0){
cout<<"Q2: ";
for(auto e:quad2){
cout<<"("<<e.first<<", "<<e.second<<")"<<" "<<endl;
}
}
if(quad3.size()!=0){
cout<<"Q3: ";
for(auto e:quad3){
cout<<"("<<e.first<<", "<<e.second<<")"<<" "<<endl;
}
}
if(quad4.size()!=0){
cout<<"Q4: ";
for(auto e:quad4){
cout<<"("<<e.first<<", "<<e.second<<")"<<" "<<endl;
}
}
else if(quad1.size()==0 && quad2.size()==0 && quad3.size()==0 && quad4.size()==0){
cout<<"No point in any quadrant";
}
} | # 2070446, 2024-11-02 12:08:51, ----PP---- (20%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
int area;
int count=0;
int maxx_first=0;
cin>>n;
vector<pair<int,int> >quad;
vector<pair<int,int> >quad1;
vector<pair<int,int> >quad2;
vector<pair<int,int> >quad3;
vector<pair<int,int> >quad4;
int x, y;
while(n--){
cin>>x>>y;
quad.push_back(make_pair(x,y));
}
for(auto p:quad){
if(p.first>0 && p.second>0){
quad1.push_back(p);
sort(quad1.begin(),quad1.end());
}
else if(p.first<0 && p.second>0){
quad2.push_back(p);
}
else if(p.first<0 && p.second<0){
quad3.push_back(p);
}
else if(p.first>0 && p.second<0){
quad4.push_back(p);
}
}
//q1
if(quad1.size()!=0){
cout<<"Q1: ";
if(quad1.size()==1){
for(auto e:quad1){
cout<<"("<<e.first<<", "<<e.second<<")"<<" "<<"("<<e.first<<", "<<e.second<<")"<<" ";
}
}
cout<<area<<endl;
}
//q2
if(quad2.size()!=0){
cout<<"Q2: ";
if(quad2.size()==1){
for(auto e:quad2){
cout<<"("<<e.first<<", "<<e.second<<")"<<" "<<"("<<e.first<<", "<<e.second<<")"<<" ";
}
}
cout<<area<<endl;
}
if(quad3.size()!=0){
cout<<"Q3: ";
if(quad3.size()==1){
for(auto e:quad3){
cout<<"("<<e.first<<", "<<e.second<<")"<<" "<<"("<<e.first<<", "<<e.second<<")"<<" ";
}
}
cout<<area<<endl;
}
if(quad4.size()!=0){
cout<<"Q4: ";
if(quad4.size()==1){
for(auto e:quad4){
cout<<"("<<e.first<<", "<<e.second<<")"<<" "<<"("<<e.first<<", "<<e.second<<")"<<" ";
}
}
cout<<area<<endl;
}
else if(quad1.size()==0 && quad2.size()==0 && quad3.size()==0 && quad4.size()==0){
cout<<"No point in any quadrant";
}
} |
# 2070319, 2024-11-02 12:03:24, xxxx-xP-xP (20%)
#include <bits/stdc++.h>
using namespace std ;
int main () {
//input
int n,x,y = 0 ;
vector < pair <int,int> > point ;
cin >> n ;
for ( int i = 0 ; i < n ; i++ ) {
cin >> x >> y ;
point.push_back( make_pair (x,y) ) ;
}
// -- process --
vector<int>Q1x ;
vector<int>Q1y ;
vector<int>Q2x ;
vector<int>Q2y ;
vector<int>Q3x ;
vector<int>Q3y ;
vector<int>Q4x ;
vector<int>Q4y ;
// get in quadrant
for ( auto p : point ) {
if ( ( p.first > 0 ) && ( p.second > 0 )) {
Q1x.push_back(p.first) ;
Q1y.push_back(p.second) ;
} else if ( ( p.first < 0 ) && ( p.second > 0 ) ) {
Q2x.push_back(p.first) ;
Q2y.push_back(p.second) ;
} else if ( ( p.first < 0 ) && ( p.second < 0 ) ) {
Q3x.push_back(p.first) ;
Q3y.push_back(p.second) ;
} else if ( ( p.first > 0 ) && ( p.second < 0 ) ) {
Q4x.push_back(p.first) ;
Q4y.push_back(p.second) ;
}
}
// find L,R and space
// arrange
sort(Q1x.begin(),Q1x.end()) ;
sort(Q1y.begin(),Q1y.end()) ;
int E1 = Q1x.size() - 1 ;
sort(Q2x.begin(),Q2x.end()) ;
sort(Q2y.begin(),Q2y.end()) ;
int E2 = Q2x.size() - 1 ;
sort(Q3x.begin(),Q3x.end()) ;
sort(Q3y.begin(),Q3y.end()) ;
int E3 = Q3x.size() - 1 ;
sort(Q4x.begin(),Q4x.end()) ;
sort(Q4y.begin(),Q4y.end()) ;
int E4 = Q4x.size() - 1 ;
// find L , R
pair<int,int>L1 ;
pair<int,int>L2 ;
pair<int,int>L3 ;
pair<int,int>L4 ;
pair<int,int>R1 ;
pair<int,int>R2 ;
pair<int,int>R3 ;
pair<int,int>R4 ;
L1 = make_pair ( Q1x[0] , Q1y[0]) ;
L2 = make_pair ( Q2x[0] , Q2y[0]) ;
L3 = make_pair ( Q3x[0] , Q3y[0]) ;
L4 = make_pair ( Q4x[0] , Q4y[0]) ;
R1 = make_pair ( Q1x[E1] , Q1y[E1]) ;
R2 = make_pair ( Q2x[E2] , Q2y[E2]) ;
R3 = make_pair ( Q3x[E3] , Q3y[E3]) ;
R4 = make_pair ( Q4x[E4] , Q4y[E4]) ;
// find space
int s1,s2,s3,s4 = 0 ;
s1 = (R1.first - L1.first)*(R1.second - L1.second) ;
s2 = (R2.first - L2.first)*(R2.second - L2.second) ;
s3 = (R3.first - L3.first)*(R3.second - L3.second) ;
s4 = (R4.first - L4.first)*(R4.second - L4.second) ;
// output
if ( E1!=0 ) {
cout << "Q1: (" << L1.first << ", " << L1.second << ") (" << R1.first << ", " << R1.second << ") " << s1 << endl ;
}
if ( E2!=0 ) {
cout << "Q2: (" << L2.first << ", " << L2.second << ") (" << R2.first << ", " << R2.second << ") " << s2 << endl ;
}
if ( E3!=0 ) {
cout << "Q3: (" << L3.first << ", " << L3.second << ") (" << R3.first << ", " << R3.second << ") " << s3 << endl ;
}
if ( E4!=0 ) {
cout << "Q4: (" << L4.first << ", " << L4.second << ") (" << R4.first << ", " << R4.second << ") " << s4 << endl ;
}
if ((E1 == 0)&&(E2 == 0)&&(E3 == 0)&&(E4 == 0)) {
cout << "No point in any quadrant" << endl ;
}
} |
# 2069181, 2024-11-02 10:23:28, -----P---- (10%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
vector<pair<int,int>> q1;
vector<pair<int,int>> q2;
vector<pair<int,int>> q3;
vector<pair<int,int>> q4;
while (n--)
{
int a,b;
cin>>a>>b;
if(a!=0 && b!=0){
if(a>0 && b>0){
q1.push_back({a,b});
}else if(a>0 && b < 0){
q4.push_back({a,b});
}else if(a<0 && b<0){
q3.push_back({a,b});
}else{
q2.push_back({a,b});
}
}
}
if(q1.empty() && q2.empty() && q3.empty() && q4.empty()){
cout<<"No point in any quadrant";
return 0;
}
} | # 2069783, 2024-11-02 11:24:51, ---------- (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<pair<int,int>> q1;
vector<pair<int,int>> q2;
vector<pair<int,int>> q3;
vector<pair<int,int>> q4;
while (n--)
{
int a,b;
cin>>a>>b;
if(a!=0 && b!=0){
if(a>0 && b>0){
q1.push_back({a,b});
}else if(a>0 && b < 0){
q2.push_back({a,b});
}else if(a<0 && b<0){
q3.push_back({a,b});
}else{
q4.push_back({a,b});
}
}
}
int x1q1 = INT_MAX,x2q1 = INT_MIN , y1q1 = INT_MAX, y2q1 = INT_MIN;
for(auto e : q1){
x1q1 = min(x1q1,e.first);
x2q1 = max(x2q1,e.second);
y1q1 = min(y1q1,e.first);
y2q1 = max(y1q1,e.second);
}
int x1q2 = INT_MAX,x2q2 = INT_MIN , y1q2 = INT_MAX, y2q2 = INT_MIN;
for(auto e : q2){
x1q2 = min(x1q2,e.first);
x2q2 = max(x2q2,e.second);
y1q2 = min(y1q2,e.first);
y2q2 = max(y1q2,e.second);
}
int x1q3 = INT_MAX,x2q3 = INT_MIN , y1q3 = INT_MAX, y2q3 = INT_MIN;
for(auto e : q3){
x1q3 = min(x1q3,e.first);
x2q3 = max(x2q3,e.second);
y1q3 = min(y1q3,e.first);
y2q3 = max(y1q3,e.second);
}
int x1q4 = INT_MAX,x2q4 = INT_MIN , y1q4 = INT_MAX, y2q4 = INT_MIN;
for(auto e : q4){
x1q4 = min(x1q4,e.first);
x2q4 = max(x2q4,e.second);
y1q4 = min(y1q4,e.first);
y2q4 = max(y1q4,e.second);
}
int a1,a2,a3,a4;
a1 = abs(x1q1-x2q1)*abs(y1q1-y2q1);
a2 = abs(x1q2-x2q2)*abs(y1q2-y2q3);
a3 = abs(x1q3-x2q3)*abs(y1q3-y2q3);
a4 = abs(x1q4-x2q4)*abs(y1q4-y2q4);
if(a1!=0){
cout<<"Q1: ("<<x1q1<<", "<<y1q1<<") ("<<x2q1<<", "<<y2q1<<") "<<a1<<endl;
}
if(a2!=0){
cout<<"Q2: ("<<x1q2<<", "<<y1q2<<") ("<<x2q2<<", "<<y2q2<<") "<<a2<<endl;
}
if(a3!=0){
cout<<"Q3: ("<<x1q3<<", "<<y1q3<<") ("<<x2q3<<", "<<y2q3<<") "<<a3<<endl;
}
if(a4!=0){
cout<<"Q4: ("<<x1q4<<", "<<y1q4<<") ("<<x2q4<<", "<<y2q4<<") "<<a4<<endl;
}
if(q1.empty() && q2.empty() && q3.empty() && q4.empty()){
cout<<"No point in any quadrant";
return 0;
}
} | # 2069791, 2024-11-02 11:25:17, -----P---- (10%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<pair<int,int>> q1;
vector<pair<int,int>> q2;
vector<pair<int,int>> q3;
vector<pair<int,int>> q4;
while (n--)
{
int a,b;
cin>>a>>b;
if(a!=0 && b!=0){
if(a>0 && b>0){
q1.push_back({a,b});
}else if(a>0 && b < 0){
q2.push_back({a,b});
}else if(a<0 && b<0){
q3.push_back({a,b});
}else{
q4.push_back({a,b});
}
}
}
int x1q1 = INT_MAX,x2q1 = INT_MIN , y1q1 = INT_MAX, y2q1 = INT_MIN;
for(auto e : q1){
x1q1 = min(x1q1,e.first);
x2q1 = max(x2q1,e.second);
y1q1 = min(y1q1,e.first);
y2q1 = max(y1q1,e.second);
}
int x1q2 = INT_MAX,x2q2 = INT_MIN , y1q2 = INT_MAX, y2q2 = INT_MIN;
for(auto e : q2){
x1q2 = min(x1q2,e.first);
x2q2 = max(x2q2,e.second);
y1q2 = min(y1q2,e.first);
y2q2 = max(y1q2,e.second);
}
int x1q3 = INT_MAX,x2q3 = INT_MIN , y1q3 = INT_MAX, y2q3 = INT_MIN;
for(auto e : q3){
x1q3 = min(x1q3,e.first);
x2q3 = max(x2q3,e.second);
y1q3 = min(y1q3,e.first);
y2q3 = max(y1q3,e.second);
}
int x1q4 = INT_MAX,x2q4 = INT_MIN , y1q4 = INT_MAX, y2q4 = INT_MIN;
for(auto e : q4){
x1q4 = min(x1q4,e.first);
x2q4 = max(x2q4,e.second);
y1q4 = min(y1q4,e.first);
y2q4 = max(y1q4,e.second);
}
int a1,a2,a3,a4;
a1 = abs(x1q1-x2q1)*abs(y1q1-y2q1);
a2 = abs(x1q2-x2q2)*abs(y1q2-y2q3);
a3 = abs(x1q3-x2q3)*abs(y1q3-y2q3);
a4 = abs(x1q4-x2q4)*abs(y1q4-y2q4);
if(q1.empty() && q2.empty() && q3.empty() && q4.empty()){
cout<<"No point in any quadrant";
return 0;
}
if(a1!=0){
cout<<"Q1: ("<<x1q1<<", "<<y1q1<<") ("<<x2q1<<", "<<y2q1<<") "<<a1<<endl;
}
if(a2!=0){
cout<<"Q2: ("<<x1q2<<", "<<y1q2<<") ("<<x2q2<<", "<<y2q2<<") "<<a2<<endl;
}
if(a3!=0){
cout<<"Q3: ("<<x1q3<<", "<<y1q3<<") ("<<x2q3<<", "<<y2q3<<") "<<a3<<endl;
}
if(a4!=0){
cout<<"Q4: ("<<x1q4<<", "<<y1q4<<") ("<<x2q4<<", "<<y2q4<<") "<<a4<<endl;
}
} | # 2069891, 2024-11-02 11:33:52, xx-x-x--x- (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<pair<int,int>> q1;
vector<pair<int,int>> q2;
vector<pair<int,int>> q3;
vector<pair<int,int>> q4;
while (n--)
{
int a,b;
cin>>a>>b;
if(a!=0 && b!=0){
if(a>0 && b>0){
q1.push_back({a,b});
}else if(a>0 && b < 0){
q2.push_back({a,b});
}else if(a<0 && b<0){
q3.push_back({a,b});
}else{
q4.push_back({a,b});
}
}
}
sort(q1.begin(),q1.end());
int w1 = abs(q1[0].first-q1.back().first);
int h1 = abs(q1[0].second-q1.back().second);
int w2 = abs(q2[0].first-q2.back().first);
int h2 = abs(q2[0].second-q2.back().second);
int w3 = abs(q3[0].first-q3.back().first);
int h3 = abs(q3[0].second-q3.back().second);
int w4 = abs(q4[0].first-q4.back().first);
int h4 = abs(q4[0].second-q4.back().second);
int a1,a2,a3,a4;
a1 = w1*h1;
a2 = w2*h2;
a2 = w3*h3;
a2 = w4*h4;
if(q1.empty() && q2.empty() && q3.empty() && q4.empty()){
cout<<"No point in any quadrant";
return 0;
}
if(a1!=0){
cout<<"Q1: ("<<q1[0].first<<", "<<q1[0].second<<") ("<<q1.back().first<<", "<<q1.back().second<<") "<<a1<<endl;
}
if(a2!=0){
cout<<"Q2: ("<<q2[0].first<<", "<<q2[0].second<<") ("<<q2.back().first<<", "<<q2.back().second<<") "<<a2<<endl;
}
if(a3!=0){
cout<<"Q3: ("<<q3[0].first<<", "<<q3[0].second<<") ("<<q3.back().first<<", "<<q3.back().second<<") "<<a3<<endl;
}
if(a4!=0){
cout<<"Q4: ("<<q4[0].first<<", "<<q4[0].second<<") ("<<q4.back().first<<", "<<q4.back().second<<") "<<a4<<endl;
}
} | # 2069902, 2024-11-02 11:34:58, xxxx-x--x- (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<pair<int,int>> q1;
vector<pair<int,int>> q2;
vector<pair<int,int>> q3;
vector<pair<int,int>> q4;
while (n--)
{
int a,b;
cin>>a>>b;
if(a!=0 && b!=0){
if(a>0 && b>0){
q1.push_back({a,b});
}else if(a>0 && b < 0){
q2.push_back({a,b});
}else if(a<0 && b<0){
q3.push_back({a,b});
}else{
q4.push_back({a,b});
}
}
}
sort(q1.begin(),q1.end());
sort(q2.begin(),q2.end());
sort(q3.begin(),q3.end());
sort(q4.begin(),q4.end());
int w1 = abs(q1[0].first-q1.back().first);
int h1 = abs(q1[0].second-q1.back().second);
int w2 = abs(q2[0].first-q2.back().first);
int h2 = abs(q2[0].second-q2.back().second);
int w3 = abs(q3[0].first-q3.back().first);
int h3 = abs(q3[0].second-q3.back().second);
int w4 = abs(q4[0].first-q4.back().first);
int h4 = abs(q4[0].second-q4.back().second);
int a1,a2,a3,a4;
a1 = w1*h1;
a2 = w2*h2;
a2 = w3*h3;
a2 = w4*h4;
if(q1.empty() && q2.empty() && q3.empty() && q4.empty()){
cout<<"No point in any quadrant";
return 0;
}
if(a1!=0){
cout<<"Q1: ("<<q1[0].first<<", "<<q1[0].second<<") ("<<q1.back().first<<", "<<q1.back().second<<") "<<a1<<endl;
}
if(a2!=0){
cout<<"Q2: ("<<q2[0].first<<", "<<q2[0].second<<") ("<<q2.back().first<<", "<<q2.back().second<<") "<<a2<<endl;
}
if(a3!=0){
cout<<"Q3: ("<<q3[0].first<<", "<<q3[0].second<<") ("<<q3.back().first<<", "<<q3.back().second<<") "<<a3<<endl;
}
if(a4!=0){
cout<<"Q4: ("<<q4[0].first<<", "<<q4[0].second<<") ("<<q4.back().first<<", "<<q4.back().second<<") "<<a4<<endl;
}
} | # 2069915, 2024-11-02 11:36:32, xxxx-x--x- (0%)
#include <bits/stdc++.h>
using namespace std;
vector<pair<int,int>> q1;
vector<pair<int,int>> q2;
vector<pair<int,int>> q3;
vector<pair<int,int>> q4;
int main(){
int n;
cin>>n;
while (n--)
{
int a,b;
cin>>a>>b;
if(a!=0 && b!=0){
if(a>0 && b>0){
q1.push_back({a,b});
}else if(a>0 && b < 0){
q2.push_back({a,b});
}else if(a<0 && b<0){
q3.push_back({a,b});
}else{
q4.push_back({a,b});
}
}
}
sort(q1.begin(),q1.end());
sort(q2.begin(),q2.end());
sort(q3.begin(),q3.end());
sort(q4.begin(),q4.end());
int w1 = abs(q1[0].first-q1.back().first);
int h1 = abs(q1[0].second-q1.back().second);
int w2 = abs(q2[0].first-q2.back().first);
int h2 = abs(q2[0].second-q2.back().second);
int w3 = abs(q3[0].first-q3.back().first);
int h3 = abs(q3[0].second-q3.back().second);
int w4 = abs(q4[0].first-q4.back().first);
int h4 = abs(q4[0].second-q4.back().second);
int a1,a2,a3,a4;
a1 = w1*h1;
a2 = w2*h2;
a2 = w3*h3;
a2 = w4*h4;
if(q1.empty() && q2.empty() && q3.empty() && q4.empty()){
cout<<"No point in any quadrant";
return 0;
}
if(a1!=0){
cout<<"Q1: ("<<q1[0].first<<", "<<q1[0].second<<") ("<<q1.back().first<<", "<<q1.back().second<<") "<<a1<<endl;
}
if(a2!=0){
cout<<"Q2: ("<<q2[0].first<<", "<<q2[0].second<<") ("<<q2.back().first<<", "<<q2.back().second<<") "<<a2<<endl;
}
if(a3!=0){
cout<<"Q3: ("<<q3[0].first<<", "<<q3[0].second<<") ("<<q3.back().first<<", "<<q3.back().second<<") "<<a3<<endl;
}
if(a4!=0){
cout<<"Q4: ("<<q4[0].first<<", "<<q4[0].second<<") ("<<q4.back().first<<", "<<q4.back().second<<") "<<a4<<endl;
}
} | # 2069988, 2024-11-02 11:42:57, xxxx-x--x- (0%)
#include <bits/stdc++.h>
using namespace std;
vector<pair<int,int>> q1;
vector<pair<int,int>> q2;
vector<pair<int,int>> q3;
vector<pair<int,int>> q4;
int main(){
int n;
cin>>n;
while (n--)
{
int a,b;
cin>>a>>b;
if(a!=0 && b!=0){
if(a>0 && b>0){
q1.push_back({a,b});
}else if(a>0 && b < 0){
q2.push_back({a,b});
}else if(a<0 && b<0){
q3.push_back({a,b});
}else{
q4.push_back({a,b});
}
}
}
sort(q1.begin(),q1.end());
sort(q2.begin(),q2.end());
sort(q3.begin(),q3.end());
sort(q4.begin(),q4.end());
int w1 = abs(q1[0].first-q1.back().first);
int h1 = abs(q1[0].second-q1.back().second);
int w2 = abs(q2[0].first-q2.back().first);
int h2 = abs(q2[0].second-q2.back().second);
int w3 = abs(q3[0].first-q3.back().first);
int h3 = abs(q3[0].second-q3.back().second);
int w4 = abs(q4[0].first-q4.back().first);
int h4 = abs(q4[0].second-q4.back().second);
int a1,a2,a3,a4;
a1 = w1*h1;
a2 = w2*h2;
a2 = w3*h3;
a2 = w4*h4;
if(q1.empty() && q2.empty() && q3.empty() && q4.empty()){
cout<<"No point in any quadrant";
return 0;
}
if(a1!=0){
cout<<"Q1: ("<<q1[0].first<<", "<<q1[0].second<<") ("<<q1.back().first<<", "<<q1.back().second<<") "<<a1<<endl;
}
if(a2!=0){
cout<<"Q2: ("<<q2[0].first<<", "<<q2[0].second<<") ("<<q2.back().first<<", "<<q2.back().second<<") "<<a2<<endl;
}
if(a3!=0){
cout<<"Q3: ("<<q3[0].first<<", "<<q3[0].second<<") ("<<q3.back().first<<", "<<q3.back().second<<") "<<a3<<endl;
}
if(a4!=0){
cout<<"Q4: ("<<q4[0].first<<", "<<q4[0].second<<") ("<<q4.back().first<<", "<<q4.back().second<<") "<<a4<<endl;
}
} | # 2070058, 2024-11-02 11:48:11, xxxx-x--x- (0%)
#include <bits/stdc++.h>
using namespace std;
vector<pair<int,int>> q1;
vector<pair<int,int>> q2;
vector<pair<int,int>> q3;
vector<pair<int,int>> q4;
int main(){
int n;
cin>>n;
while (n--)
{
int a,b;
cin>>a>>b;
if(a!=0 && b!=0){
if(a>0 && b>0){
q1.push_back({a,b});
}else if(a>0 && b < 0){
q2.push_back({a,b});
}else if(a<0 && b<0){
q3.push_back({a,b});
}else{
q4.push_back({a,b});
}
}
}
sort(q1.begin(),q1.end());
sort(q2.begin(),q2.end());
sort(q3.begin(),q3.end());
sort(q4.begin(),q4.end());
int w1 = abs(q1[0].first - q1[q1.size()-1].first);
int h1 = abs(q1[0].second-q1[q1.size()-1].second);
int w2 = abs(q2[0].first-q2[q2.size()-1].first);
int h2 = abs(q2[0].second-q2[q2.size()-1].second);
int w3 = abs(q3[0].first-q3[q3.size()-1].first);
int h3 = abs(q3[0].second-q3[q3.size()-1].second);
int w4 = abs(q4[0].first-q4[q4.size()-1].first);
int h4 = abs(q4[0].second-q4[q4.size()-1].second);
int a1,a2,a3,a4;
a1 = w1*h1;
a2 = w2*h2;
a2 = w3*h3;
a2 = w4*h4;
if(q1.empty() && q2.empty() && q3.empty() && q4.empty()){
cout<<"No point in any quadrant";
return 0;
}
if(a1!=0){
cout<<"Q1: ("<<q1[0].first<<", "<<q1[0].second<<") ("<<q1.back().first<<", "<<q1.back().second<<") "<<a1<<endl;
}
if(a2!=0){
cout<<"Q2: ("<<q2[0].first<<", "<<q2[0].second<<") ("<<q2.back().first<<", "<<q2.back().second<<") "<<a2<<endl;
}
if(a3!=0){
cout<<"Q3: ("<<q3[0].first<<", "<<q3[0].second<<") ("<<q3.back().first<<", "<<q3.back().second<<") "<<a3<<endl;
}
if(a4!=0){
cout<<"Q4: ("<<q4[0].first<<", "<<q4[0].second<<") ("<<q4.back().first<<", "<<q4.back().second<<") "<<a4<<endl;
}
} | # 2070122, 2024-11-02 11:52:19, Compilation error (0%)
#include <bits/stdc++.h>
using namespace std;
vector<pair<int,int>> q1;
vector<pair<int,int>> q2;
vector<pair<int,int>> q3;
vector<pair<int,int>> q4;
int main(){
int n;
cin>>n;
while (n--)
{
int a,b;
cin>>a>>b;
if(a!=0 && b!=0){
if(a>0 && b>0){
q1.push_back({a,b});
}else if(a>0 && b < 0){
q2.push_back({a,b});
}else if(a<0 && b<0){
q3.push_back({a,b});
}else{
q4.push_back({a,b});
}
}
}
/*sort(q1.begin(),q1.end());
sort(q2.begin(),q2.end());
sort(q3.begin(),q3.end());
sort(q4.begin(),q4.end());
int w1 = abs(q1[0].first - q1[q1.size()-1].first);
int h1 = abs(q1[0].second-q1[q1.size()-1].second);
int w2 = abs(q2[0].first-q2[q2.size()-1].first);
int h2 = abs(q2[0].second-q2[q2.size()-1].second);
int w3 = abs(q3[0].first-q3[q3.size()-1].first);
int h3 = abs(q3[0].second-q3[q3.size()-1].second);
int w4 = abs(q4[0].first-q4[q4.size()-1].first);
int h4 = abs(q4[0].second-q4[q4.size()-1].second);
int a1,a2,a3,a4;
a1 = w1*h1;
a2 = w2*h2;
a2 = w3*h3;
a2 = w4*h4;
*/
if(q1.empty() && q2.empty() && q3.empty() && q4.empty()){
cout<<"No point in any quadrant";
return 0;
}
if(a1!=0){
cout<<"Q1: ("<<q1[0].first<<", "<<q1[0].second<<") ("<<q1.back().first<<", "<<q1.back().second<<") "<<a1<<endl;
}
if(a2!=0){
cout<<"Q2: ("<<q2[0].first<<", "<<q2[0].second<<") ("<<q2.back().first<<", "<<q2.back().second<<") "<<a2<<endl;
}
if(a3!=0){
cout<<"Q3: ("<<q3[0].first<<", "<<q3[0].second<<") ("<<q3.back().first<<", "<<q3.back().second<<") "<<a3<<endl;
}
if(a4!=0){
cout<<"Q4: ("<<q4[0].first<<", "<<q4[0].second<<") ("<<q4.back().first<<", "<<q4.back().second<<") "<<a4<<endl;
}
} | # 2070132, 2024-11-02 11:53:00, xx-x-x--x- (0%)
#include <bits/stdc++.h>
using namespace std;
vector<pair<int,int>> q1;
vector<pair<int,int>> q2;
vector<pair<int,int>> q3;
vector<pair<int,int>> q4;
int main(){
int n;
cin>>n;
while (n--)
{
int a,b;
cin>>a>>b;
if(a!=0 && b!=0){
if(a>0 && b>0){
q1.push_back({a,b});
}else if(a>0 && b < 0){
q2.push_back({a,b});
}else if(a<0 && b<0){
q3.push_back({a,b});
}else{
q4.push_back({a,b});
}
}
}
/*sort(q1.begin(),q1.end());
sort(q2.begin(),q2.end());
sort(q3.begin(),q3.end());
sort(q4.begin(),q4.end());*/
int w1 = abs(q1[0].first - q1[q1.size()-1].first);
int h1 = abs(q1[0].second-q1[q1.size()-1].second);
int w2 = abs(q2[0].first-q2[q2.size()-1].first);
int h2 = abs(q2[0].second-q2[q2.size()-1].second);
int w3 = abs(q3[0].first-q3[q3.size()-1].first);
int h3 = abs(q3[0].second-q3[q3.size()-1].second);
int w4 = abs(q4[0].first-q4[q4.size()-1].first);
int h4 = abs(q4[0].second-q4[q4.size()-1].second);
int a1,a2,a3,a4;
a1 = w1*h1;
a2 = w2*h2;
a2 = w3*h3;
a2 = w4*h4;
if(q1.empty() && q2.empty() && q3.empty() && q4.empty()){
cout<<"No point in any quadrant";
return 0;
}
if(a1!=0){
cout<<"Q1: ("<<q1[0].first<<", "<<q1[0].second<<") ("<<q1.back().first<<", "<<q1.back().second<<") "<<a1<<endl;
}
if(a2!=0){
cout<<"Q2: ("<<q2[0].first<<", "<<q2[0].second<<") ("<<q2.back().first<<", "<<q2.back().second<<") "<<a2<<endl;
}
if(a3!=0){
cout<<"Q3: ("<<q3[0].first<<", "<<q3[0].second<<") ("<<q3.back().first<<", "<<q3.back().second<<") "<<a3<<endl;
}
if(a4!=0){
cout<<"Q4: ("<<q4[0].first<<", "<<q4[0].second<<") ("<<q4.back().first<<", "<<q4.back().second<<") "<<a4<<endl;
}
} | # 2070300, 2024-11-02 12:02:29, xxxx-P--x- (10%)
#include <bits/stdc++.h>
using namespace std;
vector<pair<int,int>> q1;
vector<pair<int,int>> q2;
vector<pair<int,int>> q3;
vector<pair<int,int>> q4;
int main(){
int n;
cin>>n;
while (n--)
{
int a,b;
cin>>a>>b;
if(a!=0 && b!=0){
if(a>0 && b>0){
q1.push_back({a,b});
}else if(a>0 && b < 0){
q2.push_back({a,b});
}else if(a<0 && b<0){
q3.push_back({a,b});
}else{
q4.push_back({a,b});
}
}
}
if(q1.empty() && q2.empty() && q3.empty() && q4.empty()){
cout<<"No point in any quadrant";
return 0;
}
sort(q1.begin(),q1.end());
sort(q2.begin(),q2.end());
sort(q3.begin(),q3.end());
sort(q4.begin(),q4.end());
int w1 = abs(q1[0].first - q1[q1.size()-1].first);
int h1 = abs(q1[0].second-q1[q1.size()-1].second);
int w2 = abs(q2[0].first-q2[q2.size()-1].first);
int h2 = abs(q2[0].second-q2[q2.size()-1].second);
int w3 = abs(q3[0].first-q3[q3.size()-1].first);
int h3 = abs(q3[0].second-q3[q3.size()-1].second);
int w4 = abs(q4[0].first-q4[q4.size()-1].first);
int h4 = abs(q4[0].second-q4[q4.size()-1].second);
int a1,a2,a3,a4;
a1 = w1*h1;
a2 = w2*h2;
a2 = w3*h3;
a2 = w4*h4;
if(a1!=0){
cout<<"Q1: ("<<q1[0].first<<", "<<q1[0].second<<") ("<<q1.back().first<<", "<<q1.back().second<<") "<<a1<<endl;
}
if(a2!=0){
cout<<"Q2: ("<<q2[0].first<<", "<<q2[0].second<<") ("<<q2.back().first<<", "<<q2.back().second<<") "<<a2<<endl;
}
if(a3!=0){
cout<<"Q3: ("<<q3[0].first<<", "<<q3[0].second<<") ("<<q3.back().first<<", "<<q3.back().second<<") "<<a3<<endl;
}
if(a4!=0){
cout<<"Q4: ("<<q4[0].first<<", "<<q4[0].second<<") ("<<q4.back().first<<", "<<q4.back().second<<") "<<a4<<endl;
}
} | # 2070374, 2024-11-02 12:05:52, xxxx-P--x- (10%)
#include <bits/stdc++.h>
using namespace std;
vector<pair<int,int>> q1;
vector<pair<int,int>> q2;
vector<pair<int,int>> q3;
vector<pair<int,int>> q4;
int main(){
int n;
cin>>n;
while (n--)
{
int a,b;
cin>>a>>b;
if(a!=0 && b!=0){
if(a>0 && b>0){
q1.push_back({a,b});
}else if(a>0 && b < 0){
q2.push_back({a,b});
}else if(a<0 && b<0){
q3.push_back({a,b});
}else{
q4.push_back({a,b});
}
}
}
if(q1.empty() && q2.empty() && q3.empty() && q4.empty()){
cout<<"No point in any quadrant";
return 0;
}
sort(q1.begin(),q1.end());
sort(q2.begin(),q2.end());
sort(q3.begin(),q3.end());
sort(q4.begin(),q4.end());
int w1 = abs(q1[0].first) - abs(q1[q1.size()-1].first);
int h1 = abs(q1[0].second) -abs(q1[q1.size()-1].second);
int w2 = abs(q2[0].first) - abs(q2[q2.size()-1].first);
int h2 = abs(q2[0].second)- abs(q2[q2.size()-1].second);
int w3 = abs(q3[0].first)-abs(q3[q3.size()-1].first);
int h3 = abs(q3[0].second)-abs(q3[q3.size()-1].second);
int w4 = abs(q4[0].first)-abs(q4[q4.size()-1].first);
int h4 = abs(q4[0].second)-abs(q4[q4.size()-1].second);
int a1,a2,a3,a4;
a1 = w1*h1;
a2 = w2*h2;
a2 = w3*h3;
a2 = w4*h4;
if(a1!=0){
cout<<"Q1: ("<<q1[0].first<<", "<<q1[0].second<<") ("<<q1.back().first<<", "<<q1.back().second<<") "<<a1<<endl;
}
if(a2!=0){
cout<<"Q2: ("<<q2[0].first<<", "<<q2[0].second<<") ("<<q2.back().first<<", "<<q2.back().second<<") "<<a2<<endl;
}
if(a3!=0){
cout<<"Q3: ("<<q3[0].first<<", "<<q3[0].second<<") ("<<q3.back().first<<", "<<q3.back().second<<") "<<a3<<endl;
}
if(a4!=0){
cout<<"Q4: ("<<q4[0].first<<", "<<q4[0].second<<") ("<<q4.back().first<<", "<<q4.back().second<<") "<<a4<<endl;
}
} | # 2070491, 2024-11-02 12:10:30, -----P---- (10%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<pair<int,int>> q1;
vector<pair<int,int>> q2;
vector<pair<int,int>> q3;
vector<pair<int,int>> q4;
while (n--)
{
int a,b;
cin>>a>>b;
if(a!=0 && b!=0){
if(a>0 && b>0){
q1.push_back({a,b});
}else if(a>0 && b < 0){
q2.push_back({a,b});
}else if(a<0 && b<0){
q3.push_back({a,b});
}else{
q4.push_back({a,b});
}
}
}
int x1q1 = INT_MAX,x2q1 = INT_MIN , y1q1 = INT_MAX, y2q1 = INT_MIN;
for(auto e : q1){
x1q1 = min(x1q1,e.first);
x2q1 = max(x2q1,e.second);
y1q1 = min(y1q1,e.first);
y2q1 = max(y1q1,e.second);
}
int x1q2 = INT_MAX,x2q2 = INT_MIN , y1q2 = INT_MAX, y2q2 = INT_MIN;
for(auto e : q2){
x1q2 = min(x1q2,e.first);
x2q2 = max(x2q2,e.second);
y1q2 = min(y1q2,e.first);
y2q2 = max(y1q2,e.second);
}
int x1q3 = INT_MAX,x2q3 = INT_MIN , y1q3 = INT_MAX, y2q3 = INT_MIN;
for(auto e : q3){
x1q3 = min(x1q3,e.first);
x2q3 = max(x2q3,e.second);
y1q3 = min(y1q3,e.first);
y2q3 = max(y1q3,e.second);
}
int x1q4 = INT_MAX,x2q4 = INT_MIN , y1q4 = INT_MAX, y2q4 = INT_MIN;
for(auto e : q4){
x1q4 = min(x1q4,e.first);
x2q4 = max(x2q4,e.second);
y1q4 = min(y1q4,e.first);
y2q4 = max(y1q4,e.second);
}
int a1,a2,a3,a4;
a1 = abs(x1q1-x2q1)*abs(y1q1-y2q1);
a2 = abs(x1q2-x2q2)*abs(y1q2-y2q3);
a3 = abs(x1q3-x2q3)*abs(y1q3-y2q3);
a4 = abs(x1q4-x2q4)*abs(y1q4-y2q4);
if(q1.empty() && q2.empty() && q3.empty() && q4.empty()){
cout<<"No point in any quadrant";
return 0;
}
if(a1!=0){
cout<<"Q1: ("<<x1q1<<", "<<y1q1<<") ("<<x2q1<<", "<<y2q1<<") "<<a1<<endl;
}
if(a2!=0){
cout<<"Q2: ("<<x1q2<<", "<<y1q2<<") ("<<x2q2<<", "<<y2q2<<") "<<a2<<endl;
}
if(a3!=0){
cout<<"Q3: ("<<x1q3<<", "<<y1q3<<") ("<<x2q3<<", "<<y2q3<<") "<<a3<<endl;
}
if(a4!=0){
cout<<"Q4: ("<<x1q4<<", "<<y1q4<<") ("<<x2q4<<", "<<y2q4<<") "<<a4<<endl;
}
} |
# 2069056, 2024-11-02 10:07:46, -----P---- (10%)
#include<iostream>
#include<vector>
using namespace std;
int main()
{
int n;
vector<int> qx1 , qy1 , qx2 , qy2 , qx3 , qy3 , qx4 , qy4;
cin >> n;
int x[n] , y[n];
for(int i = 0 ; i < n ; i++)
{
cin >> x[i] >> y[i];
if(x[i] > 0 && y[i] > 0)
{
qx1.push_back(x[i]);
qy1.push_back(y[i]);
}
else if(x[i] > 0 && y[i] < 0)
{
qx4.push_back(x[i]);
qy4.push_back(y[i]);
}
else if(x[i] < 0 && y[i] < 0)
{
qx3.push_back(x[i]);
qy3.push_back(y[i]);
}
else if(x[i] < 0 && y[i] > 0)
{
qx2.push_back(x[i]);
qy2.push_back(y[i]);
}
}
if(qx1.empty() && qx2.empty() && qx3.empty() && qx4.empty())
{
cout << "No point in any quadrant";
}
return 0;
} | # 2069301, 2024-11-02 10:35:04, xxxx-x--x- (0%)
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
int n;
vector<int> qx1 , qy1 , qx2 , qy2 , qx3 , qy3 , qx4 , qy4;
cin >> n;
int x[n] , y[n];
for(int i = 0 ; i < n ; i++)
{
cin >> x[i] >> y[i];
if(x[i] > 0 && y[i] > 0)
{
qx1.push_back(x[i]);
qy1.push_back(y[i]);
}
else if(x[i] > 0 && y[i] < 0)
{
qx4.push_back(x[i]);
qy4.push_back(y[i]);
}
else if(x[i] < 0 && y[i] < 0)
{
qx3.push_back(x[i]);
qy3.push_back(y[i]);
}
else if(x[i] < 0 && y[i] > 0)
{
qx2.push_back(x[i]);
qy2.push_back(y[i]);
}
}
int maxq1[2] , maxq2[2] , maxq3[2] , maxq4[2] , minq1[2] , minq2[2] , minq3[2] , minq4[2];
maxq1[0] = *max_element(qx1.begin() , qx1.end());
maxq1[1] = *max_element(qy1.begin() , qy1.end());
maxq2[0] = *max_element(qx2.begin() , qx2.end());
maxq2[1] = *max_element(qy2.begin() , qy2.end());
maxq3[0] = *max_element(qx3.begin() , qx3.end());
maxq3[1] = *max_element(qy3.begin() , qy3.end());
maxq4[0] = *max_element(qx4.begin() , qx4.end());
maxq4[1] = *max_element(qy4.begin() , qy4.end());
minq1[0] = *min_element(qx1.begin() , qx1.end());
minq1[1] = *min_element(qy1.begin() , qy1.end());
minq2[0] = *min_element(qx2.begin() , qx2.end());
minq2[1] = *min_element(qy2.begin() , qy2.end());
minq3[0] = *min_element(qx3.begin() , qx3.end());
minq3[1] = *min_element(qy3.begin() , qy3.end());
minq4[0] = *min_element(qx4.begin() , qx4.end());
minq4[1] = *min_element(qy4.begin() , qy4.end());
if(qx1.empty() && qx2.empty() && qx3.empty() && qx4.empty())
{
cout << "No point in any quadrant";
}
if(qx1.begin() != qx1.end())
{
cout << "Q1: (" << minq1[0] << ", " << minq1[1] << ") (" << maxq1[0] << ", " << maxq1[1] << ") " << (maxq1[0] - minq1[0]) * (maxq1[1] - minq1[1]);
}
if(qx2.begin() != qx2.end())
{
cout << "Q2: (" << minq2[0] << ", " << minq2[1] << ") (" << maxq2[0] << ", " << maxq2[1] << ") " << (maxq2[0] - minq2[0]) * (maxq2[1] - minq2[1]);
}
if(qx3.begin() != qx3.end())
{
cout << "Q3: (" << minq3[0] << ", " << minq3[1] << ") (" << maxq3[0] << ", " << maxq3[1] << ") " << (maxq3[0] - minq3[0]) * (maxq3[1] - minq3[1]);
}
if(qx4.begin() != qx4.end())
{
cout << "Q4: (" << minq4[0] << ", " << minq4[1] << ") (" << maxq4[0] << ", " << maxq4[1] << ") " << (maxq4[0] - minq4[0]) * (maxq4[1] - minq4[1]);
}
return 0;
} | # 2069943, 2024-11-02 11:38:48, -----P---- (10%)
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
int n;
vector<int> qx1 , qy1 , qx2 , qy2 , qx3 , qy3 , qx4 , qy4;
cin >> n;
int x[n] , y[n];
for(int i = 0 ; i < n ; i++)
{
cin >> x[i] >> y[i];
if(x[i] > 0 && y[i] > 0)
{
qx1.push_back(x[i]);
qy1.push_back(y[i]);
}
else if(x[i] > 0 && y[i] < 0)
{
qx4.push_back(x[i]);
qy4.push_back(y[i]);
}
else if(x[i] < 0 && y[i] < 0)
{
qx3.push_back(x[i]);
qy3.push_back(y[i]);
}
else if(x[i] < 0 && y[i] > 0)
{
qx2.push_back(x[i]);
qy2.push_back(y[i]);
}
}
int maxqx1 = 0 , minqx1 = qx1[0] , maxqx2 = qx2[0] , minqx2 = 0 , maxqx3 = qx3[0] , minqx3 = 0 , maxqx4 = 0 , minqx4 = qx4[0];
int maxqy1 = 0 , minqy1 = qy1[0] , maxqy2 = qy2[0] , minqy2 = 0 , maxqy3 = qy3[0] , minqy3 = 0 , maxqy4 = 0 , minqy4 = qy4[0];
for(long unsigned int i = 0 ; i < sizeof(qx1) ; i++)
{
if(maxqx1 < qx1[i] && minqx1 > maxqx1)
{
minqx1 = maxqx1;
maxqx1 = qx1[i];
}
else if(maxqx1 < qx1[i] && minqx1 < maxqx1)
{
maxqx1 = qx1[i];
}
else if(minqx1 < qx1[i])
{
minqx1 = qx1[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qx2) ; i++)
{
if(maxqx2 < qx2[i] && minqx2 > maxqx2)
{
minqx2 = maxqx2;
maxqx2 = qx2[i];
}
else if(maxqx2 < qx2[i] && minqx2 < maxqx2)
{
maxqx2 = qx2[i];
}
else if(minqx2 < qx2[i])
{
minqx2 = qx2[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qx3) ; i++)
{
if(maxqx3 < qx3[i] && minqx3 > maxqx3)
{
minqx3 = maxqx3;
maxqx3 = qx3[i];
}
else if(maxqx3 < qx3[i] && minqx3 < maxqx3)
{
maxqx3 = qx3[i];
}
else if(minqx3 < qx3[i])
{
minqx3 = qx3[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qx4) ; i++)
{
if(maxqx4 < qx4[i] && minqx4 > maxqx4)
{
minqx4 = maxqx4;
maxqx4 = qx4[i];
}
else if(maxqx4 < qx4[i] && minqx4 < maxqx4)
{
maxqx4 = qx4[i];
}
else if(minqx4 < qx4[i])
{
minqx4 = qx4[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qy1) ; i++)
{
if(maxqy1 < qy1[i] && minqy1 > maxqy1)
{
minqy1 = maxqy1;
maxqy1 = qy1[i];
}
else if(maxqy1 < qy1[i] && minqy1 < maxqy1)
{
maxqy1 = qy1[i];
}
else if(minqy1 < qy1[i])
{
minqy1 = qy1[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qy2) ; i++)
{
if(maxqy2 < qy2[i] && minqy2 > maxqy2)
{
minqy2 = maxqy2;
maxqy2 = qy2[i];
}
else if(maxqy2 < qy2[i] && minqy2 < maxqy2)
{
maxqy2 = qy2[i];
}
else if(minqy2 < qy2[i])
{
minqy2 = qy2[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qy3) ; i++)
{
if(maxqy3 < qy3[i] && minqy3 > maxqy3)
{
minqy3 = maxqy3;
maxqy3 = qy3[i];
}
else if(maxqy3 < qy3[i] && minqy3 < maxqy3)
{
maxqy3 = qy3[i];
}
else if(minqy3 < qy3[i])
{
minqy3 = qy3[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qy4) ; i++)
{
if(maxqy4 < qy4[i] && minqy4 > maxqy4)
{
minqy4 = maxqy4;
maxqy4 = qy4[i];
}
else if(maxqy4 < qy4[i] && minqy4 < maxqy4)
{
maxqy4 = qy4[i];
}
else if(minqy4 < qy4[i])
{
minqy4 = qy4[i];
}
}
if(qx1.empty() && qx2.empty() && qx3.empty() && qx4.empty())
{
cout << "No point in any quadrant";
}
return 0;
} | # 2069963, 2024-11-02 11:40:45, -x-x-x--x- (0%)
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
int n;
vector<int> qx1 , qy1 , qx2 , qy2 , qx3 , qy3 , qx4 , qy4;
cin >> n;
int x[n] , y[n];
for(int i = 0 ; i < n ; i++)
{
cin >> x[i] >> y[i];
if(x[i] > 0 && y[i] > 0)
{
qx1.push_back(x[i]);
qy1.push_back(y[i]);
}
else if(x[i] > 0 && y[i] < 0)
{
qx4.push_back(x[i]);
qy4.push_back(y[i]);
}
else if(x[i] < 0 && y[i] < 0)
{
qx3.push_back(x[i]);
qy3.push_back(y[i]);
}
else if(x[i] < 0 && y[i] > 0)
{
qx2.push_back(x[i]);
qy2.push_back(y[i]);
}
}
int maxqx1 = 0 , minqx1 = qx1[0] , maxqx2 = qx2[0] , minqx2 = 0 , maxqx3 = qx3[0] , minqx3 = 0 , maxqx4 = 0 , minqx4 = qx4[0];
int maxqy1 = 0 , minqy1 = qy1[0] , maxqy2 = qy2[0] , minqy2 = 0 , maxqy3 = qy3[0] , minqy3 = 0 , maxqy4 = 0 , minqy4 = qy4[0];
for(long unsigned int i = 0 ; i < sizeof(qx1) ; i++)
{
if(maxqx1 < qx1[i] && minqx1 > maxqx1)
{
minqx1 = maxqx1;
maxqx1 = qx1[i];
}
else if(maxqx1 < qx1[i] && minqx1 < maxqx1)
{
maxqx1 = qx1[i];
}
else if(minqx1 < qx1[i])
{
minqx1 = qx1[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qx2) ; i++)
{
if(maxqx2 < qx2[i] && minqx2 > maxqx2)
{
minqx2 = maxqx2;
maxqx2 = qx2[i];
}
else if(maxqx2 < qx2[i] && minqx2 < maxqx2)
{
maxqx2 = qx2[i];
}
else if(minqx2 < qx2[i])
{
minqx2 = qx2[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qx3) ; i++)
{
if(maxqx3 < qx3[i] && minqx3 > maxqx3)
{
minqx3 = maxqx3;
maxqx3 = qx3[i];
}
else if(maxqx3 < qx3[i] && minqx3 < maxqx3)
{
maxqx3 = qx3[i];
}
else if(minqx3 < qx3[i])
{
minqx3 = qx3[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qx4) ; i++)
{
if(maxqx4 < qx4[i] && minqx4 > maxqx4)
{
minqx4 = maxqx4;
maxqx4 = qx4[i];
}
else if(maxqx4 < qx4[i] && minqx4 < maxqx4)
{
maxqx4 = qx4[i];
}
else if(minqx4 < qx4[i])
{
minqx4 = qx4[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qy1) ; i++)
{
if(maxqy1 < qy1[i] && minqy1 > maxqy1)
{
minqy1 = maxqy1;
maxqy1 = qy1[i];
}
else if(maxqy1 < qy1[i] && minqy1 < maxqy1)
{
maxqy1 = qy1[i];
}
else if(minqy1 < qy1[i])
{
minqy1 = qy1[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qy2) ; i++)
{
if(maxqy2 < qy2[i] && minqy2 > maxqy2)
{
minqy2 = maxqy2;
maxqy2 = qy2[i];
}
else if(maxqy2 < qy2[i] && minqy2 < maxqy2)
{
maxqy2 = qy2[i];
}
else if(minqy2 < qy2[i])
{
minqy2 = qy2[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qy3) ; i++)
{
if(maxqy3 < qy3[i] && minqy3 > maxqy3)
{
minqy3 = maxqy3;
maxqy3 = qy3[i];
}
else if(maxqy3 < qy3[i] && minqy3 < maxqy3)
{
maxqy3 = qy3[i];
}
else if(minqy3 < qy3[i])
{
minqy3 = qy3[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qy4) ; i++)
{
if(maxqy4 < qy4[i] && minqy4 > maxqy4)
{
minqy4 = maxqy4;
maxqy4 = qy4[i];
}
else if(maxqy4 < qy4[i] && minqy4 < maxqy4)
{
maxqy4 = qy4[i];
}
else if(minqy4 < qy4[i])
{
minqy4 = qy4[i];
}
}
if(qx1.empty() && qx2.empty() && qx3.empty() && qx4.empty())
{
cout << "No point in any quadrant";
}
if(qx1.begin() != qx1.end())
{
cout << "Q1: (" << minqx1 << ", " << minqy1 << ") (" << maxqx1 << ", " << maxqy1 << ") " << (maxqx1 - minqx1) * (maxqy1 - minqy1);
}
return 0;
} | # 2069971, 2024-11-02 11:41:40, -x-x-x--x- (0%)
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
int n;
vector<int> qx1 , qy1 , qx2 , qy2 , qx3 , qy3 , qx4 , qy4;
cin >> n;
int x[n] , y[n];
for(int i = 0 ; i < n ; i++)
{
cin >> x[i] >> y[i];
if(x[i] > 0 && y[i] > 0)
{
qx1.push_back(x[i]);
qy1.push_back(y[i]);
}
else if(x[i] > 0 && y[i] < 0)
{
qx4.push_back(x[i]);
qy4.push_back(y[i]);
}
else if(x[i] < 0 && y[i] < 0)
{
qx3.push_back(x[i]);
qy3.push_back(y[i]);
}
else if(x[i] < 0 && y[i] > 0)
{
qx2.push_back(x[i]);
qy2.push_back(y[i]);
}
}
int maxqx1 = 0 , minqx1 = qx1[0] , maxqx2 = qx2[0] , minqx2 = 0 , maxqx3 = qx3[0] , minqx3 = 0 , maxqx4 = 0 , minqx4 = qx4[0];
int maxqy1 = 0 , minqy1 = qy1[0] , maxqy2 = qy2[0] , minqy2 = 0 , maxqy3 = qy3[0] , minqy3 = 0 , maxqy4 = 0 , minqy4 = qy4[0];
for(long unsigned int i = 0 ; i < sizeof(qx1) ; i++)
{
if(maxqx1 < qx1[i] && minqx1 > maxqx1)
{
minqx1 = maxqx1;
maxqx1 = qx1[i];
}
else if(maxqx1 < qx1[i] && minqx1 < maxqx1)
{
maxqx1 = qx1[i];
}
else if(minqx1 < qx1[i])
{
minqx1 = qx1[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qx2) ; i++)
{
if(maxqx2 < qx2[i] && minqx2 > maxqx2)
{
minqx2 = maxqx2;
maxqx2 = qx2[i];
}
else if(maxqx2 < qx2[i] && minqx2 < maxqx2)
{
maxqx2 = qx2[i];
}
else if(minqx2 < qx2[i])
{
minqx2 = qx2[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qx3) ; i++)
{
if(maxqx3 < qx3[i] && minqx3 > maxqx3)
{
minqx3 = maxqx3;
maxqx3 = qx3[i];
}
else if(maxqx3 < qx3[i] && minqx3 < maxqx3)
{
maxqx3 = qx3[i];
}
else if(minqx3 < qx3[i])
{
minqx3 = qx3[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qx4) ; i++)
{
if(maxqx4 < qx4[i] && minqx4 > maxqx4)
{
minqx4 = maxqx4;
maxqx4 = qx4[i];
}
else if(maxqx4 < qx4[i] && minqx4 < maxqx4)
{
maxqx4 = qx4[i];
}
else if(minqx4 < qx4[i])
{
minqx4 = qx4[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qy1) ; i++)
{
if(maxqy1 < qy1[i] && minqy1 > maxqy1)
{
minqy1 = maxqy1;
maxqy1 = qy1[i];
}
else if(maxqy1 < qy1[i] && minqy1 < maxqy1)
{
maxqy1 = qy1[i];
}
else if(minqy1 < qy1[i])
{
minqy1 = qy1[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qy2) ; i++)
{
if(maxqy2 < qy2[i] && minqy2 > maxqy2)
{
minqy2 = maxqy2;
maxqy2 = qy2[i];
}
else if(maxqy2 < qy2[i] && minqy2 < maxqy2)
{
maxqy2 = qy2[i];
}
else if(minqy2 < qy2[i])
{
minqy2 = qy2[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qy3) ; i++)
{
if(maxqy3 < qy3[i] && minqy3 > maxqy3)
{
minqy3 = maxqy3;
maxqy3 = qy3[i];
}
else if(maxqy3 < qy3[i] && minqy3 < maxqy3)
{
maxqy3 = qy3[i];
}
else if(minqy3 < qy3[i])
{
minqy3 = qy3[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qy4) ; i++)
{
if(maxqy4 < qy4[i] && minqy4 > maxqy4)
{
minqy4 = maxqy4;
maxqy4 = qy4[i];
}
else if(maxqy4 < qy4[i] && minqy4 < maxqy4)
{
maxqy4 = qy4[i];
}
else if(minqy4 < qy4[i])
{
minqy4 = qy4[i];
}
}
if(qx1.empty() && qx2.empty() && qx3.empty() && qx4.empty())
{
cout << "No point in any quadrant";
}
if(qx1.empty() == 0)
{
cout << "Q1: (" << minqx1 << ", " << minqy1 << ") (" << maxqx1 << ", " << maxqy1 << ") " << (maxqx1 - minqx1) * (maxqy1 - minqy1);
}
return 0;
} | # 2069987, 2024-11-02 11:42:57, -x-x-x--x- (0%)
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
int n;
vector<int> qx1 , qy1 , qx2 , qy2 , qx3 , qy3 , qx4 , qy4;
cin >> n;
int x[n] , y[n];
for(int i = 0 ; i < n ; i++)
{
cin >> x[i] >> y[i];
if(x[i] > 0 && y[i] > 0)
{
qx1.push_back(x[i]);
qy1.push_back(y[i]);
}
else if(x[i] > 0 && y[i] < 0)
{
qx4.push_back(x[i]);
qy4.push_back(y[i]);
}
else if(x[i] < 0 && y[i] < 0)
{
qx3.push_back(x[i]);
qy3.push_back(y[i]);
}
else if(x[i] < 0 && y[i] > 0)
{
qx2.push_back(x[i]);
qy2.push_back(y[i]);
}
}
int maxqx1 = 0 , minqx1 = qx1[0] , maxqx2 = qx2[0] , minqx2 = 0 , maxqx3 = qx3[0] , minqx3 = 0 , maxqx4 = 0 , minqx4 = qx4[0];
int maxqy1 = 0 , minqy1 = qy1[0] , maxqy2 = qy2[0] , minqy2 = 0 , maxqy3 = qy3[0] , minqy3 = 0 , maxqy4 = 0 , minqy4 = qy4[0];
for(long unsigned int i = 0 ; i < sizeof(qx1) ; i++)
{
if(maxqx1 < qx1[i] && minqx1 > maxqx1)
{
minqx1 = maxqx1;
maxqx1 = qx1[i];
}
else if(maxqx1 < qx1[i] && minqx1 < maxqx1)
{
maxqx1 = qx1[i];
}
else if(minqx1 < qx1[i])
{
minqx1 = qx1[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qx2) ; i++)
{
if(maxqx2 < qx2[i] && minqx2 > maxqx2)
{
minqx2 = maxqx2;
maxqx2 = qx2[i];
}
else if(maxqx2 < qx2[i] && minqx2 < maxqx2)
{
maxqx2 = qx2[i];
}
else if(minqx2 < qx2[i])
{
minqx2 = qx2[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qx3) ; i++)
{
if(maxqx3 < qx3[i] && minqx3 > maxqx3)
{
minqx3 = maxqx3;
maxqx3 = qx3[i];
}
else if(maxqx3 < qx3[i] && minqx3 < maxqx3)
{
maxqx3 = qx3[i];
}
else if(minqx3 < qx3[i])
{
minqx3 = qx3[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qx4) ; i++)
{
if(maxqx4 < qx4[i] && minqx4 > maxqx4)
{
minqx4 = maxqx4;
maxqx4 = qx4[i];
}
else if(maxqx4 < qx4[i] && minqx4 < maxqx4)
{
maxqx4 = qx4[i];
}
else if(minqx4 < qx4[i])
{
minqx4 = qx4[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qy1) ; i++)
{
if(maxqy1 < qy1[i] && minqy1 > maxqy1)
{
minqy1 = maxqy1;
maxqy1 = qy1[i];
}
else if(maxqy1 < qy1[i] && minqy1 < maxqy1)
{
maxqy1 = qy1[i];
}
else if(minqy1 < qy1[i])
{
minqy1 = qy1[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qy2) ; i++)
{
if(maxqy2 < qy2[i] && minqy2 > maxqy2)
{
minqy2 = maxqy2;
maxqy2 = qy2[i];
}
else if(maxqy2 < qy2[i] && minqy2 < maxqy2)
{
maxqy2 = qy2[i];
}
else if(minqy2 < qy2[i])
{
minqy2 = qy2[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qy3) ; i++)
{
if(maxqy3 < qy3[i] && minqy3 > maxqy3)
{
minqy3 = maxqy3;
maxqy3 = qy3[i];
}
else if(maxqy3 < qy3[i] && minqy3 < maxqy3)
{
maxqy3 = qy3[i];
}
else if(minqy3 < qy3[i])
{
minqy3 = qy3[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qy4) ; i++)
{
if(maxqy4 < qy4[i] && minqy4 > maxqy4)
{
minqy4 = maxqy4;
maxqy4 = qy4[i];
}
else if(maxqy4 < qy4[i] && minqy4 < maxqy4)
{
maxqy4 = qy4[i];
}
else if(minqy4 < qy4[i])
{
minqy4 = qy4[i];
}
}
if(qx1.empty() && qx2.empty() && qx3.empty() && qx4.empty())
{
cout << "No point in any quadrant";
}
if(maxqx1 != 0)
{
cout << "Q1: (" << minqx1 << ", " << minqy1 << ") (" << maxqx1 << ", " << maxqy1 << ") " << (maxqx1 - minqx1) * (maxqy1 - minqy1);
}
return 0;
} | # 2069993, 2024-11-02 11:43:37, -x-x-x--x- (0%)
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
int n;
vector<int> qx1 , qy1 , qx2 , qy2 , qx3 , qy3 , qx4 , qy4;
cin >> n;
int x[n] , y[n];
for(int i = 0 ; i < n ; i++)
{
cin >> x[i] >> y[i];
if(x[i] > 0 && y[i] > 0)
{
qx1.push_back(x[i]);
qy1.push_back(y[i]);
}
else if(x[i] > 0 && y[i] < 0)
{
qx4.push_back(x[i]);
qy4.push_back(y[i]);
}
else if(x[i] < 0 && y[i] < 0)
{
qx3.push_back(x[i]);
qy3.push_back(y[i]);
}
else if(x[i] < 0 && y[i] > 0)
{
qx2.push_back(x[i]);
qy2.push_back(y[i]);
}
}
int maxqx1 = 0 , minqx1 = qx1[0] , maxqx2 = qx2[0] , minqx2 = 0 , maxqx3 = qx3[0] , minqx3 = 0 , maxqx4 = 0 , minqx4 = qx4[0];
int maxqy1 = 0 , minqy1 = qy1[0] , maxqy2 = qy2[0] , minqy2 = 0 , maxqy3 = qy3[0] , minqy3 = 0 , maxqy4 = 0 , minqy4 = qy4[0];
for(long unsigned int i = 0 ; i < sizeof(qx1) ; i++)
{
if(maxqx1 < qx1[i] && minqx1 > maxqx1)
{
minqx1 = maxqx1;
maxqx1 = qx1[i];
}
else if(maxqx1 < qx1[i] && minqx1 < maxqx1)
{
maxqx1 = qx1[i];
}
else if(minqx1 < qx1[i])
{
minqx1 = qx1[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qx2) ; i++)
{
if(maxqx2 < qx2[i] && minqx2 > maxqx2)
{
minqx2 = maxqx2;
maxqx2 = qx2[i];
}
else if(maxqx2 < qx2[i] && minqx2 < maxqx2)
{
maxqx2 = qx2[i];
}
else if(minqx2 < qx2[i])
{
minqx2 = qx2[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qx3) ; i++)
{
if(maxqx3 < qx3[i] && minqx3 > maxqx3)
{
minqx3 = maxqx3;
maxqx3 = qx3[i];
}
else if(maxqx3 < qx3[i] && minqx3 < maxqx3)
{
maxqx3 = qx3[i];
}
else if(minqx3 < qx3[i])
{
minqx3 = qx3[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qx4) ; i++)
{
if(maxqx4 < qx4[i] && minqx4 > maxqx4)
{
minqx4 = maxqx4;
maxqx4 = qx4[i];
}
else if(maxqx4 < qx4[i] && minqx4 < maxqx4)
{
maxqx4 = qx4[i];
}
else if(minqx4 < qx4[i])
{
minqx4 = qx4[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qy1) ; i++)
{
if(maxqy1 < qy1[i] && minqy1 > maxqy1)
{
minqy1 = maxqy1;
maxqy1 = qy1[i];
}
else if(maxqy1 < qy1[i] && minqy1 < maxqy1)
{
maxqy1 = qy1[i];
}
else if(minqy1 < qy1[i])
{
minqy1 = qy1[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qy2) ; i++)
{
if(maxqy2 < qy2[i] && minqy2 > maxqy2)
{
minqy2 = maxqy2;
maxqy2 = qy2[i];
}
else if(maxqy2 < qy2[i] && minqy2 < maxqy2)
{
maxqy2 = qy2[i];
}
else if(minqy2 < qy2[i])
{
minqy2 = qy2[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qy3) ; i++)
{
if(maxqy3 < qy3[i] && minqy3 > maxqy3)
{
minqy3 = maxqy3;
maxqy3 = qy3[i];
}
else if(maxqy3 < qy3[i] && minqy3 < maxqy3)
{
maxqy3 = qy3[i];
}
else if(minqy3 < qy3[i])
{
minqy3 = qy3[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qy4) ; i++)
{
if(maxqy4 < qy4[i] && minqy4 > maxqy4)
{
minqy4 = maxqy4;
maxqy4 = qy4[i];
}
else if(maxqy4 < qy4[i] && minqy4 < maxqy4)
{
maxqy4 = qy4[i];
}
else if(minqy4 < qy4[i])
{
minqy4 = qy4[i];
}
}
if(qx1.empty() && qx2.empty() && qx3.empty() && qx4.empty())
{
cout << "No point in any quadrant";
}
if(maxqx1 != 0)
{
cout << "Q1: (" << minqx1 << "," << minqy1 << ") (" << maxqx1 << "," << maxqy1 << ") " << (maxqx1 - minqx1) * (maxqy1 - minqy1);
}
return 0;
} | # 2070031, 2024-11-02 11:45:51, xxxx-x--x- (0%)
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
int n;
vector<int> qx1 , qy1 , qx2 , qy2 , qx3 , qy3 , qx4 , qy4;
cin >> n;
int x[n] , y[n];
for(int i = 0 ; i < n ; i++)
{
cin >> x[i] >> y[i];
if(x[i] > 0 && y[i] > 0)
{
qx1.push_back(x[i]);
qy1.push_back(y[i]);
}
else if(x[i] > 0 && y[i] < 0)
{
qx4.push_back(x[i]);
qy4.push_back(y[i]);
}
else if(x[i] < 0 && y[i] < 0)
{
qx3.push_back(x[i]);
qy3.push_back(y[i]);
}
else if(x[i] < 0 && y[i] > 0)
{
qx2.push_back(x[i]);
qy2.push_back(y[i]);
}
}
int maxqx1 = 0 , minqx1 = qx1[0] , maxqx2 = qx2[0] , minqx2 = 0 , maxqx3 = qx3[0] , minqx3 = 0 , maxqx4 = 0 , minqx4 = qx4[0];
int maxqy1 = 0 , minqy1 = qy1[0] , maxqy2 = qy2[0] , minqy2 = 0 , maxqy3 = qy3[0] , minqy3 = 0 , maxqy4 = 0 , minqy4 = qy4[0];
for(long unsigned int i = 0 ; i < sizeof(qx1) ; i++)
{
if(maxqx1 < qx1[i] && minqx1 > maxqx1)
{
minqx1 = maxqx1;
maxqx1 = qx1[i];
}
else if(maxqx1 < qx1[i] && minqx1 < maxqx1)
{
maxqx1 = qx1[i];
}
else if(minqx1 < qx1[i])
{
minqx1 = qx1[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qx2) ; i++)
{
if(maxqx2 < qx2[i] && minqx2 > maxqx2)
{
minqx2 = maxqx2;
maxqx2 = qx2[i];
}
else if(maxqx2 < qx2[i] && minqx2 < maxqx2)
{
maxqx2 = qx2[i];
}
else if(minqx2 < qx2[i])
{
minqx2 = qx2[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qx3) ; i++)
{
if(maxqx3 < qx3[i] && minqx3 > maxqx3)
{
minqx3 = maxqx3;
maxqx3 = qx3[i];
}
else if(maxqx3 < qx3[i] && minqx3 < maxqx3)
{
maxqx3 = qx3[i];
}
else if(minqx3 < qx3[i])
{
minqx3 = qx3[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qx4) ; i++)
{
if(maxqx4 < qx4[i] && minqx4 > maxqx4)
{
minqx4 = maxqx4;
maxqx4 = qx4[i];
}
else if(maxqx4 < qx4[i] && minqx4 < maxqx4)
{
maxqx4 = qx4[i];
}
else if(minqx4 < qx4[i])
{
minqx4 = qx4[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qy1) ; i++)
{
if(maxqy1 < qy1[i] && minqy1 > maxqy1)
{
minqy1 = maxqy1;
maxqy1 = qy1[i];
}
else if(maxqy1 < qy1[i] && minqy1 < maxqy1)
{
maxqy1 = qy1[i];
}
else if(minqy1 < qy1[i])
{
minqy1 = qy1[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qy2) ; i++)
{
if(maxqy2 < qy2[i] && minqy2 > maxqy2)
{
minqy2 = maxqy2;
maxqy2 = qy2[i];
}
else if(maxqy2 < qy2[i] && minqy2 < maxqy2)
{
maxqy2 = qy2[i];
}
else if(minqy2 < qy2[i])
{
minqy2 = qy2[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qy3) ; i++)
{
if(maxqy3 < qy3[i] && minqy3 > maxqy3)
{
minqy3 = maxqy3;
maxqy3 = qy3[i];
}
else if(maxqy3 < qy3[i] && minqy3 < maxqy3)
{
maxqy3 = qy3[i];
}
else if(minqy3 < qy3[i])
{
minqy3 = qy3[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qy4) ; i++)
{
if(maxqy4 < qy4[i] && minqy4 > maxqy4)
{
minqy4 = maxqy4;
maxqy4 = qy4[i];
}
else if(maxqy4 < qy4[i] && minqy4 < maxqy4)
{
maxqy4 = qy4[i];
}
else if(minqy4 < qy4[i])
{
minqy4 = qy4[i];
}
}
if(qx1.empty() && qx2.empty() && qx3.empty() && qx4.empty())
{
cout << "No point in any quadrant";
}
if(maxqx1 != 0)
{
cout << "Q1: (" << minqx1 << ", " << minqy1 << ") (" << maxqx1 << ", " << maxqy1 << ") " << (maxqx1 - minqx1) * (maxqy1 - minqy1);
}
if(maxqx2 != 0)
{
cout << "Q2: (" << minqx2 << ", " << minqy2 << ") (" << maxqx2 << ", " << maxqy2 << ") " << (maxqx2 - minqx2) * (maxqy2 - minqy2);
}
if(maxqx3 != 0)
{
cout << "Q3: (" << minqx3 << ", " << minqy3 << ") (" << maxqx3 << ", " << maxqy3 << ") " << (maxqx3 - minqx3) * (maxqy3 - minqy3);
}
if(maxqx4 != 0)
{
cout << "Q4: (" << minqx4 << ", " << minqy4 << ") (" << maxqx4 << ", " << maxqy4 << ") " << (maxqx4 - minqx4) * (maxqy4 - minqy4);
}
return 0;
} | # 2070047, 2024-11-02 11:47:04, xxxx-x--x- (0%)
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
int n;
vector<int> qx1 , qy1 , qx2 , qy2 , qx3 , qy3 , qx4 , qy4;
cin >> n;
int x[n] , y[n];
for(int i = 0 ; i < n ; i++)
{
cin >> x[i] >> y[i];
if(x[i] > 0 && y[i] > 0)
{
qx1.push_back(x[i]);
qy1.push_back(y[i]);
}
else if(x[i] > 0 && y[i] < 0)
{
qx4.push_back(x[i]);
qy4.push_back(y[i]);
}
else if(x[i] < 0 && y[i] < 0)
{
qx3.push_back(x[i]);
qy3.push_back(y[i]);
}
else if(x[i] < 0 && y[i] > 0)
{
qx2.push_back(x[i]);
qy2.push_back(y[i]);
}
}
int maxqx1 = 0 , minqx1 = qx1[0] , maxqx2 = qx2[0] , minqx2 = 0 , maxqx3 = qx3[0] , minqx3 = 0 , maxqx4 = 0 , minqx4 = qx4[0];
int maxqy1 = 0 , minqy1 = qy1[0] , maxqy2 = qy2[0] , minqy2 = 0 , maxqy3 = qy3[0] , minqy3 = 0 , maxqy4 = 0 , minqy4 = qy4[0];
for(long unsigned int i = 0 ; i < sizeof(qx1) ; i++)
{
if(maxqx1 < qx1[i] && minqx1 > maxqx1)
{
minqx1 = maxqx1;
maxqx1 = qx1[i];
}
else if(maxqx1 < qx1[i] && minqx1 < maxqx1)
{
maxqx1 = qx1[i];
}
else if(minqx1 < qx1[i])
{
minqx1 = qx1[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qx2) ; i++)
{
if(maxqx2 < qx2[i] && minqx2 > maxqx2)
{
minqx2 = maxqx2;
maxqx2 = qx2[i];
}
else if(maxqx2 < qx2[i] && minqx2 < maxqx2)
{
maxqx2 = qx2[i];
}
else if(minqx2 < qx2[i])
{
minqx2 = qx2[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qx3) ; i++)
{
if(maxqx3 < qx3[i] && minqx3 > maxqx3)
{
minqx3 = maxqx3;
maxqx3 = qx3[i];
}
else if(maxqx3 < qx3[i] && minqx3 < maxqx3)
{
maxqx3 = qx3[i];
}
else if(minqx3 < qx3[i])
{
minqx3 = qx3[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qx4) ; i++)
{
if(maxqx4 < qx4[i] && minqx4 > maxqx4)
{
minqx4 = maxqx4;
maxqx4 = qx4[i];
}
else if(maxqx4 < qx4[i] && minqx4 < maxqx4)
{
maxqx4 = qx4[i];
}
else if(minqx4 < qx4[i])
{
minqx4 = qx4[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qy1) ; i++)
{
if(maxqy1 < qy1[i] && minqy1 > maxqy1)
{
minqy1 = maxqy1;
maxqy1 = qy1[i];
}
else if(maxqy1 < qy1[i] && minqy1 < maxqy1)
{
maxqy1 = qy1[i];
}
else if(minqy1 < qy1[i])
{
minqy1 = qy1[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qy2) ; i++)
{
if(maxqy2 < qy2[i] && minqy2 > maxqy2)
{
minqy2 = maxqy2;
maxqy2 = qy2[i];
}
else if(maxqy2 < qy2[i] && minqy2 < maxqy2)
{
maxqy2 = qy2[i];
}
else if(minqy2 < qy2[i])
{
minqy2 = qy2[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qy3) ; i++)
{
if(maxqy3 < qy3[i] && minqy3 > maxqy3)
{
minqy3 = maxqy3;
maxqy3 = qy3[i];
}
else if(maxqy3 < qy3[i] && minqy3 < maxqy3)
{
maxqy3 = qy3[i];
}
else if(minqy3 < qy3[i])
{
minqy3 = qy3[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qy4) ; i++)
{
if(maxqy4 < qy4[i] && minqy4 > maxqy4)
{
minqy4 = maxqy4;
maxqy4 = qy4[i];
}
else if(maxqy4 < qy4[i] && minqy4 < maxqy4)
{
maxqy4 = qy4[i];
}
else if(minqy4 < qy4[i])
{
minqy4 = qy4[i];
}
}
if(qx1.empty() && qx2.empty() && qx3.empty() && qx4.empty())
{
cout << "No point in any quadrant";
}
if(maxqx1 != 0)
{
cout << "Q1: (" << minqx1 << ", " << minqy1 << ") (" << maxqx1 << ", " << maxqy1 << ") " << " " << (maxqx1 - minqx1) * (maxqy1 - minqy1);
}
if(maxqx2 != 0)
{
cout << "Q2: (" << minqx2 << ", " << minqy2 << ") (" << maxqx2 << ", " << maxqy2 << ") " << " " << (maxqx2 - minqx2) * (maxqy2 - minqy2);
}
if(maxqx3 != 0)
{
cout << "Q3: (" << minqx3 << ", " << minqy3 << ") (" << maxqx3 << ", " << maxqy3 << ") " << " " << (maxqx3 - minqx3) * (maxqy3 - minqy3);
}
if(maxqx4 != 0)
{
cout << "Q4: (" << minqx4 << ", " << minqy4 << ") (" << maxqx4 << ", " << maxqy4 << ") " << " " << (maxqx4 - minqx4) * (maxqy4 - minqy4);
}
return 0;
} | # 2070439, 2024-11-02 12:08:39, xxxx-x--x- (0%)
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
int n;
vector<int> qx1 , qy1 , qx2 , qy2 , qx3 , qy3 , qx4 , qy4;
cin >> n;
int x[n] , y[n];
for(int i = 0 ; i < n ; i++)
{
cin >> x[i] >> y[i];
if(x[i] > 0 && y[i] > 0)
{
qx1.push_back(x[i]);
qy1.push_back(y[i]);
}
else if(x[i] > 0 && y[i] < 0)
{
qx4.push_back(x[i]);
qy4.push_back(y[i]);
}
else if(x[i] < 0 && y[i] < 0)
{
qx3.push_back(x[i]);
qy3.push_back(y[i]);
}
else if(x[i] < 0 && y[i] > 0)
{
qx2.push_back(x[i]);
qy2.push_back(y[i]);
}
}
int maxqx1 = 0 , minqx1 = qx1[0] , maxqx2 = qx2[0] , minqx2 = 0 , maxqx3 = qx3[0] , minqx3 = 0 , maxqx4 = 0 , minqx4 = qx4[0];
int maxqy1 = 0 , minqy1 = qy1[0] , maxqy2 = qy2[0] , minqy2 = 0 , maxqy3 = qy3[0] , minqy3 = 0 , maxqy4 = 0 , minqy4 = qy4[0];
for(long unsigned int i = 0 ; i < qx1.size() ; i++)
{
if(maxqx1 < qx1[i] && minqx1 > maxqx1)
{
minqx1 = maxqx1;
maxqx1 = qx1[i];
}
else if(maxqx1 < qx1[i] && minqx1 < maxqx1)
{
maxqx1 = qx1[i];
}
else if(minqx1 < qx1[i])
{
minqx1 = qx1[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qx2) ; i++)
{
if(maxqx2 < qx2[i] && minqx2 > maxqx2)
{
minqx2 = maxqx2;
maxqx2 = qx2[i];
}
else if(maxqx2 < qx2[i] && minqx2 < maxqx2)
{
maxqx2 = qx2[i];
}
else if(minqx2 < qx2[i])
{
minqx2 = qx2[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qx3) ; i++)
{
if(maxqx3 < qx3[i] && minqx3 > maxqx3)
{
minqx3 = maxqx3;
maxqx3 = qx3[i];
}
else if(maxqx3 < qx3[i] && minqx3 < maxqx3)
{
maxqx3 = qx3[i];
}
else if(minqx3 < qx3[i])
{
minqx3 = qx3[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qx4) ; i++)
{
if(maxqx4 < qx4[i] && minqx4 > maxqx4)
{
minqx4 = maxqx4;
maxqx4 = qx4[i];
}
else if(maxqx4 < qx4[i] && minqx4 < maxqx4)
{
maxqx4 = qx4[i];
}
else if(minqx4 < qx4[i])
{
minqx4 = qx4[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qy1) ; i++)
{
if(maxqy1 < qy1[i] && minqy1 > maxqy1)
{
minqy1 = maxqy1;
maxqy1 = qy1[i];
}
else if(maxqy1 < qy1[i] && minqy1 < maxqy1)
{
maxqy1 = qy1[i];
}
else if(minqy1 < qy1[i])
{
minqy1 = qy1[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qy2) ; i++)
{
if(maxqy2 < qy2[i] && minqy2 > maxqy2)
{
minqy2 = maxqy2;
maxqy2 = qy2[i];
}
else if(maxqy2 < qy2[i] && minqy2 < maxqy2)
{
maxqy2 = qy2[i];
}
else if(minqy2 < qy2[i])
{
minqy2 = qy2[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qy3) ; i++)
{
if(maxqy3 < qy3[i] && minqy3 > maxqy3)
{
minqy3 = maxqy3;
maxqy3 = qy3[i];
}
else if(maxqy3 < qy3[i] && minqy3 < maxqy3)
{
maxqy3 = qy3[i];
}
else if(minqy3 < qy3[i])
{
minqy3 = qy3[i];
}
}
for(long unsigned int i = 0 ; i < sizeof(qy4) ; i++)
{
if(maxqy4 < qy4[i] && minqy4 > maxqy4)
{
minqy4 = maxqy4;
maxqy4 = qy4[i];
}
else if(maxqy4 < qy4[i] && minqy4 < maxqy4)
{
maxqy4 = qy4[i];
}
else if(minqy4 < qy4[i])
{
minqy4 = qy4[i];
}
}
if(qx1.empty() && qx2.empty() && qx3.empty() && qx4.empty())
{
cout << "No point in any quadrant";
}
if(maxqx1 != 0)
{
cout << "Q1: (" << minqx1 << ", " << minqy1 << ") (" << maxqx1 << ", " << maxqy1 << ") " << " " << (maxqx1 - minqx1) * (maxqy1 - minqy1);
}
if(maxqx2 != 0)
{
cout << "Q2: (" << minqx2 << ", " << minqy2 << ") (" << maxqx2 << ", " << maxqy2 << ") " << " " << (maxqx2 - minqx2) * (maxqy2 - minqy2);
}
if(maxqx3 != 0)
{
cout << "Q3: (" << minqx3 << ", " << minqy3 << ") (" << maxqx3 << ", " << maxqy3 << ") " << " " << (maxqx3 - minqx3) * (maxqy3 - minqy3);
}
if(maxqx4 != 0)
{
cout << "Q4: (" << minqx4 << ", " << minqy4 << ") (" << maxqx4 << ", " << maxqy4 << ") " << " " << (maxqx4 - minqx4) * (maxqy4 - minqy4);
}
return 0;
} | # 2070484, 2024-11-02 12:10:12, xxxx-x--x- (0%)
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
int n;
vector<int> qx1 , qy1 , qx2 , qy2 , qx3 , qy3 , qx4 , qy4;
cin >> n;
int x[n] , y[n];
for(int i = 0 ; i < n ; i++)
{
cin >> x[i] >> y[i];
if(x[i] > 0 && y[i] > 0)
{
qx1.push_back(x[i]);
qy1.push_back(y[i]);
}
else if(x[i] > 0 && y[i] < 0)
{
qx4.push_back(x[i]);
qy4.push_back(y[i]);
}
else if(x[i] < 0 && y[i] < 0)
{
qx3.push_back(x[i]);
qy3.push_back(y[i]);
}
else if(x[i] < 0 && y[i] > 0)
{
qx2.push_back(x[i]);
qy2.push_back(y[i]);
}
}
int maxqx1 = 0 , minqx1 = qx1[0] , maxqx2 = qx2[0] , minqx2 = 0 , maxqx3 = qx3[0] , minqx3 = 0 , maxqx4 = 0 , minqx4 = qx4[0];
int maxqy1 = 0 , minqy1 = qy1[0] , maxqy2 = qy2[0] , minqy2 = 0 , maxqy3 = qy3[0] , minqy3 = 0 , maxqy4 = 0 , minqy4 = qy4[0];
for(long unsigned int i = 0 ; i < qx1.size() ; i++)
{
if(maxqx1 < qx1[i] && minqx1 > maxqx1)
{
minqx1 = maxqx1;
maxqx1 = qx1[i];
}
else if(maxqx1 < qx1[i] && minqx1 < maxqx1)
{
maxqx1 = qx1[i];
}
else if(minqx1 < qx1[i])
{
minqx1 = qx1[i];
}
}
for(long unsigned int i = 0 ; i < qx2.size() ; i++)
{
if(maxqx2 < qx2[i] && minqx2 > maxqx2)
{
minqx2 = maxqx2;
maxqx2 = qx2[i];
}
else if(maxqx2 < qx2[i] && minqx2 < maxqx2)
{
maxqx2 = qx2[i];
}
else if(minqx2 < qx2[i])
{
minqx2 = qx2[i];
}
}
for(long unsigned int i = 0 ; i < qx3.size() ; i++)
{
if(maxqx3 < qx3[i] && minqx3 > maxqx3)
{
minqx3 = maxqx3;
maxqx3 = qx3[i];
}
else if(maxqx3 < qx3[i] && minqx3 < maxqx3)
{
maxqx3 = qx3[i];
}
else if(minqx3 < qx3[i])
{
minqx3 = qx3[i];
}
}
for(long unsigned int i = 0 ; i < qx4.size() ; i++)
{
if(maxqx4 < qx4[i] && minqx4 > maxqx4)
{
minqx4 = maxqx4;
maxqx4 = qx4[i];
}
else if(maxqx4 < qx4[i] && minqx4 < maxqx4)
{
maxqx4 = qx4[i];
}
else if(minqx4 < qx4[i])
{
minqx4 = qx4[i];
}
}
for(long unsigned int i = 0 ; i < qy1.size() ; i++)
{
if(maxqy1 < qy1[i] && minqy1 > maxqy1)
{
minqy1 = maxqy1;
maxqy1 = qy1[i];
}
else if(maxqy1 < qy1[i] && minqy1 < maxqy1)
{
maxqy1 = qy1[i];
}
else if(minqy1 < qy1[i])
{
minqy1 = qy1[i];
}
}
for(long unsigned int i = 0 ; i < qy2.size() ; i++)
{
if(maxqy2 < qy2[i] && minqy2 > maxqy2)
{
minqy2 = maxqy2;
maxqy2 = qy2[i];
}
else if(maxqy2 < qy2[i] && minqy2 < maxqy2)
{
maxqy2 = qy2[i];
}
else if(minqy2 < qy2[i])
{
minqy2 = qy2[i];
}
}
for(long unsigned int i = 0 ; i < qy3.size() ; i++)
{
if(maxqy3 < qy3[i] && minqy3 > maxqy3)
{
minqy3 = maxqy3;
maxqy3 = qy3[i];
}
else if(maxqy3 < qy3[i] && minqy3 < maxqy3)
{
maxqy3 = qy3[i];
}
else if(minqy3 < qy3[i])
{
minqy3 = qy3[i];
}
}
for(long unsigned int i = 0 ; i < qy4.size() ; i++)
{
if(maxqy4 < qy4[i] && minqy4 > maxqy4)
{
minqy4 = maxqy4;
maxqy4 = qy4[i];
}
else if(maxqy4 < qy4[i] && minqy4 < maxqy4)
{
maxqy4 = qy4[i];
}
else if(minqy4 < qy4[i])
{
minqy4 = qy4[i];
}
}
if(qx1.empty() && qx2.empty() && qx3.empty() && qx4.empty())
{
cout << "No point in any quadrant";
}
if(maxqx1 != 0)
{
cout << "Q1: (" << minqx1 << ", " << minqy1 << ") (" << maxqx1 << ", " << maxqy1 << ") " << " " << (maxqx1 - minqx1) * (maxqy1 - minqy1);
}
if(maxqx2 != 0)
{
cout << "Q2: (" << minqx2 << ", " << minqy2 << ") (" << maxqx2 << ", " << maxqy2 << ") " << " " << (maxqx2 - minqx2) * (maxqy2 - minqy2);
}
if(maxqx3 != 0)
{
cout << "Q3: (" << minqx3 << ", " << minqy3 << ") (" << maxqx3 << ", " << maxqy3 << ") " << " " << (maxqx3 - minqx3) * (maxqy3 - minqy3);
}
if(maxqx4 != 0)
{
cout << "Q4: (" << minqx4 << ", " << minqy4 << ") (" << maxqx4 << ", " << maxqy4 << ") " << " " << (maxqx4 - minqx4) * (maxqy4 - minqy4);
}
return 0;
} | # 2070494, 2024-11-02 12:10:38, xxxx-x--x- (0%)
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
int n;
vector<int> qx1 , qy1 , qx2 , qy2 , qx3 , qy3 , qx4 , qy4;
cin >> n;
int x[n] , y[n];
for(int i = 0 ; i < n ; i++)
{
cin >> x[i] >> y[i];
if(x[i] > 0 && y[i] > 0)
{
qx1.push_back(x[i]);
qy1.push_back(y[i]);
}
else if(x[i] > 0 && y[i] < 0)
{
qx4.push_back(x[i]);
qy4.push_back(y[i]);
}
else if(x[i] < 0 && y[i] < 0)
{
qx3.push_back(x[i]);
qy3.push_back(y[i]);
}
else if(x[i] < 0 && y[i] > 0)
{
qx2.push_back(x[i]);
qy2.push_back(y[i]);
}
}
int maxqx1 = 0 , minqx1 = qx1[0] , maxqx2 = qx2[0] , minqx2 = 0 , maxqx3 = qx3[0] , minqx3 = 0 , maxqx4 = 0 , minqx4 = qx4[0];
int maxqy1 = 0 , minqy1 = qy1[0] , maxqy2 = qy2[0] , minqy2 = 0 , maxqy3 = qy3[0] , minqy3 = 0 , maxqy4 = 0 , minqy4 = qy4[0];
for(long unsigned int i = 0 ; i < qx1.size() ; i++)
{
if(maxqx1 < qx1[i] && minqx1 > maxqx1)
{
minqx1 = maxqx1;
maxqx1 = qx1[i];
}
else if(maxqx1 < qx1[i] && minqx1 < maxqx1)
{
maxqx1 = qx1[i];
}
else if(minqx1 < qx1[i])
{
minqx1 = qx1[i];
}
}
for(long unsigned int i = 0 ; i < qx2.size() ; i++)
{
if(maxqx2 < qx2[i] && minqx2 > maxqx2)
{
minqx2 = maxqx2;
maxqx2 = qx2[i];
}
else if(maxqx2 < qx2[i] && minqx2 < maxqx2)
{
maxqx2 = qx2[i];
}
else if(minqx2 < qx2[i])
{
minqx2 = qx2[i];
}
}
for(long unsigned int i = 0 ; i < qx3.size() ; i++)
{
if(maxqx3 < qx3[i] && minqx3 > maxqx3)
{
minqx3 = maxqx3;
maxqx3 = qx3[i];
}
else if(maxqx3 < qx3[i] && minqx3 < maxqx3)
{
maxqx3 = qx3[i];
}
else if(minqx3 < qx3[i])
{
minqx3 = qx3[i];
}
}
for(long unsigned int i = 0 ; i < qx4.size() ; i++)
{
if(maxqx4 < qx4[i] && minqx4 > maxqx4)
{
minqx4 = maxqx4;
maxqx4 = qx4[i];
}
else if(maxqx4 < qx4[i] && minqx4 < maxqx4)
{
maxqx4 = qx4[i];
}
else if(minqx4 < qx4[i])
{
minqx4 = qx4[i];
}
}
for(long unsigned int i = 0 ; i < qy1.size() ; i++)
{
if(maxqy1 < qy1[i] && minqy1 > maxqy1)
{
minqy1 = maxqy1;
maxqy1 = qy1[i];
}
else if(maxqy1 < qy1[i] && minqy1 < maxqy1)
{
maxqy1 = qy1[i];
}
else if(minqy1 < qy1[i])
{
minqy1 = qy1[i];
}
}
for(long unsigned int i = 0 ; i < qy2.size() ; i++)
{
if(maxqy2 < qy2[i] && minqy2 > maxqy2)
{
minqy2 = maxqy2;
maxqy2 = qy2[i];
}
else if(maxqy2 < qy2[i] && minqy2 < maxqy2)
{
maxqy2 = qy2[i];
}
else if(minqy2 < qy2[i])
{
minqy2 = qy2[i];
}
}
for(long unsigned int i = 0 ; i < qy3.size() ; i++)
{
if(maxqy3 < qy3[i] && minqy3 > maxqy3)
{
minqy3 = maxqy3;
maxqy3 = qy3[i];
}
else if(maxqy3 < qy3[i] && minqy3 < maxqy3)
{
maxqy3 = qy3[i];
}
else if(minqy3 < qy3[i])
{
minqy3 = qy3[i];
}
}
for(long unsigned int i = 0 ; i < qy4.size() ; i++)
{
if(maxqy4 < qy4[i] && minqy4 > maxqy4)
{
minqy4 = maxqy4;
maxqy4 = qy4[i];
}
else if(maxqy4 < qy4[i] && minqy4 < maxqy4)
{
maxqy4 = qy4[i];
}
else if(minqy4 < qy4[i])
{
minqy4 = qy4[i];
}
}
if(qx1.empty() && qx2.empty() && qx3.empty() && qx4.empty())
{
cout << "No point in any quadrant";
}
if(maxqx1 != 0)
{
cout << "Q1: (" << minqx1 << ", " << minqy1 << ") (" << maxqx1 << ", " << maxqy1 << ") " << " " << (maxqx1 - minqx1) * (maxqy1 - minqy1);
}
if(minqx2 != 0)
{
cout << "Q2: (" << minqx2 << ", " << minqy2 << ") (" << maxqx2 << ", " << maxqy2 << ") " << " " << (maxqx2 - minqx2) * (maxqy2 - minqy2);
}
if(minqx3 != 0)
{
cout << "Q3: (" << minqx3 << ", " << minqy3 << ") (" << maxqx3 << ", " << maxqy3 << ") " << " " << (maxqx3 - minqx3) * (maxqy3 - minqy3);
}
if(maxqx4 != 0)
{
cout << "Q4: (" << minqx4 << ", " << minqy4 << ") (" << maxqx4 << ", " << maxqy4 << ") " << " " << (maxqx4 - minqx4) * (maxqy4 - minqy4);
}
return 0;
} |
# 2069358, 2024-11-02 10:39:22, -----P---- (10%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
int a,b;
cin >> n;
for(int i =0; i < n; ++i){
cin >> a >> b;
}
cout << "No point in any quadrant";
} | # 2069894, 2024-11-02 11:34:09, -----P---- (10%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n, a, b;
vector<int> x1,y1,x2,y2,x3,y3,x4,y4;
cin >> n;
for(int i =0; i < n; ++i){
cin >> a >> b;
if(a > 0 && b >0){
x1.push_back(a);
y1.push_back(b);
}else if(a < 0 && b > 0){
x2.push_back(a);
y2.push_back(b);
}else if(a < 0 && b < 0){
x3.push_back(a);
y3.push_back(b);
}else if(a > 0 && b < 0){
x4.push_back(a);
y4.push_back(b);
}
}
int max1x = x1[0];
int min1x = x1[0];
int max1y = y1[0];
int min1y = y1[0];
for(int i; i < x1.size(); ++i){
if(max1x < x1[i]){
max1x = x1[i];
}
if(min1x > x1[i]){
min1x = x1[i];
}
if(max1y < y1[i]){
max1y = y1[i];
}
if(min1y > y1[i]){
min1y = y1[i];
}
}
int max2x = x2[0];
int min2x = x2[0];
int max2y = y2[0];
int min2y = y2[0];
for(int i; i < x2.size(); ++i){
if(max2x < x2[i]){
max2x = x2[i];
}
if(min2x > x2[i]){
min2x = x2[i];
}
if(max2y < y2[i]){
max2y = y2[i];
}
if(min2y > y2[i]){
min2y = y2[i];
}
}
int max3x = x3[0];
int min3x = x3[0];
int max3y = y3[0];
int min3y = y3[0];
for(int i; i < x3.size(); ++i){
if(max3x < x3[i]){
max3x = x3[i];
}
if(min3x > x3[i]){
min3x = x3[i];
}
if(max3y < y3[i]){
max3y = y3[i];
}
if(min3y > y3[i]){
min3y = y3[i];
}
}
int max4x = x4[0];
int min4x = x4[0];
int max4y = y4[0];
int min4y = y4[0];
for(int i; i < x4.size(); ++i){
if(max4x < x4[i]){
max4x = x4[i];
}
if(min4x > x4[i]){
min4x = x4[i];
}
if(max4y < y4[i]){
max4y = y4[i];
}
if(min4y > y4[i]){
min4y = y4[i];
}
}
int h1 = max1y - min1y, l1 = max1x - min1x;
int h2 = max2y - min2y, l2 = max2x - min2x;
int h3 = max3y - min3y, l3 = max3x -min3x;
int h4 = max4y - min4y, l4 = max4x -min4x;
int Area1 = h1*l1;
int Area2 = h2*l2;
int Area3 = h3*l3;
int Area4 = h4*l4;
if(x1.size()== 0 && x2.size() == 0 && x3.size() == 0 && x4.size() == 0){
cout << "No point in any quadrant";
}else if(x1.size() != 0){
cout << "Q1:" << "(" << "," << ")" << "(" << "," << ")" <<endl;
}else if(x2.size() != 0){
cout << "Q2:"<< "(" << "," << ")" << "(" << "," << ")" <<endl;
}else if(x3.size() != 0){
cout << "Q3:"<< "(" << "," << ")" << "(" << "," << ")" <<endl;
}else if(x4.size() != 0){
cout << "Q4:"<< "(" << "," << ")" << "(" << "," << ")" <<endl;
}
} | # 2069981, 2024-11-02 11:42:36, xxxx-x--x- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n, a, b;
vector<int> x1,y1,x2,y2,x3,y3,x4,y4;
cin >> n;
for(int i =0; i < n; ++i){
cin >> a >> b;
if(a > 0 && b >0){
x1.push_back(a);
y1.push_back(b);
}else if(a < 0 && b > 0){
x2.push_back(a);
y2.push_back(b);
}else if(a < 0 && b < 0){
x3.push_back(a);
y3.push_back(b);
}else if(a > 0 && b < 0){
x4.push_back(a);
y4.push_back(b);
}
}
int max1x = x1[0];
int min1x = x1[0];
int max1y = y1[0];
int min1y = y1[0];
for(int i; i < x1.size(); ++i){
if(max1x < x1[i]){
max1x = x1[i];
}
if(min1x > x1[i]){
min1x = x1[i];
}
if(max1y < y1[i]){
max1y = y1[i];
}
if(min1y > y1[i]){
min1y = y1[i];
}
}
int max2x = x2[0];
int min2x = x2[0];
int max2y = y2[0];
int min2y = y2[0];
for(int i; i < x2.size(); ++i){
if(max2x < x2[i]){
max2x = x2[i];
}
if(min2x > x2[i]){
min2x = x2[i];
}
if(max2y < y2[i]){
max2y = y2[i];
}
if(min2y > y2[i]){
min2y = y2[i];
}
}
int max3x = x3[0];
int min3x = x3[0];
int max3y = y3[0];
int min3y = y3[0];
for(int i; i < x3.size(); ++i){
if(max3x < x3[i]){
max3x = x3[i];
}
if(min3x > x3[i]){
min3x = x3[i];
}
if(max3y < y3[i]){
max3y = y3[i];
}
if(min3y > y3[i]){
min3y = y3[i];
}
}
int max4x = x4[0];
int min4x = x4[0];
int max4y = y4[0];
int min4y = y4[0];
for(int i; i < x4.size(); ++i){
if(max4x < x4[i]){
max4x = x4[i];
}
if(min4x > x4[i]){
min4x = x4[i];
}
if(max4y < y4[i]){
max4y = y4[i];
}
if(min4y > y4[i]){
min4y = y4[i];
}
}
int h1 = max1y - min1y, l1 = max1x - min1x;
int h2 = max2y - min2y, l2 = (-1*min2x) - (-1*max2x);
int h3 = (-1*min3y) - (-1*max3y), l3 = (-1*min3x) - (-1*max3x);
int h4 = (-1*min3y) - (-1*max3y), l4 = max4x -min4x;
int Area1 = h1*l1;
int Area2 = h2*l2;
int Area3 = h3*l3;
int Area4 = h4*l4;
if(x1.size()== 0 && x2.size() == 0 && x3.size() == 0 && x4.size() == 0){
cout << "No point in any quadrant";
}else if(x1.size() != 0){
cout << "Q1:" << "(" << min1x << ", " << min1y << ")" << "(" << max1x << ", " << max1y << ")" <<endl;
}else if(x2.size() != 0){
cout << "Q2:"<< "(" << min2x << ", " << min2y << ")" << "(" << max2x << ", " << max2y << ")" <<endl;
}else if(x3.size() != 0){
cout << "Q3:"<< "(" << min3x << ", " << min3y << ")" << "(" << max3x << ", " << max3y << ")" <<endl;
}else if(x4.size() != 0){
cout << "Q4:"<< "(" << min4x << ", " << min4y << ")" << "(" << max4x << ", " << max4y << ")" <<endl;
}
} | # 2070330, 2024-11-02 12:03:57, xxxx-x--x- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n, a, b;
vector<int> x1,y1,x2,y2,x3,y3,x4,y4;
cin >> n;
for(int i =0; i < n; ++i){
cin >> a >> b;
if(a > 0 && b >0){
x1.push_back(a);
y1.push_back(b);
}else if(a < 0 && b > 0){
x2.push_back(a);
y2.push_back(b);
}else if(a < 0 && b < 0){
x3.push_back(a);
y3.push_back(b);
}else if(a > 0 && b < 0){
x4.push_back(a);
y4.push_back(b);
}
}
int max1x = x1[0];
int min1x = x1[0];
int max1y = y1[0];
int min1y = y1[0];
for(int i; i < x1.size(); ++i){
if(max1x < x1[i]){
max1x = x1[i];
}
if(min1x > x1[i]){
min1x = x1[i];
}
if(max1y < y1[i]){
max1y = y1[i];
}
if(min1y > y1[i]){
min1y = y1[i];
}
}
int max2x = x2[0];
int min2x = x2[0];
int max2y = y2[0];
int min2y = y2[0];
for(int i; i < x2.size(); ++i){
if(max2x < x2[i]){
max2x = x2[i];
}
if(min2x > x2[i]){
min2x = x2[i];
}
if(max2y < y2[i]){
max2y = y2[i];
}
if(min2y > y2[i]){
min2y = y2[i];
}
}
int max3x = x3[0];
int min3x = x3[0];
int max3y = y3[0];
int min3y = y3[0];
for(int i; i < x3.size(); ++i){
if(max3x < x3[i]){
max3x = x3[i];
}
if(min3x > x3[i]){
min3x = x3[i];
}
if(max3y < y3[i]){
max3y = y3[i];
}
if(min3y > y3[i]){
min3y = y3[i];
}
}
int max4x = x4[0];
int min4x = x4[0];
int max4y = y4[0];
int min4y = y4[0];
for(int i; i < x4.size(); ++i){
if(max4x < x4[i]){
max4x = x4[i];
}
if(min4x > x4[i]){
min4x = x4[i];
}
if(max4y < y4[i]){
max4y = y4[i];
}
if(min4y > y4[i]){
min4y = y4[i];
}
}
int h1 = max1y - min1y, l1 = max1x - min1x;
int h2 = max2y - min2y, l2 = (-1*min2x) - (-1*max2x);
int h3 = (-1*min3y) - (-1*max3y), l3 = (-1*min3x) - (-1*max3x);
int h4 = (-1*min3y) - (-1*max3y), l4 = max4x -min4x;
int Area1 = h1*l1;
int Area2 = h2*l2;
int Area3 = h3*l3;
int Area4 = h4*l4;
if(x1.size()== 0 && x2.size() == 0 && x3.size() == 0 && x4.size() == 0){
cout << "No point in any quadrant";
}else if(x1.size() != 0){
cout << "Q1:" << "(" << min1x << ", " << min1y << ")" << "(" << max1x << ", " << max1y << ")" <<endl;
}else if(x2.size() != 0){
cout << "Q2:"<< "(" << min2x << ", " << min2y << ")" << "(" << max2x << ", " << max1y << ")" <<endl;
}else if(x3.size() != 0){
cout << "Q3:"<< "(" << min3x << ", " << min3y << ")" << "(" << max3x << ", " << max1y << ")" <<endl;
}else if(x4.size() != 0){
cout << "Q4:"<< "(" << min4x << ", " << min4y << ")" << "(" << max4x << ", " << max4y << ")" <<endl;
}
} | # 2070427, 2024-11-02 12:08:08, xxxx-x--x- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n, a, b;
vector<int> x1,y1,x2,y2,x3,y3,x4,y4;
cin >> n;
for(int i =0; i < n; ++i){
cin >> a >> b;
if(a > 0 && b >0){
x1.push_back(a);
y1.push_back(b);
}else if(a < 0 && b > 0){
x2.push_back(a);
y2.push_back(b);
}else if(a < 0 && b < 0){
x3.push_back(a);
y3.push_back(b);
}else if(a > 0 && b < 0){
x4.push_back(a);
y4.push_back(b);
}
}
int max1x = x1[0];
int min1x = x1[0];
int max1y = y1[0];
int min1y = y1[0];
for(long long i; i < x1.size(); ++i){
if(max1x < x1[i]){
max1x = x1[i];
}
if(min1x > x1[i]){
min1x = x1[i];
}
if(max1y < y1[i]){
max1y = y1[i];
}
if(min1y > y1[i]){
min1y = y1[i];
}
}
int max2x = x2[0];
int min2x = x2[0];
int max2y = y2[0];
int min2y = y2[0];
for(long long i; i < x2.size(); ++i){
if(max2x < x2[i]){
max2x = x2[i];
}
if(min2x > x2[i]){
min2x = x2[i];
}
if(max2y < y2[i]){
max2y = y2[i];
}
if(min2y > y2[i]){
min2y = y2[i];
}
}
int max3x = x3[0];
int min3x = x3[0];
int max3y = y3[0];
int min3y = y3[0];
for(long long i; i < x3.size(); ++i){
if(max3x < x3[i]){
max3x = x3[i];
}
if(min3x > x3[i]){
min3x = x3[i];
}
if(max3y < y3[i]){
max3y = y3[i];
}
if(min3y > y3[i]){
min3y = y3[i];
}
}
int max4x = x4[0];
int min4x = x4[0];
int max4y = y4[0];
int min4y = y4[0];
for(long long i; i < x4.size(); ++i){
if(max4x < x4[i]){
max4x = x4[i];
}
if(min4x > x4[i]){
min4x = x4[i];
}
if(max4y < y4[i]){
max4y = y4[i];
}
if(min4y > y4[i]){
min4y = y4[i];
}
}
int h1 = max1y - min1y, l1 = max1x - min1x;
int h2 = max2y - min2y, l2 = (-1*min2x) - (-1*max2x);
int h3 = (-1*min3y) - (-1*max3y), l3 = (-1*min3x) - (-1*max3x);
int h4 = (-1*min3y) - (-1*max3y), l4 = max4x -min4x;
int A1 = h1*l1;
int A2 = h2*l2;
int A3 = h3*l3;
int A4 = h4*l4;
if(x1.size()== 0 && x2.size() == 0 && x3.size() == 0 && x4.size() == 0){
cout << "No point in any quadrant";
}else if(x1.size() != 0){
cout << "Q1:" << "(" << min1x << ", " << min1y << ")" << "(" << max1x << ", " << max1y << ") "<< A1 <<endl;
}else if(x2.size() != 0){
cout << "Q2:"<< "(" << min2x << ", " << min2y << ")" << "(" << max2x << ", " << max1y << ") " << A2 <<endl;
}else if(x3.size() != 0){
cout << "Q3:"<< "(" << min3x << ", " << min3y << ")" << "(" << max3x << ", " << max1y << ") " << A3 <<endl;
}else if(x4.size() != 0){
cout << "Q4:"<< "(" << min4x << ", " << min4y << ")" << "(" << max4x << ", " << max4y << ") " << A4 <<endl;
}
} | # 2070444, 2024-11-02 12:08:43, xxxx-x--x- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n, a, b;
vector<int> x1,y1,x2,y2,x3,y3,x4,y4;
cin >> n;
for(int i =0; i < n; ++i){
cin >> a >> b;
if(a > 0 && b >0){
x1.push_back(a);
y1.push_back(b);
}else if(a < 0 && b > 0){
x2.push_back(a);
y2.push_back(b);
}else if(a < 0 && b < 0){
x3.push_back(a);
y3.push_back(b);
}else if(a > 0 && b < 0){
x4.push_back(a);
y4.push_back(b);
}
}
int max1x = x1[0];
int min1x = x1[0];
int max1y = y1[0];
int min1y = y1[0];
for(long long i; i < x1.size(); ++i){
if(max1x < x1[i]){
max1x = x1[i];
}
if(min1x > x1[i]){
min1x = x1[i];
}
if(max1y < y1[i]){
max1y = y1[i];
}
if(min1y > y1[i]){
min1y = y1[i];
}
}
int max2x = x2[0];
int min2x = x2[0];
int max2y = y2[0];
int min2y = y2[0];
for(long long i; i < x2.size(); ++i){
if(max2x < x2[i]){
max2x = x2[i];
}
if(min2x > x2[i]){
min2x = x2[i];
}
if(max2y < y2[i]){
max2y = y2[i];
}
if(min2y > y2[i]){
min2y = y2[i];
}
}
int max3x = x3[0];
int min3x = x3[0];
int max3y = y3[0];
int min3y = y3[0];
for(long long i; i < x3.size(); ++i){
if(max3x < x3[i]){
max3x = x3[i];
}
if(min3x > x3[i]){
min3x = x3[i];
}
if(max3y < y3[i]){
max3y = y3[i];
}
if(min3y > y3[i]){
min3y = y3[i];
}
}
int max4x = x4[0];
int min4x = x4[0];
int max4y = y4[0];
int min4y = y4[0];
for(long long i; i < x4.size(); ++i){
if(max4x < x4[i]){
max4x = x4[i];
}
if(min4x > x4[i]){
min4x = x4[i];
}
if(max4y < y4[i]){
max4y = y4[i];
}
if(min4y > y4[i]){
min4y = y4[i];
}
}
int h1 = max1y - min1y, l1 = max1x - min1x;
int h2 = max2y - min2y, l2 = (-1*min2x) - (-1*max2x);
int h3 = (-1*min3y) - (-1*max3y), l3 = (-1*min3x) - (-1*max3x);
int h4 = (-1*min3y) - (-1*max3y), l4 = max4x -min4x;
int A1 = h1*l1;
int A2 = h2*l2;
int A3 = h3*l3;
int A4 = h4*l4;
if(x1.size()== 0 && x2.size() == 0 && x3.size() == 0 && x4.size() == 0){
cout << "No point in any quadrant";
}
if(x1.size() != 0){
cout << "Q1:" << "(" << min1x << ", " << min1y << ")" << "(" << max1x << ", " << max1y << ") "<< A1 <<endl;
}
if(x2.size() != 0){
cout << "Q2:"<< "(" << min2x << ", " << min2y << ")" << "(" << max2x << ", " << max1y << ") " << A2 <<endl;
}
if(x3.size() != 0){
cout << "Q3:"<< "(" << min3x << ", " << min3y << ")" << "(" << max3x << ", " << max1y << ") " << A3 <<endl;
}
if(x4.size() != 0){
cout << "Q4:"<< "(" << min4x << ", " << min4y << ")" << "(" << max4x << ", " << max4y << ") " << A4 <<endl;
}
} |
# 2068889, 2024-11-02 09:51:05, -----P---- (10%)
#include <iostream>
using namespace std;
int main() {
int input;
while (cin >> input){
//Do nothing
}
cout << "No point in any quadrant" << endl;
} | # 2069753, 2024-11-02 11:21:34, ---------- (0%)
#include <iostream>
#include <set>
using namespace std;
int main() {
int n;
cin >> n;
set<pair<int,int>> Q1,Q2,Q3,Q4;
for (int i = 0; i < n; i++){
int inputX,inputY;
cin >> inputX >> inputY;
if (inputX == 0 || inputY == 0){
//Do nothing
} else if (inputX > 0 && inputY > 0){
Q1.insert({inputX,inputY});
} else if (inputX < 0 && inputY > 0){
Q2.insert({inputX,inputY});
} else if (inputX < 0 && inputY < 0){
Q3.insert({inputX,inputY});
} else if (inputX > 0 && inputY < 0){
Q4.insert({inputX,inputY});
}
}
//max min
int Xmax,Xmin = Q1.begin()->first;
int Ymax,Ymin = Q1.begin()->second;
for (auto itr = Q1.begin(); itr != Q1.end(); itr++){
if ((itr->first) > Xmax){
Xmax = itr->first;
}
if ((itr->first) < Xmin){
Xmin = itr->first;
}
if ((itr->second) > Ymax){
Ymax = itr->second;
}
if ((itr->second) < Ymin){
Ymin = itr->second;
}
}
int Q1area = Xmin*Ymax;
cout << "Q1: (" << Xmin << ", " << Ymin << ") (" << Xmax << ", " << Ymax << ") " << Q1area << endl;
} | # 2069758, 2024-11-02 11:22:11, -----P---- (10%)
#include <iostream>
using namespace std;
int main() {
int input;
while (cin >> input){
//Do nothing
}
cout << "No point in any quadrant" << endl;
} | # 2070201, 2024-11-02 11:57:25, -----P---- (10%)
#include <iostream>
#include <set>
using namespace std;
int findmaxofX(set<pair<int,int>> Quadrant){
int max = Quadrant.begin()->first;
for (auto itr = Quadrant.begin(); itr != Quadrant.end(); itr++){
if ((itr->first) > max){
max = itr->first;
}
}
return max;
}
int findminofX(set<pair<int,int>> Quadrant){
int min = Quadrant.begin()->first;
for (auto itr = Quadrant.begin(); itr != Quadrant.end(); itr++){
if ((itr->first) < min){
min = itr->first;
}
}
return min;
}
int findmaxofY(set<pair<int,int>> Quadrant){
int max = Quadrant.begin()->second;
for (auto itr = Quadrant.begin(); itr != Quadrant.end(); itr++){
if ((itr->second) > max){
max = itr->second;
}
}
return max;
}
int findminofY(set<pair<int,int>> Quadrant){
int min = Quadrant.begin()->second;
for (auto itr = Quadrant.begin(); itr != Quadrant.end(); itr++){
if ((itr->second) < min){
min = itr->second;
}
}
return min;
}
int main() {
int n;
cin >> n;
set<pair<int,int>> Q1,Q2,Q3,Q4;
bool haveVAR = false;
for (int i = 0; i < n; i++){
int inputX,inputY;
cin >> inputX >> inputY;
if (inputX == 0 || inputY == 0){
continue;
} else if (inputX > 0 && inputY > 0){
Q1.insert({inputX,inputY});
haveVAR = true;
} else if (inputX < 0 && inputY > 0){
Q2.insert({inputX,inputY});
haveVAR = true;
} else if (inputX < 0 && inputY < 0){
Q3.insert({inputX,inputY});
haveVAR = true;
} else if (inputX > 0 && inputY < 0){
Q4.insert({inputX,inputY});
haveVAR = true;
}
}
if (haveVAR){
int Q1area = findminofX(Q1)*findmaxofY(Q1);
cout << "Q1: (" << findminofX(Q1) << ", " << findminofY(Q1) << ") (" << findmaxofX(Q1) << ", " << findmaxofY(Q1) << ") " << Q1area << endl;
} else {
cout << "No point in any quadrant" << endl;
}
} | # 2070343, 2024-11-02 12:04:45, -----P---- (10%)
#include <iostream>
#include <set>
using namespace std;
int findmaxofX(set<pair<int,int>> Quadrant){
int max = Quadrant.begin()->first;
for (auto itr = Quadrant.begin(); itr != Quadrant.end(); itr++){
if ((itr->first) > max){
max = itr->first;
}
}
return max;
}
int findminofX(set<pair<int,int>> Quadrant){
int min = Quadrant.begin()->first;
for (auto itr = Quadrant.begin(); itr != Quadrant.end(); itr++){
if ((itr->first) < min){
min = itr->first;
}
}
return min;
}
int findmaxofY(set<pair<int,int>> Quadrant){
int max = Quadrant.begin()->second;
for (auto itr = Quadrant.begin(); itr != Quadrant.end(); itr++){
if ((itr->second) > max){
max = itr->second;
}
}
return max;
}
int findminofY(set<pair<int,int>> Quadrant){
int min = Quadrant.begin()->second;
for (auto itr = Quadrant.begin(); itr != Quadrant.end(); itr++){
if ((itr->second) < min){
min = itr->second;
}
}
return min;
}
int main() {
int n;
cin >> n;
set<pair<int,int>> Q1,Q2,Q3,Q4;
bool haveVAR = false;
for (int i = 0; i < n; i++){
int inputX,inputY;
cin >> inputX >> inputY;
if (inputX == 0 || inputY == 0){
continue;
} else if (inputX > 0 && inputY > 0){
Q1.insert({inputX,inputY});
haveVAR = true;
} else if (inputX < 0 && inputY > 0){
Q2.insert({inputX,inputY});
haveVAR = true;
} else if (inputX < 0 && inputY < 0){
Q3.insert({inputX,inputY});
haveVAR = true;
} else if (inputX > 0 && inputY < 0){
Q4.insert({inputX,inputY});
haveVAR = true;
}
}
if (haveVAR){
int Q1area = findminofX(Q1)*findmaxofY(Q1);
cout << "Q1: (" << findminofX(Q1) << ", " << findminofY(Q1) << ") (" << findmaxofX(Q1) << ", " << findmaxofY(Q1) << ") " << Q1area << endl;
int Q2area = (abs(findminofX(Q2))+findmaxofX(Q2))*(findmaxofY(Q2)-findminofY(Q2));
cout << "Q2: (" << findminofX(Q2) << ", " << findminofY(Q2) << ") (" << findmaxofX(Q2) << ", " << findmaxofY(Q2) << ") " << Q2area << endl;
} else {
cout << "No point in any quadrant" << endl;
}
} | # 2070521, 2024-11-02 12:11:15, -----P---- (10%)
#include <iostream>
#include <set>
using namespace std;
int findmaxofX(set<pair<int,int>> Quadrant){
int max = Quadrant.begin()->first;
for (auto itr = Quadrant.begin(); itr != Quadrant.end(); itr++){
if ((itr->first) > max){
max = itr->first;
}
}
return max;
}
int findminofX(set<pair<int,int>> Quadrant){
int min = Quadrant.begin()->first;
for (auto itr = Quadrant.begin(); itr != Quadrant.end(); itr++){
if ((itr->first) < min){
min = itr->first;
}
}
return min;
}
int findmaxofY(set<pair<int,int>> Quadrant){
int max = Quadrant.begin()->second;
for (auto itr = Quadrant.begin(); itr != Quadrant.end(); itr++){
if ((itr->second) > max){
max = itr->second;
}
}
return max;
}
int findminofY(set<pair<int,int>> Quadrant){
int min = Quadrant.begin()->second;
for (auto itr = Quadrant.begin(); itr != Quadrant.end(); itr++){
if ((itr->second) < min){
min = itr->second;
}
}
return min;
}
int main() {
int n;
cin >> n;
set<pair<int,int>> Q1,Q2,Q3,Q4;
bool haveVAR = false;
for (int i = 0; i < n; i++){
int inputX,inputY;
cin >> inputX >> inputY;
if (inputX == 0 || inputY == 0){
continue;
} else if (inputX > 0 && inputY > 0){
Q1.insert({inputX,inputY});
haveVAR = true;
} else if (inputX < 0 && inputY > 0){
Q2.insert({inputX,inputY});
haveVAR = true;
} else if (inputX < 0 && inputY < 0){
Q3.insert({inputX,inputY});
haveVAR = true;
} else if (inputX > 0 && inputY < 0){
Q4.insert({inputX,inputY});
haveVAR = true;
}
}
if (haveVAR){
int Q1area = findminofX(Q1)*findmaxofY(Q1);
cout << "Q1: (" << findminofX(Q1) << ", " << findminofY(Q1) << ") (" << findmaxofX(Q1) << ", " << findmaxofY(Q1) << ") " << Q1area << endl;
int Q2area = (abs(findminofX(Q2))+findmaxofX(Q2))*(findmaxofY(Q2)-findminofY(Q2));
cout << "Q2: (" << findminofX(Q2) << ", " << findminofY(Q2) << ") (" << findmaxofX(Q2) << ", " << findmaxofY(Q2) << ") " << Q2area << endl;
int Q3area = (abs(findminofY(Q3)*findmaxofX(Q3)));
cout << "Q3: (" << findminofX(Q3) << ", " << findminofY(Q3) << ") (" << findmaxofX(Q3) << ", " << findmaxofY(Q3) << ") " << Q3area << endl;
int Q4area = (findmaxofX(Q4)-findminofX(Q4))*(findminofY(Q4)+findmaxofY(Q4));
cout << "Q4: (" << findminofX(Q4) << ", " << findminofY(Q4) << ") (" << findmaxofX(Q4) << ", " << findmaxofY(Q4) << ") " << Q4area << endl;
} else {
cout << "No point in any quadrant" << endl;
}
} |
# 2069454, 2024-11-02 10:48:29, xx-x-x--x- (0%)
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <utility>
#include <algorithm>
#include <cmath>
#include <string>
using namespace std;
int main(){
double n,x,y,a,b;
cin>>n;
vector<pair<int,int>> q1;
vector<pair<int,int>> q2;
vector<pair<int,int>> q3;
vector<pair<int,int>> q4;
vector<pair<int,int>> last;
while(n--){
cin>>x>>y;
if(x > 0 && y > 0){
q1.push_back({x,y});
}else if(x < 0 && y > 0){
q2.push_back({x,y});
}else if(x < 0 && y < 0){
q3.push_back({x,y});
}else if(x > 0 && y < 0){
q4.push_back({x,y});
}
}
x=0; y=0;
x = q1[0].first; y = q1[0].second;
a = q1[0].first; b = q1[0].second;
for(int i =1;i< q1.size();i++){
if(q1[i].first < x ){
x = q1[i].first;
}
if(q1[i].second < y){
y = q1[i].second;
}
if(q1[i].first> a){
a = q1[i].first;
}
if(q1[i].second> b){
b = q1[i].second;
}
}
last.push_back({x,y});
last.push_back({a,b});
vector<int> result;
int rx,ry ;
rx = x -a;
ry = y -b;
result.push_back(rx*ry);
// x = q2[0].first;
// y = q2[0].second;
// a = q2[0].first;
// b = q2[0].second;
// for(int i =1;i< q2.size();i++){
// if(q2[i].first < x ){
// x = q2[i].first;
// }
// if(q2[i].second < y){
// y = q2[i].second;
// }
// if(q2[i].first> a){
// a = q2[i].first;
// }
// if(q2[i].second> b){
// b = q2[i].second;
// }
// }
cout<<q2[0].first<<q2[0].second<<endl;
} | # 2070372, 2024-11-02 12:05:50, xxxx-x--x- (0%)
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <utility>
#include <algorithm>
#include <cmath>
#include <string>
using namespace std;
int main(){
double n,x,y,a,b;
cin>>n;
vector<pair<int,int>> q1;
vector<pair<int,int>> q2;
vector<pair<int,int>> q3;
vector<pair<int,int>> q4;
vector<pair<int,int>> last;
while(n--){
cin>>x>>y;
if(x > 0 && y > 0){
q1.push_back({x,y});
}else if(x < 0 && y > 0){
q2.push_back({x,y});
}else if(x < 0 && y < 0){
q3.push_back({x,y});
}else if(x > 0 && y < 0){
q4.push_back({x,y});
}
}
x=0; y=0;
x = q1[0].first;
y = q1[0].second;
a = q1[0].first;
b = q1[0].second;
for(int i =1;i< q1.size();i++){
if(q1[i].first < x ){
x = q1[i].first;
}
if(q1[i].second < y){
y = q1[i].second;
}
if(q1[i].first> a){
a = q1[i].first;
}
if(q1[i].second> b){
b = q1[i].second;
}
}
last.push_back({x,y});
last.push_back({a,b});
vector<int> result;
int rx,ry ;
rx = x -a;
ry = y -b;
result.push_back(rx*ry);
x = q2[0].first;
y = q2[0].second;
a= q2[0].first;
b= q2[0].second;
for (size_t i = 1; i < q2.size(); i++)
{
if(q2[i].first < x ){
x = q2[i].first;
}
if(q2[i].second < y){
y = q2[i].second;
}
if(q2[i].first> a){
a = q2[i].first;
}
if(q2[i].second> b){
b = q2[i].second;
}
}
last.push_back({x,y});
last.push_back({a,b});
rx = x -a;
ry = y -b;
result.push_back(rx*ry);
x = q3[0].first;
y = q3[0].second;
a= q3[0].first;
b= q3[0].second;
for (size_t i = 1; i < q3.size(); i++)
{
if(q3[i].first < x ){
x = q3[i].first;
}
if(q3[i].second < y){
y = q3[i].second;
}
if(q3[i].first> a){
a = q3[i].first;
}
if(q3[i].second> b){
b = q3[i].second;
}
}
last.push_back({x,y});
last.push_back({a,b});
rx = x -a;
ry = y -b;
result.push_back(rx*ry);
x = q4[0].first;
y = q4[0].second;
a= q4[0].first;
b= q4[0].second;
for (size_t i = 1; i < q4.size(); i++)
{
if(q4[i].first < x ){
x = q4[i].first;
}
if(q4[i].second < y){
y = q4[i].second;
}
if(q4[i].first> a){
a = q4[i].first;
}
if(q4[i].second> b){
b = q4[i].second;
}
}
last.push_back({x,y});
last.push_back({a,b});
rx = x -a;
ry = y -b;
result.push_back(rx*ry);
if(last.empty()){
cout<<"No point in any quadrant";
}else{
cout<<"Q1 : ("<<last[0].first<<", "<<last[0].second<<")"<<" ("<<last[1].first<<", "<<last[1].second<<") "<<result[0]<<endl;
cout<<"Q2 : ("<<last[2].first<<", "<<last[2].second<<")"<<" ("<<last[3].first<<", "<<last[3].second<<") "<<result[1]<<endl;
cout<<"Q3 : ("<<last[4].first<<", "<<last[4].second<<")"<<" ("<<last[5].first<<", "<<last[5].second<<") "<<result[2]<<endl;
cout<<"Q4 : ("<<last[6].first<<", "<<last[6].second<<")"<<" ("<<last[7].first<<", "<<last[7].second<<") "<<result[3]<<endl;
}
} | # 2070493, 2024-11-02 12:10:32, -----P---- (10%)
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <utility>
#include <algorithm>
#include <cmath>
#include <string>
using namespace std;
int main(){
cout<<"No point in any quadrant";
} | # 2070513, 2024-11-02 12:10:58, xxxx-x--x- (0%)
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <utility>
#include <algorithm>
#include <cmath>
#include <string>
using namespace std;
int main(){
double n,x,y,a,b;
cin>>n;
vector<pair<int,int>> q1;
vector<pair<int,int>> q2;
vector<pair<int,int>> q3;
vector<pair<int,int>> q4;
vector<pair<int,int>> last;
while(n--){
cin>>x>>y;
if(x > 0 && y > 0){
q1.push_back({x,y});
}else if(x < 0 && y > 0){
q2.push_back({x,y});
}else if(x < 0 && y < 0){
q3.push_back({x,y});
}else if(x > 0 && y < 0){
q4.push_back({x,y});
}
}
x=0; y=0;
x = q1[0].first;
y = q1[0].second;
a = q1[0].first;
b = q1[0].second;
for(int i =1;i< int(q1.size());i++){
if(q1[i].first < x ){
x = q1[i].first;
}
if(q1[i].second < y){
y = q1[i].second;
}
if(q1[i].first> a){
a = q1[i].first;
}
if(q1[i].second> b){
b = q1[i].second;
}
}
last.push_back({x,y});
last.push_back({a,b});
vector<int> result;
int rx,ry ;
rx = x -a;
ry = y -b;
result.push_back(rx*ry);
x = q2[0].first;
y = q2[0].second;
a= q2[0].first;
b= q2[0].second;
for (size_t i = 1; i < q2.size(); i++)
{
if(q2[i].first < x ){
x = q2[i].first;
}
if(q2[i].second < y){
y = q2[i].second;
}
if(q2[i].first> a){
a = q2[i].first;
}
if(q2[i].second> b){
b = q2[i].second;
}
}
last.push_back({x,y});
last.push_back({a,b});
rx = x -a;
ry = y -b;
result.push_back(rx*ry);
x = q3[0].first;
y = q3[0].second;
a= q3[0].first;
b= q3[0].second;
for (size_t i = 1; i < q3.size(); i++)
{
if(q3[i].first < x ){
x = q3[i].first;
}
if(q3[i].second < y){
y = q3[i].second;
}
if(q3[i].first> a){
a = q3[i].first;
}
if(q3[i].second> b){
b = q3[i].second;
}
}
last.push_back({x,y});
last.push_back({a,b});
rx = x -a;
ry = y -b;
result.push_back(rx*ry);
x = q4[0].first;
y = q4[0].second;
a= q4[0].first;
b= q4[0].second;
for (size_t i = 1; i < q4.size(); i++)
{
if(q4[i].first < x ){
x = q4[i].first;
}
if(q4[i].second < y){
y = q4[i].second;
}
if(q4[i].first> a){
a = q4[i].first;
}
if(q4[i].second> b){
b = q4[i].second;
}
}
last.push_back({x,y});
last.push_back({a,b});
rx = x -a;
ry = y -b;
result.push_back(rx*ry);
if(last.empty()){
cout<<"No point in any quadrant";
}else{
cout<<"Q1 : ("<<last[0].first<<", "<<last[0].second<<")"<<" ("<<last[1].first<<", "<<last[1].second<<") "<<result[0]<<endl;
cout<<"Q2 : ("<<last[2].first<<", "<<last[2].second<<")"<<" ("<<last[3].first<<", "<<last[3].second<<") "<<result[1]<<endl;
cout<<"Q3 : ("<<last[4].first<<", "<<last[4].second<<")"<<" ("<<last[5].first<<", "<<last[5].second<<") "<<result[2]<<endl;
cout<<"Q4 : ("<<last[6].first<<", "<<last[6].second<<")"<<" ("<<last[7].first<<", "<<last[7].second<<") "<<result[3]<<endl;
}
} |
# 2071181, 2024-11-02 14:05:30, -----P---- (10%)
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <utility>
using namespace std;
int main(){
int n;
cin >> n;
map <int, vector<int>> input;
cin.ignore();
map <int, vector<int>> q1,q2,q3,q4;
int x,y;
while(n--){
cin >> x >> y;
input[x].push_back(y);
}
//cout << "fini: " << endl;
int i = 0;
for(auto c : input){
for(auto e : c.second){
if(c.first > 0 && e > 0){
q1[c.first].push_back(e); // ++
i++;
if(i == 3) {
i = 0;
break;
}
}
else if(c.first < 0 && e > 0){ // -+
q2[c.first].push_back(e);
i++;
if(i == 3) {
i = 0;
break;
}
}
else if(c.first < 0 && e < 0){ // --
q3[c.first].push_back(e);
i++;
if(i == 3) {
i = 0;
break;
}
}
else if(c.first > 0 && e < 0){ // +-
q4[c.first].push_back(e);
i++;
if(i == 3) {
i = 0;
break;
}
}
}
}
if(q1.empty() && q2.empty() && q3.empty() && q4.empty() ){
cout << "No point in any quadrant";
}else{
cout << "Q1: ";
for(auto e : q1) {
for(auto k : e.second){
cout << e.first << k << " ";
}
}
cout << endl;
cout << "Q2: ";
for(auto e : q2) {
for(auto k : e.second){
cout << e.first << k << " ";
}
}
cout << endl;
cout << "Q3: ";
for(auto e : q3) {
for(auto k : e.second){
cout << e.first << k << " ";
}
}
cout << endl;
cout << "Q4: ";
for(auto e : q4) {
for(auto k : e.second){
cout << e.first << k << " ";
}
}
cout << endl;
}
} | # 2071267, 2024-11-02 14:15:43, -----P---- (10%)
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <utility>
using namespace std;
int main(){
int n;
cin >> n;
map <int, vector<int>> input;
cin.ignore();
map <int, vector<int>> q1,q2,q3,q4;
int x,y;
while(n--){
cin >> x >> y;
input[x].push_back(y);
}
//cout << "fini: " << endl;
int i = 0;
for(auto c : input){
for(auto e : c.second){
if(c.first > 0 && e > 0){
q1[c.first].push_back(e); // ++
i++;
if(i == 3) {
i = 0;
break;
}
}
else if(c.first < 0 && e > 0){ // -+
q2[c.first].push_back(e);
i++;
if(i == 3) {
i = 0;
break;
}
}
else if(c.first < 0 && e < 0){ // --
q3[c.first].push_back(e);
i++;
if(i == 3) {
i = 0;
break;
}
}
else if(c.first > 0 && e < 0){ // +-
q4[c.first].push_back(e);
i++;
if(i == 3) {
i = 0;
break;
}
}
}
}
if(q1.empty() && q2.empty() && q3.empty() && q4.empty() ){
cout << "No point in any quadrant";
}else{
if(!q1.empty()){
cout << "Q1: ";
for(auto e : q1) {
for(auto k : e.second){
cout << "(" << e.first << ", "<< k << ") ";
}
}
if(q1.size() == 1){
cout << "0";
}else{
}
cout << endl;
}
if(!q2.empty()){
cout << "Q2: ";
for(auto e : q2) {
for(auto k : e.second){
cout << "(" << e.first << ", "<< k << ") ";
}
}
if(q2.size() == 1){
cout << "0";
}else{
}
cout << endl;
}
if(!q3.empty()){
cout << "Q3: ";
for(auto e : q3) {
for(auto k : e.second){
cout << "(" << e.first << ", "<< k << ") ";
}
}
if(q3.size() == 1){
cout << "0";
}else{
}
cout << endl;
}
if(!q4.empty()){
cout << "Q4: ";
for(auto e : q4) {
for(auto k : e.second){
cout << "(" << e.first << ","<< k << ") ";
}
}
if(q4.size() == 1){
cout << "0";
}else{
}
cout << endl;
}
}
} | # 2071351, 2024-11-02 14:25:29, -----P---- (10%)
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <utility>
using namespace std;
int main(){
int n;
cin >> n;
map <int, vector<int>> input;
cin.ignore();
map <int, vector<int>> q1,q2,q3,q4;
vector <int> cal1 , cal2, cal3, cal4;
int x,y;
while(n--){
cin >> x >> y;
input[x].push_back(y);
}
//cout << "fini: " << endl;
int i = 0;
for(auto c : input){
for(auto e : c.second){
if(c.first > 0 && e > 0){
q1[c.first].push_back(e); // ++
i++;
if(i == 3) {
i = 0;
break;
}
}
else if(c.first < 0 && e > 0){ // -+
q2[c.first].push_back(e);
i++;
if(i == 3) {
i = 0;
break;
}
}
else if(c.first < 0 && e < 0){ // --
q3[c.first].push_back(e);
i++;
if(i == 3) {
i = 0;
break;
}
}
else if(c.first > 0 && e < 0){ // +-
q4[c.first].push_back(e);
i++;
if(i == 3) {
i = 0;
break;
}
}
}
}
if(q1.empty() && q2.empty() && q3.empty() && q4.empty() ){
cout << "No point in any quadrant";
}else{
if(!q1.empty()){
cout << "Q1: ";
for(auto e : q1) {
for(auto k : e.second){
cout << "(" << e.first << ", "<< k << ") ";
cal1.push_back(e.first);
cal1.push_back(k);
}
}
if(q1.size() == 1){
cout << "0";
}else{
int q = (cal1[2] - cal1[0]) * (cal1[3] - cal1[1]);
cout << q;
}
cout << endl;
}
if(!q2.empty()){
cout << "Q2: ";
for(auto e : q2) {
for(auto k : e.second){
cout << "(" << e.first << ", "<< k << ") ";
cal2.push_back(e.first);
cal2.push_back(k);
}
}
if(q2.size() == 1){
cout << "0";
}else{
int q = (cal2[2] - cal2[0]) * (cal2[3] - cal2[1]);
cout << q;
}
cout << endl;
}
if(!q3.empty()){
cout << "Q3: ";
for(auto e : q3) {
for(auto k : e.second){
cout << "(" << e.first << ", "<< k << ") ";
cal3.push_back(e.first);
cal3.push_back(k);
}
}
if(q3.size() == 1){
cout << "0";
}else{
int q = (cal3[2] - cal3[0]) * (cal3[3] - cal3[1]);
cout << q;
}
cout << endl;
}
if(!q4.empty()){
cout << "Q4: ";
for(auto e : q4) {
for(auto k : e.second){
cout << "(" << e.first << ","<< k << ") ";
cal4.push_back(e.first);
cal4.push_back(k);
}
}
if(q4.size() == 1){
cout << "0";
}else{
int q = (cal4[2] - cal4[0]) * (cal4[3] - cal4[1]);
cout << q;
}
cout << endl;
}
}
} | # 2071466, 2024-11-02 14:38:13, -----P---- (10%)
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <utility>
using namespace std;
int main(){
int n;
cin >> n;
map <int, vector<int>> input;
cin.ignore();
map <int, vector<int>> q1,q2,q3,q4;
vector <int> cal1 , cal2, cal3, cal4;
int x,y;
while(n--){
cin >> x >> y;
input[x].push_back(y);
}
//cout << "fini: " << endl;
int i = 0;
for(auto c : input){
for(auto e : c.second){
if(c.first > 0 && e > 0){
q1[c.first].push_back(e); // ++
i++;
cout << "\\\\" << q1.size() << " ";
if(i > 1) {
break;
}
}
else if(c.first < 0 && e > 0){ // -+
q2[c.first].push_back(e);
i++;
//cout << "\\\\" << q2.size() << " ";
if(i == 2) {
break;
}
}
else if(c.first < 0 && e < 0){ // --
q3[c.first].push_back(e);
i++;
//cout << "\\\\" << q3.size() << " ";
if(q3.size() > 2) {
break;
}
}
else if(c.first > 0 && e < 0){ // +-
q4[c.first].push_back(e);
i++;
//cout << "\\\\" << q4.size() << " ";
if(q4.size() > 2) {
break;
}
}
}
}
if(q1.empty() && q2.empty() && q3.empty() && q4.empty() ){
cout << "No point in any quadrant";
}else{
if(!q1.empty()){
cout << "Q1: ";
for(auto e : q1) {
for(auto k : e.second){
cout << "(" << e.first << ", "<< k << ") ";
cal1.push_back(e.first);
cal1.push_back(k);
}
}
if(q1.size() == 1){
cout << "0";
}else{
int q = (cal1[2] - cal1[0]) * (cal1[3] - cal1[1]);
cout << q;
}
cout << endl;
}
if(!q2.empty()){
cout << "Q2: ";
for(auto e : q2) {
for(auto k : e.second){
cout << "(" << e.first << ", "<< k << ") ";
cal2.push_back(e.first);
cal2.push_back(k);
}
}
if(q2.size() == 1){
cout << "0";
}else{
int q = (cal2[2] - cal2[0]) * (cal2[3] - cal2[1]);
cout << q;
}
cout << endl;
}
if(!q3.empty()){
cout << "Q3: ";
for(auto e : q3) {
for(auto k : e.second){
cout << "(" << e.first << ", "<< k << ") ";
cal3.push_back(e.first);
cal3.push_back(k);
}
}
if(q3.size() == 1){
cout << "0";
}else{
int q = (cal3[2] - cal3[0]) * (cal3[3] - cal3[1]);
cout << q;
}
cout << endl;
}
if(!q4.empty()){
cout << "Q4: ";
for(auto e : q4) {
for(auto k : e.second){
cout << "(" << e.first << ","<< k << ") ";
cal4.push_back(e.first);
cal4.push_back(k);
}
}
if(q4.size() == 1){
cout << "0";
}else{
int q = (cal4[2] - cal4[0]) * (cal4[3] - cal4[1]);
cout << q;
}
cout << endl;
}
}
} |
# 2071502, 2024-11-02 14:42:47, -----P---- (10%)
#include<bits/stdc++.h>
using namespace std;
int main(){
cout << "No point in any quadrant";
} | # 2071967, 2024-11-02 15:30:14, ---------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
int x,y;
cin >> n;
map<int,int> m;
while(n--){
cin >> x >> y;
m[x] = y;
// m[x].insert(y);
if(x > 0 && y > 0){
cout << "Q1: " << "(" << x << ", " << y << ") 0" ;
} else if(x > 0 && y < 0){
cout << "Q4: " << "(" << x << ", " << y << ") 0" ;
} else if(x < 0 && y < 0){
cout << "Q3: " << "(" << x << ", " << y << ") 0" ;
} else if(x < 0 && y < 0){
cout << "Q2: " << "(" << x << ", " << y << ") 0" ;
} else {
cout << "No point in any quadrant";
}
}
} |
# 2071055, 2024-11-02 13:49:37, -----P---- (10%)
#include <bits/stdc++.h>
using namespace std;
int main () {
int n,a,b;
vector <int> x;
vector <int> y;
cin >> n;
for(int i = 0; i < n; i++){
cin >> a >> b;
x.push_back(a);
x.push_back(b);
auto itr = find(x.begin(), x.end(), 0);
if(itr != x.end()) x.erase(itr);
auto its = find(y.begin(), y.end(), 0);
if(its != y.end()) y.erase(its);
}
if (x.empty() || y.empty()) cout<< "No point in any quadrant";
} | # 2071605, 2024-11-02 14:54:19, xxxxxxxxxx (0%)
#include <bits/stdc++.h>
#include <algorithm>
using namespace std;
int main () {
int n,a,b;
vector <int> x1, x2, x3, x4;
vector <int> y1, y2, y3, y4;
auto it1 = minmax_element(x1.begin(), x1.end());
auto it2 = minmax_element(x2.begin(), x2.end());
auto it3 = minmax_element(x3.begin(), x3.end());
auto it4 = minmax_element(x4.begin(), x4.end());
auto at1 = minmax_element(y1.begin(), y1.end());
auto at2 = minmax_element(y2.begin(), y2.end());
auto at3 = minmax_element(y3.begin(), y3.end());
auto at4 = minmax_element(y4.begin(), y4.end());
cin >> n;
for(int i = 0; i < n; i++){
cin >> a >> b;
if (a > 0 && b > 0) {
x1.push_back(a);
y1.push_back(b);
}
else if (a > 0 && b < 0) {
x2.push_back(a);
y2.push_back(b);
}
else if (a < 0 && b > 0) {
x3.push_back(a);
y3.push_back(b);
}
else if (a < 0 && b < 0) {
x4.push_back(a);
y4.push_back(b);
}
sort(x1.begin(), x1.end());
sort(y1.begin(), y1.end());
sort(x2.begin(), x2.end());
sort(y2.begin(), y2.end());
sort(x3.begin(), x3.end());
sort(y3.begin(), y3.end());
sort(x4.begin(), x4.end());
sort(y4.begin(), y4.end());
}
// if ( (x1.empty() || y1.empty()) && (x2.empty() || y2.empty()) && (x3.empty() || y3.empty()) && (x4.empty() || y4.empty()) ) cout<< "No point in any quadrant";
cout << "Q1: (" << *it1.first << ", " << *at1.first << ") " << "(" << *it1.second << ", " << *at1.second << ") " << (it1.second - it1.first) * (at1.second - at1.first);
cout << "Q2: (" << *it2.first << ", " << *at2.first << ") " << "(" << *it2.second << ", " << *at2.second << ") " << (it2.second - it2.first) * (at2.second - at2.first);
cout << "Q3: (" << *it3.first << ", " << *at3.first << ") " << "(" << *it3.second << ", " << *at3.second << ") " << (it3.second - it3.first) * (at3.second - at3.first);
cout << "Q4: (" << *it4.first << ", " << *at4.first << ") " << "(" << *it4.second << ", " << *at4.second << ") " << (it4.second - it4.first) * (at4.second - at4.first);
} |
# 2070442, 2024-11-02 12:08:42, ---x-P--x- (10%)
#include <bits/stdc++.h>
using namespace std;
int main()
{
vector<pair<int, int>> q1;
vector<pair<int, int>> q2;
vector<pair<int, int>> q3;
vector<pair<int, int>> q4;
vector<pair<int, int>> q1_2;
vector<pair<int, int>> q2_2;
vector<pair<int, int>> q3_2;
vector<pair<int, int>> q4_2;
map<string,int>j;
int n = 0;
int x = 0, y = 0, minx = 0, maxx = 0, miny = 0, maxy = 0;
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> x >> y;
if (x != 0 && y != 0)
{
if (x > 0 && y > 0)
{
q1.push_back(make_pair(x, y));
}
if (x < 0 && y > 0)
{
q2.push_back(make_pair(x, y));
}
if (x < 0 && y < 0)
{
q3.push_back(make_pair(x, y));
}
if (x > 0 && y < 0)
{
q4.push_back(make_pair(x, y));
}
}
}
if (q1.size() != 0)
{
for (auto e : q1)
{
if (e.first < minx)
minx = e.first;
if (e.first > maxx)
maxx = e.second;
if (e.second < miny)
miny = e.second;
if (e.second > maxy)
maxy = e.second;
}
q1_2.push_back(make_pair(minx, miny));
q1_2.push_back(make_pair(maxx, maxy));
int minx = 0, maxx = 0, miny = 0, maxy = 0;
}
if (q2.size() != 0)
{
for (auto e : q1)
{
if (e.first < minx)
minx = e.first;
if (e.first > maxx)
maxx = e.second;
if (e.second < miny)
miny = e.second;
if (e.second > maxy)
maxy = e.second;
}
q2_2.push_back(make_pair(minx, miny));
q2_2.push_back(make_pair(maxx, maxy));
int minx = 0, maxx = 0, miny = 0, maxy = 0;
}
if (q3.size() != 0)
{
for (auto e : q1)
{
if (e.first < minx)
minx = e.first;
if (e.first > maxx)
maxx = e.second;
if (e.second < miny)
miny = e.second;
if (e.second > maxy)
maxy = e.second;
}
q3_2.push_back(make_pair(minx, miny));
q3_2.push_back(make_pair(maxx, maxy));
int minx = 0, maxx = 0, miny = 0, maxy = 0;
}
if (q4.size() != 0)
{
for (auto e : q1)
{
if (e.first < minx)
minx = e.first;
if (e.first > maxx)
maxx = e.second;
if (e.second < miny)
miny = e.second;
if (e.second > maxy)
maxy = e.second;
}
q4_2.push_back(make_pair(minx, miny));
q4_2.push_back(make_pair(maxx, maxy));
int minx = 0, maxx = 0, miny = 0, maxy = 0;
}
q1.empty();
q2.empty();
q3.empty();
q4.empty();
if (q1.size() != 0)
{
int sum_x = abs(q1_2[0].first) - abs(q1_2[1].first);
int sum_y = abs(q1_2[0].second) - abs(q1_2[1].second);
int sum = sum_x * sum_y;
j["Q1"]=sum;
cout << "Q1:"<<" ("<<q1_2[0].first<< ','<<q1_2[0].second<<" "<< "("<<q1_2[1].first<<q1_2[1].second<<")"<<" "<<sum;
}
if (q2.size() != 0)
{
int sum_x = abs(q2_2[0].first) - abs(q2_2[1].first);
int sum_y = abs(q2_2[0].second) - abs(q2_2[1].second);
int sum = sum_x * sum_y;
j["Q2"]=sum;
cout << "Q2:"<<" ("<<q2_2[0].first<< ','<<q2_2[0].second<<" "<< "("<<q2_2[1].first<<q2_2[1].second<<")"<<" "<<sum;
}
if (q3.size() != 0)
{
int sum_x = abs(q3_2[0].first) - abs(q1_2[1].first);
int sum_y = abs(q3_2[0].second) - abs(q1_2[1].second);
int sum = sum_x * sum_y;
j["Q3"]=sum;
cout << "Q3:"<<" ("<<q3_2[0].first<< ','<<q3_2[0].second<<" "<< "("<<q3_2[1].first<<q3_2[1].second<<")"<<" "<<sum;
}
if (q4.size() != 0)
{
int sum_x = abs(q4_2[0].first) - abs(q1_2[1].first);
int sum_y = abs(q4_2[0].second) - abs(q1_2[1].second);
int sum = sum_x * sum_y;
j["Q4"]=sum;
cout << "Q4:"<<" ("<<q4_2[0].first<< ','<<q4_2[0].second<<" "<< "("<<q4_2[1].first<<q4_2[1].second<<")"<<" "<<sum;
}
else
{
cout <<"No point in any quadrant";
}
} | # 2070486, 2024-11-02 12:10:18, ---x-P--x- (10%)
#include <bits/stdc++.h>
using namespace std;
int main()
{
vector<pair<int, int>> q1;
vector<pair<int, int>> q2;
vector<pair<int, int>> q3;
vector<pair<int, int>> q4;
vector<pair<int, int>> q1_2;
vector<pair<int, int>> q2_2;
vector<pair<int, int>> q3_2;
vector<pair<int, int>> q4_2;
map<string,int>j;
int n = 0;
int x = 0, y = 0, minx = 0, maxx = 0, miny = 0, maxy = 0;
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> x >> y;
if (x != 0 && y != 0)
{
if (x > 0 && y > 0)
{
q1.push_back(make_pair(x, y));
}
if (x < 0 && y > 0)
{
q2.push_back(make_pair(x, y));
}
if (x < 0 && y < 0)
{
q3.push_back(make_pair(x, y));
}
if (x > 0 && y < 0)
{
q4.push_back(make_pair(x, y));
}
}
}
if (q1.size() != 0)
{
for (auto &e : q1)
{
if (e.first < minx)
minx = e.first;
if (e.first > maxx)
maxx = e.second;
if (e.second < miny)
miny = e.second;
if (e.second > maxy)
maxy = e.second;
}
q1_2.push_back(make_pair(minx, miny));
q1_2.push_back(make_pair(maxx, maxy));
int minx = 0, maxx = 0, miny = 0, maxy = 0;
}
if (q2.size() != 0)
{
for (auto &e : q2)
{
if (e.first < minx)
minx = e.first;
if (e.first > maxx)
maxx = e.second;
if (e.second < miny)
miny = e.second;
if (e.second > maxy)
maxy = e.second;
}
q2_2.push_back(make_pair(minx, miny));
q2_2.push_back(make_pair(maxx, maxy));
int minx = 0, maxx = 0, miny = 0, maxy = 0;
}
if (q3.size() != 0)
{
for (auto &e : q3)
{
if (e.first < minx)
minx = e.first;
if (e.first > maxx)
maxx = e.second;
if (e.second < miny)
miny = e.second;
if (e.second > maxy)
maxy = e.second;
}
q3_2.push_back(make_pair(minx, miny));
q3_2.push_back(make_pair(maxx, maxy));
int minx = 0, maxx = 0, miny = 0, maxy = 0;
}
if (q4.size() != 0)
{
for (auto &e : q4)
{
if (e.first < minx)
minx = e.first;
if (e.first > maxx)
maxx = e.second;
if (e.second < miny)
miny = e.second;
if (e.second > maxy)
maxy = e.second;
}
q4_2.push_back(make_pair(minx, miny));
q4_2.push_back(make_pair(maxx, maxy));
int minx = 0, maxx = 0, miny = 0, maxy = 0;
}
q1.empty();
q2.empty();
q3.empty();
q4.empty();
if (q1.size() != 0)
{
int sum_x = abs(q1_2[0].first) - abs(q1_2[1].first);
int sum_y = abs(q1_2[0].second) - abs(q1_2[1].second);
int sum = sum_x * sum_y;
j["Q1"]=sum;
cout << "Q1:"<<" ("<<q1_2[0].first<< ','<<q1_2[0].second<<" "<< "("<<q1_2[1].first<<q1_2[1].second<<")"<<" "<<sum;
}
if (q2.size() != 0)
{
int sum_x = abs(q2_2[0].first) - abs(q2_2[1].first);
int sum_y = abs(q2_2[0].second) - abs(q2_2[1].second);
int sum = sum_x * sum_y;
j["Q2"]=sum;
cout << "Q2:"<<" ("<<q2_2[0].first<< ','<<q2_2[0].second<<" "<< "("<<q2_2[1].first<<q2_2[1].second<<")"<<" "<<sum;
}
if (q3.size() != 0)
{
int sum_x = abs(q3_2[0].first) - abs(q1_2[1].first);
int sum_y = abs(q3_2[0].second) - abs(q1_2[1].second);
int sum = sum_x * sum_y;
j["Q3"]=sum;
cout << "Q3:"<<" ("<<q3_2[0].first<< ','<<q3_2[0].second<<" "<< "("<<q3_2[1].first<<q3_2[1].second<<")"<<" "<<sum;
}
if (q4.size() != 0)
{
int sum_x = abs(q4_2[0].first) - abs(q1_2[1].first);
int sum_y = abs(q4_2[0].second) - abs(q1_2[1].second);
int sum = sum_x * sum_y;
j["Q4"]=sum;
cout << "Q4:"<<" ("<<q4_2[0].first<< ','<<q4_2[0].second<<" "<< "("<<q4_2[1].first<<q4_2[1].second<<")"<<" "<<sum;
}
else
{
cout <<"No point in any quadrant";
}
} |
# 2071239, 2024-11-02 14:11:55, -----P---- (10%)
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
int x[10000],y[1000];
cin>>n;
vector<pair<int,int>> Q1;
vector<pair<int,int>> Q2;
vector<pair<int,int>> Q3;
vector<pair<int,int>> Q4;
for(int i=0;i<n;i++){
cin>>x[i]>>y[i];
}
cout<<"No point in any quadrant";
} |
# 2071928, 2024-11-02 15:28:34, -----P---- (10%)
#include <iostream>
#include <vector>
#include <map>
using namespace std;
int main() {
int n;
cin >> n;
int x,y;
vector<int> bl;
vector<int> tr;
cout << "No point in any quadrant";
} |
# 2071572, 2024-11-02 14:50:10, -----P---- (10%)
#include <iostream>
using namespace std;
int main() {
int n , x , y ; cin >> n ;
while (n--) {
cin >> x >> y ;
if (x == 0 || y == 0) {
cout << "No point in any quadrant" ;
break ;
}
}
} |
# 2069216, 2024-11-02 10:26:49, -----P---- (10%)
#include <iostream>
#include <map>
#include <set>
#include <vector>
#include <cmath>
using namespace std;
int main(){
int n,num1,num2,maxX =0 ,maxY=0,minX=0,minY=0;
cin >> n;
vector <pair<long long,long long> > point ;
vector <int> lol;
map< string ,set<pair<int,int>>> keepans = {{"Q1:", {}},{"Q2:", {}},{"Q3:", {}},{"Q4:", {}}};
for(int j =0 ; j < n; j++){
cin >> num1 >> num2;
point.push_back(make_pair(num1,num2));
}
bool found = true;
for(auto &m : point){
if(m.first > 0 && m.second > 0){
if(maxX < m.first) maxX = m.first;
if(minX > m.first) minX = m.first;
if(maxY < m.first) maxY = m.second;
if(minY > m.first) minY = m.second;
keepans["Q1:"].insert(make_pair(maxX,maxY));
keepans["Q1:"].insert(make_pair(minX,minY));
int mul = (maxX - minX) * (maxY - minY);
lol.push_back(mul);
}
else if(m.first < 0 && m.second > 0){
maxX =0 ;
maxY=0;
minX=0;
minY=0;
if(maxX < m.first) maxX = m.first;
if(minX > m.first) minX = m.first;
if(maxY < m.first) maxY = m.second;
if(minY > m.first) minY = m.second;
keepans["Q2:"].insert(make_pair(maxX,maxY));
keepans["Q2:"].insert(make_pair(minX,minY));
int mul = (maxX - minX) * (maxY - minY);
lol.push_back(mul);
}else if(m.first < 0 && m.second < 0){
maxX =0 ;
maxY=0;
minX=0;
minY=0;
if(maxX < m.first) maxX = m.first;
if(minX > m.first) minX = m.first;
if(maxY < m.first) maxY = m.second;
if(minY > m.first) minY = m.second;
keepans["Q3:"].insert(make_pair(maxX,maxY));
keepans["Q3:"].insert(make_pair(minX,minY));
int mul = (maxX - minX) * (maxY - minY);
lol.push_back(mul);
}else if(m.first > 0 && m.second < 0){
maxX =0 ;
maxY=0;
minX=0;
minY=0;
if(maxX < m.first) maxX = m.first;
if(minX > m.first) minX = m.first;
if(maxY < m.first) maxY = m.second;
if(minY > m.first) minY = m.second;
keepans["Q4:"].insert(make_pair(maxX,maxY));
keepans["Q4:"].insert(make_pair(minX,minY));
int mul = (maxX - minX) * (maxY - minY);
lol.push_back(mul);
}else{
found = false;
break;
}
}
if(!found){ cout << "No point in any quadrant";}
else{
for(auto a : keepans){
int j = 0;
if(a.second.empty()) continue;
cout << a.first << " " ;
for(auto b: a.second){
cout << '(' << b.first << ',' << " " << b.second << ')' << " " << lol[j];
j++;
}
cout << endl;
}
}
} |
# 2069336, 2024-11-02 10:37:36, -----P---- (10%)
#include <iostream>
#include <set>
#include <map>
#include <vector>
#include <algorithm>
using namespace std;
long long fac(int n) {
if(n>=1) {
return 1;
}
return n*fac(n-1);
}
int main() {
int n;
cin >> n;
for(int i = 0;i < n;i++) {
int a,b;
cin >> a >> b;
}
cout << "No point in any quadrant";
} |
# 2071287, 2024-11-02 14:19:02, -----P---- (10%)
#include <bits/stdc++.h>
using namespace std;
int main(){
vector<pair<float,float>> kp;
float x,y;
int n;
cin >> n;
while(n--){
cin >> x >> y;
kp.push_back(make_pair(x,y));
}
cout << "No point in any quadrant";
} |
# 2070022, 2024-11-02 11:45:25, -----P---- (10%)
#include<iostream>
#include<vector>
#include<map>
using namespace std;
int n, x, y;
vector<int> vx;
vector<int> vy;
map<vector<int>, vector<int>> mp;
int main(){
cin >> n;
while(n--){
cin >> x >> y;
vx.push_back(x);
vy.push_back(y);
mp[vx] = vy;
}
// for(auto e : mp){
// for(auto y : e.first){
// cout << y << " ";
// for(auto x : e.second){
// cout << x;
// }
// }
// cout << endl;
// }
cout << "No point in any quadrant" << endl;
} |
# 2071291, 2024-11-02 14:19:27, -----P---- (10%)
#include <iostream>
#include <map>
using namespace std;
int main(){
cout << "No point in any quadrant";
} |
# 2069316, 2024-11-02 10:35:59, -----P---- (10%)
/// 92
#include<bits/stdc++.h>
using namespace std;
int main(){
vector<pair<int, int>> q1, q2, q3, q4;
int n; cin >> n;
int x,y;
for(int i=0; i<n; i++){
cin >> x >> y;
if(x > 0 && y > 0){
q1.push_back({x,y});
}else if(x < 0 && y > 0){
q2.push_back({x,y});
}else if(x < 0 && y < 0){
q3.push_back({x,y});
}else if(x > 0 && y < 0){
q4.push_back({x,y});
}
}
if(q1.size() == 0 && q2.size() == 0 && q3.size() == 0 && q4.size() == 0){
cout << "No point in any quadrant";
}
return 0;
} |
# 2071609, 2024-11-02 14:54:32, Compilation error (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int x,y;
vector<pair<int,int>> coordinate,Q1,Q2,Q3,Q4;
for(int i=0;i<n;i++){
cin>>x>>y;
if(x>0&&y>0)Q1.push_back({x,y});
if(x<0&&y>0)Q2.push_back({x,y});
if(x<0&&y<0)Q3.push_back({x,y});
if(x>0&&y<0)Q4.push_back({x,y});
}
int minX[4],maxY[4];
for(int i=0;i<n;i++){
if(Q1[i].first < minX[0]) minX[0]=Q1[i].first;
if(Q2[i].first < minX[1]) minX[1]=Q2[i].first;
if(Q3[i].first < minX[2]) minX[2]=Q3[i].first;
if(Q4[i].first < minX[3]) minX[3]=Q4[i].first;
if(Q1[i].second < maxY[0]) maxY[0]=Q1[i].first;
if(Q2[i].second < maxY[1]) maxY[1]=Q2[i].first;
if(Q3[i].second < maxY[2]) maxY[2]=Q3[i].first;
if(Q4[i].second < maxY[3]) maxY[3]=Q4[i].first;
}
auto a1 = find(Q1.begin(),Q1.end(),minX[0]);
auto b1 = find(Q1.begin(),Q1.end(),maxY[0]);
cout << "("<<a1->first << ", "<<a1->second<<") ("<<b1->first<<", "<<b1->second<<") "<<abs(a1->first-b1->first)*abs(a1->second-b1->second);
auto a1 = find(Q2.begin(),Q2.end(),minX[1]);
auto b1 = find(Q2.begin(),Q2.end(),maxY[1]);
cout << "("<<a1->first << ", "<<a1->second<<") ("<<b1->first<<", "<<b1->second<<") "<<abs(a1->first-b1->first)*abs(a1->second-b1->second);
auto a1 = find(Q3.begin(),Q3.end(),minX[2]);
auto b1 = find(Q3.begin(),Q3.end(),maxY[2]);
cout << "("<<a1->first << ", "<<a1->second<<") ("<<b1->first<<", "<<b1->second<<") "<<abs(a1->first-b1->first)*abs(a1->second-b1->second);
auto a1 = find(Q4.begin(),Q4.end(),minX[3]);
auto b1 = find(Q4.begin(),Q4.end(),maxY[3]);
cout << "("<<a1->first << ", "<<a1->second<<") ("<<b1->first<<", "<<b1->second<<") "<<abs(a1->first-b1->first)*abs(a1->second-b1->second);
} | # 2071771, 2024-11-02 15:14:01, xxxx-x-xxx (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int x,y;
vector<pair<int,int>> coordinate,Q1,Q2,Q3,Q4;
for(int i=0;i<n;i++){
cin>>x>>y;
if(x>0&&y>0)Q1.push_back({x,y});
if(x<0&&y>0)Q2.push_back({x,y});
if(x<0&&y<0)Q3.push_back({x,y});
if(x>0&&y<0)Q4.push_back({x,y});
}
int minX[]={6500,6500,6500,6500},maxX[]={},minY[]={6500,6500,6500,6500},maxY[]={};
for(int i=0;i<n;i++){
if(Q1[i].first < minX[0]) minX[0]=Q1[i].first;
if(Q2[i].first < minX[1]) minX[1]=Q2[i].first;
if(Q3[i].first < minX[2]) minX[2]=Q3[i].first;
if(Q4[i].first < minX[3]) minX[3]=Q4[i].first;
if(Q1[i].first > maxX[0]) maxX[0]=Q1[i].first;
if(Q2[i].first > maxX[1]) maxX[1]=Q2[i].first;
if(Q3[i].first > maxX[2]) maxX[2]=Q3[i].first;
if(Q4[i].first > maxX[3]) maxX[3]=Q4[i].first;
if(Q1[i].second < minY[0]) minY[0]=Q1[i].second;
if(Q2[i].second < minY[1]) minY[0]=Q2[i].second;
if(Q3[i].second < minY[2]) minY[0]=Q3[i].second;
if(Q4[i].second < minY[3]) minY[0]=Q4[i].second;
if(Q1[i].second < maxY[0]) maxY[0]=Q1[i].second;
if(Q2[i].second < maxY[1]) maxY[1]=Q2[i].second;
if(Q3[i].second < maxY[2]) maxY[2]=Q3[i].second;
if(Q4[i].second < maxY[3]) maxY[3]=Q4[i].second;
}
cout << "Q1: ("<<minX[0]<<", "<<minY[0]<<") ("<<maxX[0]<<", "<<maxY[0]<<")"<< abs(maxX[0]-minX[0])*abs(maxY[0]-minY[0])<<endl;
cout << "Q2: ("<<minX[1]<<", "<<minY[1]<<") ("<<maxX[1]<<", "<<maxY[1]<<")"<< abs(maxX[1]-minX[1])*abs(maxY[1]-minY[1])<<endl;
cout << "Q3: ("<<minX[2]<<", "<<minY[2]<<") ("<<maxX[2]<<", "<<maxY[2]<<")"<< abs(maxX[2]-minX[2])*abs(maxY[2]-minY[2])<<endl;
cout << "Q4: ("<<minX[3]<<", "<<minY[3]<<") ("<<maxX[3]<<", "<<maxY[3]<<")"<< abs(maxX[3]-minX[3])*abs(maxY[3]-minY[3])<<endl;
} | # 2071816, 2024-11-02 15:18:43, xxxx-x--x- (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int x,y;
vector<pair<int,int>> coordinate,Q1,Q2,Q3,Q4;
for(int i=0;i<n;i++){
cin>>x>>y;
if(x>0&&y>0)Q1.push_back({x,y});
if(x<0&&y>0)Q2.push_back({x,y});
if(x<0&&y<0)Q3.push_back({x,y});
if(x>0&&y<0)Q4.push_back({x,y});
}
int minX[]={6500,6500,6500,6500},maxX[]={0,0,0,0},minY[]={6500,6500,6500,6500},maxY[]={0,0,0,0};
for(int i=0;i<n;i++){
if(Q1[i].first < minX[0]) minX[0]=Q1[i].first;
if(Q2[i].first < minX[1]) minX[1]=Q2[i].first;
if(Q3[i].first < minX[2]) minX[2]=Q3[i].first;
if(Q4[i].first < minX[3]) minX[3]=Q4[i].first;
if(Q1[i].first > maxX[0]) maxX[0]=Q1[i].first;
if(Q2[i].first > maxX[1]) maxX[1]=Q2[i].first;
if(Q3[i].first > maxX[2]) maxX[2]=Q3[i].first;
if(Q4[i].first > maxX[3]) maxX[3]=Q4[i].first;
if(Q1[i].second < minY[0]) minY[0]=Q1[i].second;
if(Q2[i].second < minY[1]) minY[1]=Q2[i].second;
if(Q3[i].second < minY[2]) minY[2]=Q3[i].second;
if(Q4[i].second < minY[3]) minY[3]=Q4[i].second;
if(Q1[i].second > maxY[0]) maxY[0]=Q1[i].second;
if(Q2[i].second > maxY[1]) maxY[1]=Q2[i].second;
if(Q3[i].second > maxY[2]) maxY[2]=Q3[i].second;
if(Q4[i].second > maxY[3]) maxY[3]=Q4[i].second;
}
cout << "Q1: ("<<minX[0]<<", "<<minY[0]<<") ("<<maxX[0]<<", "<<maxY[0]<<") "<< abs(maxX[0]-minX[0])*abs(maxY[0]-minY[0])<<endl;
cout << "Q2: ("<<minX[1]<<", "<<minY[1]<<") ("<<maxX[1]<<", "<<maxY[1]<<") "<< abs(maxX[1]-minX[1])*abs(maxY[1]-minY[1])<<endl;
cout << "Q3: ("<<minX[2]<<", "<<minY[2]<<") ("<<maxX[2]<<", "<<maxY[2]<<") "<< abs(maxX[2]-minX[2])*abs(maxY[2]-minY[2])<<endl;
cout << "Q4: ("<<minX[3]<<", "<<minY[3]<<") ("<<maxX[3]<<", "<<maxY[3]<<") "<< abs(maxX[3]-minX[3])*abs(maxY[3]-minY[3])<<endl;
} | # 2071860, 2024-11-02 15:23:26, ---------- (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int x,y;
vector<pair<int,int>> coordinate,Q1,Q2,Q3,Q4;
for(int i=0;i<n;i++){
cin>>x>>y;
if(x>0&&y>0)Q1.push_back({x,y});
if(x<0&&y>0)Q2.push_back({x,y});
if(x<0&&y<0)Q3.push_back({x,y});
if(x>0&&y<0)Q4.push_back({x,y});
}
int minX[]={6500,6500,6500,6500},maxX[]={0,0,0,0},minY[]={6500,6500,6500,6500},maxY[]={0,0,0,0};
for(auto p:Q1){
if(p.first < minX[0]) minX[0]=p.first;
if(p.first > maxX[0]) maxX[0]=p.first;
if(p.first < minY[0]) minY[0]=p.first;
if(p.first < maxY[0]) maxY[0]=p.first;
}
for(auto p:Q2){
if(p.first < minX[1]) minX[1]=p.first;
if(p.first > maxX[1]) maxX[1]=p.first;
if(p.first < minY[1]) minY[1]=p.first;
if(p.first < maxY[1]) maxY[1]=p.first;
}
for(auto p:Q3){
if(p.first < minX[2]) minX[2]=p.first;
if(p.first > maxX[2]) maxX[2]=p.first;
if(p.first < minY[2]) minY[2]=p.first;
if(p.first < maxY[2]) maxY[2]=p.first;
}
for(auto p:Q4){
if(p.first < minX[3]) minX[3]=p.first;
if(p.first > maxX[3]) maxX[3]=p.first;
if(p.first < minY[3]) minY[3]=p.first;
if(p.first < maxY[3]) maxY[3]=p.first;
}
cout << "Q1: ("<<minX[0]<<", "<<minY[0]<<") ("<<maxX[0]<<", "<<maxY[0]<<") "<< abs(maxX[0]-minX[0])*abs(maxY[0]-minY[0])<<endl;
cout << "Q2: ("<<minX[1]<<", "<<minY[1]<<") ("<<maxX[1]<<", "<<maxY[1]<<") "<< abs(maxX[1]-minX[1])*abs(maxY[1]-minY[1])<<endl;
cout << "Q3: ("<<minX[2]<<", "<<minY[2]<<") ("<<maxX[2]<<", "<<maxY[2]<<") "<< abs(maxX[2]-minX[2])*abs(maxY[2]-minY[2])<<endl;
cout << "Q4: ("<<minX[3]<<", "<<minY[3]<<") ("<<maxX[3]<<", "<<maxY[3]<<") "<< abs(maxX[3]-minX[3])*abs(maxY[3]-minY[3])<<endl;
} | # 2071896, 2024-11-02 15:25:41, ---------- (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int x,y;
vector<pair<int,int>> coordinate,Q1,Q2,Q3,Q4;
for(int i=0;i<n;i++){
cin>>x>>y;
if(x>0&&y>0)Q1.push_back({x,y});
if(x<0&&y>0)Q2.push_back({x,y});
if(x<0&&y<0)Q3.push_back({x,y});
if(x>0&&y<0)Q4.push_back({x,y});
}
int minX[]={6500,6500,6500,6500},maxX[]={0,0,0,0},minY[]={6500,6500,6500,6500},maxY[]={0,0,0,0};
for(auto p:Q1){
if(p.first < minX[0]) minX[0]=p.first;
if(p.first > maxX[0]) maxX[0]=p.first;
if(p.first < minY[0]) minY[0]=p.second;
if(p.first < maxY[0]) maxY[0]=p.second;
}
for(auto p:Q2){
if(p.first < minX[1]) minX[1]=p.first;
if(p.first > maxX[1]) maxX[1]=p.first;
if(p.first < minY[1]) minY[1]=p.second;
if(p.first < maxY[1]) maxY[1]=p.second;
}
for(auto p:Q3){
if(p.first < minX[2]) minX[2]=p.first;
if(p.first > maxX[2]) maxX[2]=p.first;
if(p.first < minY[2]) minY[2]=p.second;
if(p.first < maxY[2]) maxY[2]=p.second;
}
for(auto p:Q4){
if(p.first < minX[3]) minX[3]=p.first;
if(p.first > maxX[3]) maxX[3]=p.first;
if(p.first < minY[3]) minY[3]=p.second;
if(p.first < maxY[3]) maxY[3]=p.second;
}
cout << "Q1: ("<<minX[0]<<", "<<minY[0]<<") ("<<maxX[0]<<", "<<maxY[0]<<") "<< abs(maxX[0]-minX[0])*abs(maxY[0]-minY[0])<<endl;
cout << "Q2: ("<<minX[1]<<", "<<minY[1]<<") ("<<maxX[1]<<", "<<maxY[1]<<") "<< abs(maxX[1]-minX[1])*abs(maxY[1]-minY[1])<<endl;
cout << "Q3: ("<<minX[2]<<", "<<minY[2]<<") ("<<maxX[2]<<", "<<maxY[2]<<") "<< abs(maxX[2]-minX[2])*abs(maxY[2]-minY[2])<<endl;
cout << "Q4: ("<<minX[3]<<", "<<minY[3]<<") ("<<maxX[3]<<", "<<maxY[3]<<") "<< abs(maxX[3]-minX[3])*abs(maxY[3]-minY[3])<<endl;
} | # 2071905, 2024-11-02 15:26:28, ---------- (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int x,y;
vector<pair<int,int>> coordinate,Q1,Q2,Q3,Q4;
for(int i=0;i<n;i++){
cin>>x>>y;
if(x>0&&y>0)Q1.push_back({x,y});
if(x<0&&y>0)Q2.push_back({x,y});
if(x<0&&y<0)Q3.push_back({x,y});
if(x>0&&y<0)Q4.push_back({x,y});
}
int minX[]={6500,6500,6500,6500},maxX[]={0,0,0,0},minY[]={6500,6500,6500,6500},maxY[]={0,0,0,0};
for(auto p:Q1){
if(p.first < minX[0]) minX[0]=p.first;
if(p.first > maxX[0]) maxX[0]=p.first;
if(p.second < minY[0]) minY[0]=p.second;
if(p.second < maxY[0]) maxY[0]=p.second;
}
for(auto p:Q2){
if(p.first < minX[1]) minX[1]=p.first;
if(p.first > maxX[1]) maxX[1]=p.first;
if(p.second < minY[1]) minY[1]=p.second;
if(p.second < maxY[1]) maxY[1]=p.second;
}
for(auto p:Q3){
if(p.first < minX[2]) minX[2]=p.first;
if(p.first > maxX[2]) maxX[2]=p.first;
if(p.second < minY[2]) minY[2]=p.second;
if(p.second < maxY[2]) maxY[2]=p.second;
}
for(auto p:Q4){
if(p.first < minX[3]) minX[3]=p.first;
if(p.first > maxX[3]) maxX[3]=p.first;
if(p.second < minY[3]) minY[3]=p.second;
if(p.second < maxY[3]) maxY[3]=p.second;
}
cout << "Q1: ("<<minX[0]<<", "<<minY[0]<<") ("<<maxX[0]<<", "<<maxY[0]<<") "<< abs(maxX[0]-minX[0])*abs(maxY[0]-minY[0])<<endl;
cout << "Q2: ("<<minX[1]<<", "<<minY[1]<<") ("<<maxX[1]<<", "<<maxY[1]<<") "<< abs(maxX[1]-minX[1])*abs(maxY[1]-minY[1])<<endl;
cout << "Q3: ("<<minX[2]<<", "<<minY[2]<<") ("<<maxX[2]<<", "<<maxY[2]<<") "<< abs(maxX[2]-minX[2])*abs(maxY[2]-minY[2])<<endl;
cout << "Q4: ("<<minX[3]<<", "<<minY[3]<<") ("<<maxX[3]<<", "<<maxY[3]<<") "<< abs(maxX[3]-minX[3])*abs(maxY[3]-minY[3])<<endl;
} | # 2071959, 2024-11-02 15:30:03, ---------- (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int x,y;
vector<pair<int,int>> coordinate,Q1,Q2,Q3,Q4;
for(int i=0;i<n;i++){
cin>>x>>y;
if(x>0&&y>0)Q1.push_back({x,y});
if(x<0&&y>0)Q2.push_back({x,y});
if(x<0&&y<0)Q3.push_back({x,y});
if(x>0&&y<0)Q4.push_back({x,y});
}
int minX[]={6500,6500,6500,6500},maxX[]={0,0,0,0},minY[]={6500,6500,6500,6500},maxY[]={0,0,0,0};
for(auto p:Q1){
if(p.first < minX[0]) minX[0]=p.first;
if(p.first > maxX[0]) maxX[0]=p.first;
if(p.second < minY[0]) minY[0]=p.second;
if(p.second > maxY[0]) maxY[0]=p.second;
}
for(auto p:Q2){
if(p.first < minX[1]) minX[1]=p.first;
if(p.first > maxX[1]) maxX[1]=p.first;
if(p.second < minY[1]) minY[1]=p.second;
if(p.second > maxY[1]) maxY[1]=p.second;
}
for(auto p:Q3){
if(p.first < minX[2]) minX[2]=p.first;
if(p.first > maxX[2]) maxX[2]=p.first;
if(p.second < minY[2]) minY[2]=p.second;
if(p.second > maxY[2]) maxY[2]=p.second;
}
for(auto p:Q4){
if(p.first < minX[3]) minX[3]=p.first;
if(p.first > maxX[3]) maxX[3]=p.first;
if(p.second < minY[3]) minY[3]=p.second;
if(p.second > maxY[3]) maxY[3]=p.second;
}
cout << "Q1: ("<<minX[0]<<", "<<minY[0]<<") ("<<maxX[0]<<", "<<maxY[0]<<") "<< abs(maxX[0]-minX[0])*abs(maxY[0]-minY[0])<<endl;
cout << "Q2: ("<<minX[1]<<", "<<minY[1]<<") ("<<maxX[1]<<", "<<maxY[1]<<") "<< abs(maxX[1]-minX[1])*abs(maxY[1]-minY[1])<<endl;
cout << "Q3: ("<<minX[2]<<", "<<minY[2]<<") ("<<maxX[2]<<", "<<maxY[2]<<") "<< abs(maxX[2]-minX[2])*abs(maxY[2]-minY[2])<<endl;
cout << "Q4: ("<<minX[3]<<", "<<minY[3]<<") ("<<maxX[3]<<", "<<maxY[3]<<") "<< abs(maxX[3]-minX[3])*abs(maxY[3]-minY[3])<<endl;
} |
# 2071722, 2024-11-02 15:08:16, ---------- (0%)
#include<iostream>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<tuple>
#include<utility>
#include<algorithm>
using namespace std;
int main(){
int n,x,y;
vector<int> Qx;vector<int> Qy;
vector<int> Q1,Q2,Q3,Q4;
cin >> n;
while(n--){
cin >> x;
Qx.push_back(x);
cin >> y;
Qy.push_back(y);
}
sort(Qx.begin(),Qx.end());
sort(Qy.begin(),Qy.end());
for(auto c:Qx){
for(auto j:Qy){
for(int i=0 ; i<c ;i++){
if(c != -j && c != -j){
cout << "Q1: " << "(" << c-i << "," << j-i <<")" << " " << "(" << c+i << "," << j+i <<")" << " " << ((c-i) - (c+i) + (j-i) - (j+i));
}
else {cout << "No point in any quadrant";}
}
}
}
} | # 2071758, 2024-11-02 15:12:58, Compilation error (0%)
#include<iostream>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<tuple>
#include<utility>
#include<algorithm>
using namespace std;
int main(){
int n,x,y;
vector<int> Qx;vector<int> Qy;
vector<int> Q1,Q2,Q3,Q4;
cin >> n;
while(n--){
cin >> x;
Qx.push_back(x);
cin >> y;
Qy.push_back(y);
}
sort(Qx.begin(),Qx.end());
sort(Qy.begin(),Qy.end());
for(auto c:Qx){
for(auto j:Qy){
if(c != -j && c != -j){
cout << "Q1: " << "(" << c << "," << j-i <<")" << " " << "(" << c+i << "," << j+i <<")" << " " << abs(((c-i) - (c+i) + (j-i) - (j+i)));
}
else {cout << "No point in any quadrant";}
}
}
} | # 2071765, 2024-11-02 15:13:35, xxxxxxxxxx (0%)
#include<iostream>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<tuple>
#include<utility>
#include<algorithm>
using namespace std;
int main(){
int n,x,y;
vector<int> Qx;vector<int> Qy;
vector<int> Q1,Q2,Q3,Q4;
cin >> n;
while(n--){
cin >> x;
Qx.push_back(x);
cin >> y;
Qy.push_back(y);
}
sort(Qx.begin(),Qx.end());
sort(Qy.end(),Qy.begin());
for(auto c:Qx){
for(auto j:Qy){
if(c != -j && c != -j){
cout << "Q1: " << "(" << c << "," << j <<")" << " " << "(" << c << "," << j <<")" << " " << abs(((c) - (c) + (j) - (j)));
}
else {cout << "No point in any quadrant";}
}
}
} | # 2071894, 2024-11-02 15:25:36, ---------- (0%)
#include<iostream>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<tuple>
#include<utility>
#include<algorithm>
using namespace std;
int main(){
int n,x,y;
vector<int> Qx;vector<int> Qy;
vector<int> Q1,Q2,Q3,Q4;
cin >> n;
while(n--){
cin >> x;
Qx.push_back(x);
cin >> y;
Qy.push_back(y);
}
sort(Qx.begin(),Qx.end());
sort(Qy.begin(),Qy.end());
for(auto c:Qx){
for(auto j:Qy){
if(c != -j && c != -j){
cout << "Q1: " << "(" << Qx[c-2] << "," << Qy[j-2] <<")" << " " << "(" << Qx[c] << "," << Qy[j] <<")" << " " << abs(((Qx[c-2]) - (Qx[c])) * ((Qy[j-2]) - (Qy[j]))) << endl;
break;
}
else {cout << "No point in any quadrant";}
}
}
} |
# 2071173, 2024-11-02 14:04:08, Compilation error (0%)
#include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <set>
#include <unordered_set>
using namespace std;
int main(){
int x;
std:: cin >> x;
int n = 0;
std :: vector<int> seq;
int temp;
while (std :: cin >> temp){
seq.push_back(temp);
}
std:: unordered_set <int> seq_set(seq.begin(), seq.ed())
for(int i : seq){
if (seq_set.find(x-i) != seq_set.end()) {
n++;
}
}
std::cout << n/2 <, std::endl;
return 0;
} | # 2071885, 2024-11-02 15:24:58, Compilation error (0%)
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
using namespace std;
int main () {
int N;
cin >> N
int x.y;
cin >> x >> y;
map<set<vector<int,int>>>
} | # 2072014, 2024-11-02 15:32:29, Compilation error (0%)
#include <bits/stdc++.h>
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
int main(){
multiset <char> s1;
multiset <char> s2;
string input1;
string input2;
getline(cin,input1);
getline(cin,input2);
for(char c: input1){
if(isalpha(c))
s1.insert(tolower(c));
}
for(char c: input2){
if(isalpha(c))
s2.insert(tolower(c));
}
if(s1==s2){
cout << "Yes";
}else{
cout << "No"
} |
# 2071029, 2024-11-02 13:47:23, Compilation error (0%)
#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
using namespace std;
int main(){
int n;
int x,y;
cin >> n;
bool nopoint = false;
vector<pair<int,int>>data;
while(n--){
cin >> x >> y;
data.push_back(make_pair(x,y));
}
sort(data.begin(),data.end());
vector<pair<int,int>>Q1;
vector<pair<int,int>>Q2;
vector<pair<int,int>>Q3;
vector<pair<int,int>>Q4;
for(auto & p:data){
if((p.first > 0)&&(p.second > 0)){
Q1.push_back(make_pair(x,y));
}
if((p.first < 0)&&(p.second >0)){
Q2.push_back(make_pair(x,y));
}
if((p.first < 0)&&(p.second <0)){
Q3.push_back(make_pair(x,y));
}
if((p.first > 0)&&(p.second < 0)){
Q4.push_back(make_pair(x,y));
}
// }
// for(int itr=0; itr<Q1.size() ; ++itr){
// vector<pair<int,int>>mini = mini.push_back(make_pair(*itr,));
// vector<pair<int,int>>maxi =
// }
// cout << "Q1:" << "(" << << max << area << endl;
// cout << "Q2:" << "(" << << max << area << endl;
// cout << "Q3:" << "(" << << max << area << endl;
// cout << "Q4:" << "(" << << max << area << endl;
if(!nopoint){
cout << "No point in any quadrant" << endl;
}
} | # 2071034, 2024-11-02 13:47:50, ---------- (0%)
#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
using namespace std;
int main(){
int n;
int x,y;
cin >> n;
bool nopoint = false;
vector<pair<int,int>>data;
while(n--){
cin >> x >> y;
data.push_back(make_pair(x,y));
}
sort(data.begin(),data.end());
vector<pair<int,int>>Q1;
vector<pair<int,int>>Q2;
vector<pair<int,int>>Q3;
vector<pair<int,int>>Q4;
for(auto & p:data){
if((p.first > 0)&&(p.second > 0)){
Q1.push_back(make_pair(x,y));
}
if((p.first < 0)&&(p.second >0)){
Q2.push_back(make_pair(x,y));
}
if((p.first < 0)&&(p.second <0)){
Q3.push_back(make_pair(x,y));
}
if((p.first > 0)&&(p.second < 0)){
Q4.push_back(make_pair(x,y));
}
// }
// for(int itr=0; itr<Q1.size() ; ++itr){
// vector<pair<int,int>>mini = mini.push_back(make_pair(*itr,));
// vector<pair<int,int>>maxi =
// }
// cout << "Q1:" << "(" << << max << area << endl;
// cout << "Q2:" << "(" << << max << area << endl;
// cout << "Q3:" << "(" << << max << area << endl;
// cout << "Q4:" << "(" << << max << area << endl;
if(!nopoint){
cout << "No point in any quadrant" << endl;
}
}
} | # 2071048, 2024-11-02 13:48:46, ---------- (0%)
#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
using namespace std;
int main(){
int n;
int x,y;
cin >> n;
bool nopoint = false;
vector<pair<int,int>>data;
while(n--){
cin >> x >> y;
data.push_back(make_pair(x,y));
}
sort(data.begin(),data.end());
vector<pair<int,int>>Q1;
vector<pair<int,int>>Q2;
vector<pair<int,int>>Q3;
vector<pair<int,int>>Q4;
for(auto & p:data){
if((p.first > 0)&&(p.second > 0)){
Q1.push_back(make_pair(x,y));
}
if((p.first < 0)&&(p.second >0)){
Q2.push_back(make_pair(x,y));
}
if((p.first < 0)&&(p.second <0)){
Q3.push_back(make_pair(x,y));
}
if((p.first > 0)&&(p.second < 0)){
Q4.push_back(make_pair(x,y));
}
// }
// for(int itr=0; itr<Q1.size() ; ++itr){
// vector<pair<int,int>>mini = mini.push_back(make_pair(*itr,));
// vector<pair<int,int>>maxi =
// }
// cout << "Q1:" << "(" << << max << area << endl;
// cout << "Q2:" << "(" << << max << area << endl;
// cout << "Q3:" << "(" << << max << area << endl;
// cout << "Q4:" << "(" << << max << area << endl;
cout << "No point in any quadrant" << endl;
}
} |
# 2071942, 2024-11-02 15:29:20, ---------- (0%)
#include<iostream>
#include<cmath>
#include<vector>
#include<tuple>
#include<climits>
using namespace std;
int main () {
int n;
cin >> n;
pair<int, int> q1;
pair<int, int> q2;
pair<int, int> q3;
pair<int, int> q4;
for(int i = 0; i<n; i++) {
int a, b;
cin >> a >> b;
if(a>0 && b>0) {
q1.first = a;
q1.second = b;
} else if (a<0 && b>0) {
q2.first =a;
q2.second = b;
} else if (a<0 && b<0) {
q3.first = a;
q3.second = b;
} else if (a>0 && b<0) {
q4.first = a;
q4.second = b;
}
}
int min1, min2, min3, min4, min5, min6, min7, min8 = INT_MAX;
int max1, max2, max3, max4, max5, max6, max7, max8 = INT_MIN;
for(int i = 0; i<n; i++) {
min1 = min(min1, q1.first);
min2 = min(min2, q1.second);
min3 = min(min3, q2.first);
min4 = min(min4, q2.second);
min5 = min(min5, q3.first);
min6 = min(min6, q3.second);
min7 = min(min7, q4.first);
min8 = min(min8, q4.second);
max1 = max(max1, q1.first);
max2 = max(max2, q1.second);
max3 = max(max3, q2.first);
max4 = max(max4, q2.second);
max5 = max(max5, q3.first);
max6 = max(max6, q3.second);
max7 = max(max7, q4.first);
max8 = max(max8, q4.second);
}
cout << "Q1:" << " " <<"(" << min1 <<", " << min2 <<")" << " " << "(" << max1 <<", " << max2 <<")" << " " << (max1-min1)*(max2-min2) << endl;
cout << "Q2:" << " " <<"(" << min3 <<", " << min4 <<")" << " " << "(" << max3 <<", " << max4 <<")" << " " << (max3-min3)*(max4-min4) << endl;
cout << "Q3:" << " " <<"(" << min5 <<", " << min6 <<")" << " " << "(" << max5 <<", " << max6 <<")" << " " << (max5-min5)*(max6-min6) << endl;
cout << "Q4:" << " " <<"(" << min7 <<", " << min8 <<")" << " " << "(" << max7 <<", " << max8 <<")" << " " << (max7-min7)*(max8-min8) << endl;
} | # 2071946, 2024-11-02 15:29:32, ---------- (0%)
#include<iostream>
#include<cmath>
#include<vector>
#include<tuple>
#include<climits>
using namespace std;
int main () {
int n;
cin >> n;
pair<int, int> q1;
pair<int, int> q2;
pair<int, int> q3;
pair<int, int> q4;
for(int i = 0; i<n; i++) {
int a, b;
cin >> a >> b;
if(a>0 && b>0) {
q1.first = a;
q1.second = b;
} else if (a<0 && b>0) {
q2.first =a;
q2.second = b;
} else if (a<0 && b<0) {
q3.first = a;
q3.second = b;
} else if (a>0 && b<0) {
q4.first = a;
q4.second = b;
}
}
int min1, min2, min3, min4, min5, min6, min7, min8 = 0;
int max1, max2, max3, max4, max5, max6, max7, max8 = 0;
for(int i = 0; i<n; i++) {
min1 = min(min1, q1.first);
min2 = min(min2, q1.second);
min3 = min(min3, q2.first);
min4 = min(min4, q2.second);
min5 = min(min5, q3.first);
min6 = min(min6, q3.second);
min7 = min(min7, q4.first);
min8 = min(min8, q4.second);
max1 = max(max1, q1.first);
max2 = max(max2, q1.second);
max3 = max(max3, q2.first);
max4 = max(max4, q2.second);
max5 = max(max5, q3.first);
max6 = max(max6, q3.second);
max7 = max(max7, q4.first);
max8 = max(max8, q4.second);
}
cout << "Q1:" << " " <<"(" << min1 <<", " << min2 <<")" << " " << "(" << max1 <<", " << max2 <<")" << " " << (max1-min1)*(max2-min2) << endl;
cout << "Q2:" << " " <<"(" << min3 <<", " << min4 <<")" << " " << "(" << max3 <<", " << max4 <<")" << " " << (max3-min3)*(max4-min4) << endl;
cout << "Q3:" << " " <<"(" << min5 <<", " << min6 <<")" << " " << "(" << max5 <<", " << max6 <<")" << " " << (max5-min5)*(max6-min6) << endl;
cout << "Q4:" << " " <<"(" << min7 <<", " << min8 <<")" << " " << "(" << max7 <<", " << max8 <<")" << " " << (max7-min7)*(max8-min8) << endl;
} |
# 2070029, 2024-11-02 11:45:42, ---------- (0%)
#include <iostream>
#include <cmath>
#include <vector>
using namespace std;
int main(){
int a,b,Q1=2,Q2=3,Q3,Q4;
cin >> a;
cin >> b;
cout<<Q1<<Q2<<endl;
} |
# 2070324, 2024-11-02 12:03:34, ---------- (0%)
#include<iostream>
#include<vector>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> x;
vector<int> y;
for(int i=0;i<n;i++){
int xx,yy;
cin >> xx >> yy;
x.push_back(xx);
y.push_back(yy);
}
cout << "comprogveryhard";
cout << "dataalgoveryveryhard";
cout << "how to pass exam comprog?";
cout << "pom jacry ";
} |
# 2072003, 2024-11-02 15:31:53, ---------- (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
int x,y;
vector<pair<int,int>> v;
map<int,int> m;
while (n--)
{
cin >> x >> y;
v.push_back({x,y});
}
cout << "Q1: ";
sort(v.begin(),v.end());
for (auto e : v){
if(e.first > 0 && e.second > 0 && e.first != 0 && e.second != 0){
cout << "(" <<e.first << ", " << e.second << ")" ;
}
}
cout << "Q2: "<< endl;
for(auto w:v){
if(w.first < 0 && w.second > 0 && w.first != 0 && w.second != 0){
cout << "(" <<w.first << ", " << w.second << ")" ;
}
}cout << "Q3: "<<endl;
for(auto q:v){
if(q.first < 0 && q.second > 0 && q.first != 0 && q.second != 0){
cout << "(" <<q.first << ", " << q.second << ")" ;
}
}cout << "Q4: "<<endl;
for(auto s:v){
if(s.first > 0 && s.second < 0 && s.first != 0 && s.second != 0){
cout << "(" <<s.first << ", " << s.second << ")" ;
}
}
} |