Submission #1338745


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair((a),(b))
#define pb(a) push_back((a))
#define all(x) (x).begin(),(x).end()
#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))
#define fi first
#define se second
#define dbg(x) cout<<#x" = "<<((x))<<endl
template<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<"("<<p.fi<<","<<p.se<<")";return o;}
template<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<"[";for(T t:v){o<<t<<",";}o<<"]";return o;}

#define INF 2147483600
#define long long long // for codeforces

pair<int,int> s2p(string s){
  string t = s.substr(0, s.find('.'));
  string u = s.substr(s.find('.')+1);
  return mp(atoi(t.c_str()), atoi(u.c_str()));
}

int main(){
  string s,t;
  cin>>s>>t;
  auto p = s2p(s), q = s2p(t);
  int a = p.fi, c = q.fi;
  int b = p.se, d = q.se;
//  dbg(vector<int>({a,b,c,d}));

  bool ba=false,bc=false;
  if(a<0) ba=true, a*=-1;
  if(c<0) bc=true, c*=-1;

  int x,y,z,w,xx,yy,zz,ww;
  if(b==0){
    x=a; y=c; z=a; w=c+1;
    xx=a-d; yy=c; zz=a+(1000-d); ww=c+1;
  } else {
    x=a; y=c; z=a-b; w=c-d;
    xx=a; yy=c+1; zz=a-b; ww=c+1+(1000-d);
  }

  if(ba) x*=-1, z*=-1, xx*=-1, zz*=-1;
  if(bc) y*=-1, w*=-1, yy*=-1, ww*=-1;

  printf("%d %d %d %d\n", x, y, z, w);
  printf("%d %d %d %d\n", xx, yy, zz, ww);
  return 0;
}

Submission Info

Submission Time
Task B - 交点
User tossy
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1481 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 27
Set Name Test Cases
All scrambled_00.txt, scrambled_01.txt, scrambled_02.txt, scrambled_03.txt, scrambled_04.txt, scrambled_05.txt, scrambled_06.txt, scrambled_07.txt, scrambled_08.txt, scrambled_09.txt, scrambled_10.txt, scrambled_11.txt, scrambled_12.txt, scrambled_13.txt, scrambled_14.txt, scrambled_15.txt, scrambled_16.txt, scrambled_17.txt, scrambled_18.txt, scrambled_19.txt, scrambled_20.txt, scrambled_21.txt, scrambled_22.txt, scrambled_23.txt, scrambled_24.txt, scrambled_25.txt, scrambled_26.txt
Case Name Status Exec Time Memory
scrambled_00.txt AC 1 ms 256 KB
scrambled_01.txt AC 1 ms 256 KB
scrambled_02.txt AC 1 ms 256 KB
scrambled_03.txt AC 1 ms 256 KB
scrambled_04.txt AC 1 ms 256 KB
scrambled_05.txt AC 1 ms 256 KB
scrambled_06.txt AC 1 ms 256 KB
scrambled_07.txt AC 1 ms 256 KB
scrambled_08.txt AC 1 ms 256 KB
scrambled_09.txt AC 1 ms 256 KB
scrambled_10.txt AC 1 ms 256 KB
scrambled_11.txt AC 1 ms 256 KB
scrambled_12.txt AC 1 ms 256 KB
scrambled_13.txt AC 1 ms 256 KB
scrambled_14.txt AC 1 ms 256 KB
scrambled_15.txt AC 1 ms 256 KB
scrambled_16.txt AC 1 ms 256 KB
scrambled_17.txt AC 1 ms 256 KB
scrambled_18.txt AC 1 ms 256 KB
scrambled_19.txt AC 1 ms 256 KB
scrambled_20.txt AC 1 ms 256 KB
scrambled_21.txt AC 1 ms 256 KB
scrambled_22.txt AC 1 ms 256 KB
scrambled_23.txt AC 1 ms 256 KB
scrambled_24.txt AC 1 ms 256 KB
scrambled_25.txt AC 1 ms 256 KB
scrambled_26.txt AC 1 ms 256 KB