#include <bits/stdc++.h>
#define endl "\n"
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define sz size()
#define rep(i,k,n) for(int i = k ; i <= n ; ++i)
#define per(i,k,n) for(int i = k ; i >= n ; --i)
#define Zymraq() ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define all(x) x.begin(),x.end()
#define fr(x) freopen(x".in","r",stdin),freopen(x".out","w",stdout)
#define toqta return 0
#define PERMUTE next_permutation
#define no cout<<"No"<<endl;
#define yes cout<<"Yes"<<endl;
#define a() a + 1, a + n + 1
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef string S;
typedef double ld;
typedef long double lld;
const int N = 1e6 + 17;
const int modd = 1e9 + 7;
const int INF = 1e9 - 19;
const int P = 37;
const ll NN = 1e7 + 17;
const ld eps = 1e-19;
const double pi = 3.141592653589793238462643383279 ;
bool sortbysec(const pair<int,int> &a, const pair<int,int> &b){
return (a.second < b.second);
}
void pre (ll a) {
cout << fixed << setprecision(a);
return;
}
ll n, totalans;
ll pos[1000][1000];
ll x[N], y[N];
void solve() {
cin >> n;
for (int i = 1; i <= 2 * n; ++ i) {
cin >> x[i] >> y[i];
if (x[i] >= 1 && y[i] >= 1 && x[i] <= n && y[i] <= 2 && !pos[x[i]][y[i]]) {
pos[x[i]][y[i]] = 1;
}
}
// cout << "was\n";
for (int i = 1; i <= 2 * n; ++ i) {
ll mn = INF, now_posx, now_posy;
if (x[i] > 0 && y[i] > 0 && x[i] <= n && y[i] <= n && pos[x[i]][y[i]] == 1) {
pos[x[i]][y[i]] ++;
continue;
}
for (int j = 1; j <= n; ++ j) {
if (!pos[j][1] && mn > abs (x[i] - j) + abs(y[i] - 1)) {
now_posx = j, now_posy = 1;
mn = abs (x[i] - j) + abs(y[i] - 1);
}
if (!pos[j][2] && mn > abs (x[i] - j) + abs(y[i] - 2)) {
now_posx = j, now_posy = 2;
mn = abs (x[i] - j) + abs(y[i] - 2);
}
}
// cout << now_posx << ' ' << now_posy << ' ' << mn << " " << x[i] << ' ' << y[i] << ' ' << i << '\n';
if (mn != INF){
pos[now_posx][now_posy] = 1;
totalans += mn;
}
}
cout << totalans;
return;
}
int main() {
// Zymraq ();
solve();
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
