제출 #1028135

#제출 시각아이디문제언어결과실행 시간메모리
1028135mdn2002Portal (BOI24_portal)C++14
0 / 100
1 ms440 KiB
/*
Mayoeba Yabureru
*/
#include<bits/stdc++.h>
using namespace std;

void solve() {
    int n;
    cin >> n;
    assert(n == 2);
    vector<int> x(n), y(n);
    for (int i = 0; i < n; i ++) cin >> x[i] >> y[i];
    if (x[0] == x[1] || y[0] == y[1]) cout << -1;
    else cout << max(x[0], x[1]) - min(x[0], x[1]) + max(y[0], y[1]) - min(y[0], y[1]) - 2;
}
/*
5
1 3
2 1
1 3
0 10
3 5
*/
int main()
{
    int T = 1;
    for (int I = 0; I < T; I ++){
        solve();
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...