Submission #360638


Source Code Expand

#include<iostream>
#include<fstream>
#include<sstream>
#include<string>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<vector>
#include<list>
#include<algorithm>
#include<utility>
#include<complex>

using namespace std;

#define reE(i,a,b) for(auto (i)=(a);(i)<=(b);(i)++)
#define rE(i,b) reE(i,0,b)
#define reT(i,a,b) for(auto (i)=(a);(i)<(b);(i)++)
#define rT(i,b) reT(i,0,b)
#define rep(i,a,b) reE(i,a,b);
#define rev(i,a,b) for(auto (i)=(b)-1;(i)>=(a);(i)--)
#define itr(i,b) for(auto (i)=(b).begin();(i)!=(b).end();++(i))
#define rti(i,b) for(auto (i)=(b).rbegin();(i)!=(b).rend();++(i))
#define LL long long
#define all(b) (b).begin(),(b).end()

#define input_init stringstream ss; string strtoken, token; istringstream is
#define input_line  getline(cin, strtoken);is.str(strtoken);is.clear(istringstream::goodbit)
#define input_token(num) ss.str(""); ss.clear(stringstream::goodbit); getline(is, token, ','); ss << token; ss >> num

#define dir(xx,yy,x,y,i) (xx)=(x)+dir[(i)],(yy)=(y)+dir[(i)+1]

typedef complex<double> P;
typedef vector<P> Poly;

const LL INF = 1 << 30;
const double eps = 1e-8;
const int dir[] = { 0, 1, 0, -1, 0 };

int main(void){
	int x, y, z, w;
	cin >> x >> y >> z >> w;
	cout << abs(x - z) + abs(y - w) + 1 << endl;

	return(0);
}

Submission Info

Submission Time
Task A - 高橋くんとマンハッタン
User btk15049
Language C++11 (GCC 4.8.1)
Score 100
Code Size 1405 Byte
Status AC
Exec Time 30 ms
Memory 920 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 21
Set Name Test Cases
Sample subtask0_0.txt, subtask0_1.txt, subtask0_2.txt
All subtask0_0.txt, subtask0_1.txt, subtask0_2.txt, subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt
Case Name Status Exec Time Memory
subtask0_0.txt AC 24 ms 800 KB
subtask0_1.txt AC 24 ms 792 KB
subtask0_2.txt AC 28 ms 748 KB
subtask1_0.txt AC 24 ms 800 KB
subtask1_1.txt AC 27 ms 788 KB
subtask1_10.txt AC 26 ms 672 KB
subtask1_11.txt AC 26 ms 800 KB
subtask1_12.txt AC 25 ms 920 KB
subtask1_13.txt AC 27 ms 744 KB
subtask1_14.txt AC 26 ms 792 KB
subtask1_15.txt AC 27 ms 736 KB
subtask1_16.txt AC 30 ms 700 KB
subtask1_17.txt AC 24 ms 800 KB
subtask1_2.txt AC 28 ms 760 KB
subtask1_3.txt AC 23 ms 804 KB
subtask1_4.txt AC 26 ms 736 KB
subtask1_5.txt AC 24 ms 796 KB
subtask1_6.txt AC 24 ms 800 KB
subtask1_7.txt AC 25 ms 796 KB
subtask1_8.txt AC 24 ms 800 KB
subtask1_9.txt AC 24 ms 800 KB