oj.uz

답안 #126909

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
126909 2019-07-08T15:32:55 Z RockyB Coin Collecting (JOI19_ho_t4) C++17
0 / 100
 9 ms 376 KB 
/// In The Name Of God

//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
//#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>

#define f first
#define s second

#define pb push_back
#define pp pop_back
#define mp make_pair

#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()

#define rep(i, l, r) for (int i = (l); i <= (r); i++)
#define per(i, l, r) for (int i = (l); i >= (r); i--)

#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);

#define nl '\n'
#define ioi exit(0);

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

const int N = (int)2e5 + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;

const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};

using namespace std;

int n;
ll ans;
pair <ll, ll> a[N];

map < pair <int, int>, int> placed;
bool check(int x, int y) {
  return 1 <= x && x <= n && 1 <= y && y <= 2;
}
void go(int id) {
  ll mn = linf;
  ll ox, oy;
  rep(j, 1, 2) {
    rep(i, 1, n) {
      if (placed.count({i, j})) continue;
      ll cur = abs(a[id].f - i) + abs(a[id].s - j);
      if (cur < mn) {
        mn = cur;
        ox = i, oy = j;
      }
    }
  }
  placed[{ox, oy}] = 1;
  // cerr << ox << ' ' << oy << endl;
  ans += mn;
}
int main() {
	#ifdef IOI
		freopen ("in.txt", "r", stdin);
	#endif
  Kazakhstan
  cin >> n;
  rep(i, 1, n << 1) {
    cin >> a[i].f >> a[i].s;
  }
  sort(a + 1, a + 1 + n + n);
  rep(i, 1, n << 1) {
    if (check(a[i].f, a[i].s) && !placed.count(a[i])) {
      placed[a[i]] = i;
    }
  }
  rep(i, 1, n << 1) {
    if (placed.count(a[i]) && placed[a[i]] == i) continue;
    go(i);
  }
  cout << ans;
	ioi
}

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 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 Incorrect 2 ms 376 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 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 Incorrect 2 ms 376 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 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 Incorrect 2 ms 376 KB Output isn't correct
7 Halted 0 ms 0 KB -