Submission #1041499
Source Code Expand
#include <bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<map>
#include<cstring>
#include<string>
#include <math.h>
#include<algorithm>
// #include <boost/multiprecision/cpp_int.hpp>
#include<functional>
#define int long long
#define mod 1000000007
#define pa pair<int,int>
#define ll long long
#define pal pair<double,int>
#define ppa pair<int,pa>
#define ssa pair<string,int>
#define mp make_pair
#define pb push_back
#define EPS (1e-10)
#define equals(a,b) (fabs((a)-(b))<EPS)
using namespace std;
//priority_queue<int, vector<int>, greater<int> > que;
class Point{
public:
double x,y;
Point(double x=0,double y=0):x(x),y(y) {}
Point operator + (Point p) {return Point(x+p.x,y+p.y);}
Point operator - (Point p) {return Point(x-p.x,y-p.y);}
Point operator * (double a) {return Point(x*a,y*a);}
Point operator / (double a) {return Point(x/a,y/a);}
double absv() {return sqrt(norm());}
double norm() {return x*x+y*y;}
bool operator < (const Point &p) const{
return x != p.x ? x<p.x: y<p.y;
}
bool operator == (const Point &p) const{
return fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;
}
};
typedef Point Vector;
struct Segment{
Point p1,p2;
};
double hen(Vector a){
if(fabs(a.x)<EPS && a.y>0) return acos(0);
else if(fabs(a.x)<EPS && a.y<0) return 3*acos(0);
else if(fabs(a.y)<EPS && a.x<0) return 2*acos(0);
else if(fabs(a.y)<EPS && a.x>0) return 0.0;
else if(a.y>0) return acos(a.x/a.absv());
else return 2*acos(0)+acos(-a.x/a.absv());
}
string itos( int i ) {
ostringstream s ;
s << i ;
return s.str() ;
}
int gcd(int v,int b){
if(v>b) return gcd(b,v);
if(v==b) return b;
if(b%v==0) return v;
return gcd(v,b%v);
}
double dot(Vector a,Vector b){
return a.x*b.x+a.y*b.y;
}
double cross(Vector a,Vector b){
return a.x*b.y-a.y*b.x;
}
double distans(double x1,double y1,double x2,double y2){
double rr=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
return sqrt(rr);
}
int beki(int a, int r){
if(r==0)return 1;
if(r==1) return a%mod;
if(r%2==1){
int y=beki(a,r-1);
return(y*a)%mod;
}
int yy=beki(a,r/2);
return (yy*yy)%mod;
}
int x,y;
//----------------kokomade tenpure------------
int g[10000]={0};
signed main(){
cin>>x>>y;
if(x==0){
if(y>0) cout<<y<<endl;
else cout<<1-y<<endl;
// cout<<y<<endl;
}
else if(y==0){
if(x<0) cout<<-x<<endl;
else cout<<1+x<<endl;
}
else if(x<y){
if(x>=0){
cout<<y-x<<endl;
}
else if(y<=0) cout<<y-x<<endl;
else if(y>= -x) cout<<min(1+y+x,y-x)<<endl;
else cout<<min( 1-y-x,y-x)<<endl;
// cout<<y<<" "<<-x;
}
else{
if(y>=0){
cout<<2+x-y<<endl;
}
else if(x<=0) cout<<2+x-y<<endl;
else if(y<= -x) cout<<1-y-x<<endl;
else cout<< 1+y+x<<endl;
}
return 0;
}
//printf("%d %.10f %.10f\n",i,xx/ri,yy/ri);
Submission Info
Submission Time |
|
Task |
A - Simple Calculator |
User |
smiken |
Language |
C++14 (GCC 5.4.1) |
Score |
300 |
Code Size |
3760 Byte |
Status |
AC |
Exec Time |
9 ms |
Memory |
764 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
300 / 300 |
Status |
|
|
Set Name |
Test Cases |
Sample |
0_00.txt, 0_01.txt, 0_02.txt |
All |
0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt |
Case Name |
Status |
Exec Time |
Memory |
0_00.txt |
AC |
9 ms |
764 KB |
0_01.txt |
AC |
3 ms |
256 KB |
0_02.txt |
AC |
3 ms |
256 KB |
1_00.txt |
AC |
3 ms |
256 KB |
1_01.txt |
AC |
3 ms |
256 KB |
1_02.txt |
AC |
3 ms |
256 KB |
1_03.txt |
AC |
3 ms |
256 KB |
1_04.txt |
AC |
3 ms |
256 KB |
1_05.txt |
AC |
3 ms |
256 KB |
1_06.txt |
AC |
3 ms |
256 KB |
1_07.txt |
AC |
3 ms |
256 KB |
1_08.txt |
AC |
3 ms |
256 KB |
1_09.txt |
AC |
3 ms |
256 KB |
1_10.txt |
AC |
3 ms |
256 KB |