#define DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}
// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
public:
template<typename T>
_Debug& operator,(T val) {
cout << val << endl;
return *this;
}
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif
// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back
// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;
// ---------- END OF TEMPLATE ----------
int X[200000],Y[200000];
pii p[200000];
vpii in[2];
int main() {
int i;
int N;
LLI ans = 0;
scanf("%d",&N);
for (i = 0; i < 2*N; i++) {
scanf("%d %d",&X[i],&Y[i]);
//X[i] = rand(),Y[i] = rand();
//X[i] = (rand() % N)+1,Y[i] = ((rand() % 2)+1);
if (X[i] < 1) ans += 1-X[i],X[i] = 1;
if (X[i] > N) ans += X[i]-N,X[i] = N;
if (Y[i] < 1) ans += 1-Y[i],Y[i] = 1;
if (Y[i] > 2) ans += Y[i]-2,Y[i] = 2;
p[i] = mp(X[i],Y[i]);
}
sort(p,p+2*N);
int j;
for (i = 0; i < 2*N; i++) {
int x = i/2+1,y = (i % 2)+1;
ans += abs(p[i].first-x)+abs(p[i].second-y);
if (p[i].second != y) {
y--;
pii a = mp(x,p[i].first);
int m = 0;
for (j = 0; j < in[y].size(); j++) {
if (abs(in[y][j].first-in[y][j].second)+abs(a.first-a.second)+2 > \
abs(in[y][j].first-a.second)+abs(a.first-in[y][j].second)) {
m = max(m,abs(in[y][j].first-in[y][j].second)+abs(a.first-a.second)+2-abs(in[y][j].first-a.second)-abs(a.first-in[y][j].second));
}
}
if (m > 0) {
for (j = 0; j < in[y].size(); j++) {
if (abs(in[y][j].first-in[y][j].second)+abs(a.first-a.second)+2- \
abs(in[y][j].first-a.second)-abs(a.first-in[y][j].second) == m) {
ans -= m;
break;
}
}
for (j++; j < in[y].size(); j++) in[y][j-1] = in[y][j];
in[y].pop_back();
}
else in[!y].pb(a);
}
//cout<<"ans: "<<ans<<endl;
//for (j=0;j<in[0].size();j++)cout<<0<<" "<<in[0][j].first<<","<<in[0][j].second<<endl;
//for (j=0;j<in[1].size();j++)cout<<1<<" "<<in[1][j].first<<","<<in[1][j].second<<endl;
}
printf("%lld\n",ans);
return 0;
}
Compilation message
joi2019_ho_t4.cpp: In function 'int main()':
joi2019_ho_t4.cpp:86:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (j = 0; j < in[y].size(); j++) {
~~^~~~~~~~~~~~~~
joi2019_ho_t4.cpp:94:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (j = 0; j < in[y].size(); j++) {
~~^~~~~~~~~~~~~~
joi2019_ho_t4.cpp:102:29: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (j++; j < in[y].size(); j++) in[y][j-1] = in[y][j];
~~^~~~~~~~~~~~~~
joi2019_ho_t4.cpp:65:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&N);
~~~~~^~~~~~~~~
joi2019_ho_t4.cpp:67:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d",&X[i],&Y[i]);
~~~~~^~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
376 KB |
Output is correct |
| 3 |
Correct |
2 ms |
376 KB |
Output is correct |
| 4 |
Correct |
2 ms |
376 KB |
Output is correct |
| 5 |
Correct |
2 ms |
376 KB |
Output is correct |
| 6 |
Correct |
2 ms |
376 KB |
Output is correct |
| 7 |
Correct |
2 ms |
376 KB |
Output is correct |
| 8 |
Correct |
2 ms |
376 KB |
Output is correct |
| 9 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
| 10 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
376 KB |
Output is correct |
| 3 |
Correct |
2 ms |
376 KB |
Output is correct |
| 4 |
Correct |
2 ms |
376 KB |
Output is correct |
| 5 |
Correct |
2 ms |
376 KB |
Output is correct |
| 6 |
Correct |
2 ms |
376 KB |
Output is correct |
| 7 |
Correct |
2 ms |
376 KB |
Output is correct |
| 8 |
Correct |
2 ms |
376 KB |
Output is correct |
| 9 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
| 10 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
376 KB |
Output is correct |
| 3 |
Correct |
2 ms |
376 KB |
Output is correct |
| 4 |
Correct |
2 ms |
376 KB |
Output is correct |
| 5 |
Correct |
2 ms |
376 KB |
Output is correct |
| 6 |
Correct |
2 ms |
376 KB |
Output is correct |
| 7 |
Correct |
2 ms |
376 KB |
Output is correct |
| 8 |
Correct |
2 ms |
376 KB |
Output is correct |
| 9 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
| 10 |
Halted |
0 ms |
0 KB |
- |
