oj.uz

답안 #127354

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
127354 2019-07-09T09:14:35 Z RockyB Coin Collecting (JOI19_ho_t4) C++17
100 / 100
 92 ms 14316 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;
pair <ll, ll> a[N << 1];

ll dst(pair <ll, ll> x, pair <ll, ll> y) {
  return abs(x.f - y.f) + abs(x.s - y.s);
}

int cnt[N][3];

vector <int> em[3], fl[3];
ll calc(int v = 1) {
  if (v > n) return 0;
  ll res = 0;

  rep(j, 1, 2) {
    if (!cnt[v][j]) em[j].pb(v);
    if (cnt[v][j] > 1) fl[j].pb(v);
  }

  rep(j, 1, 2) {
    while (sz(em[j]) && cnt[v][j] > 1) {
      int p = em[j].back();
      if (!cnt[p][j]) {
        cnt[v][j]--;
        cnt[p][j]++;
        res += v - p;
        em[j].pp();
      }
      else em[j].pp();
    }
  }  
  rep(j, 1, 2) {
    if (!cnt[v][j]) {
      while (sz(fl[j])) {
        int p = fl[j].back();
        if (cnt[p][j] > 1) {
          res += v - p;
          cnt[p][j]--;
          cnt[v][j]++;
          if (cnt[p][j] == 1) fl[j].pp();
          break;
        }
        else fl[j].pp();
      }
    }
  }
  rep(j, 1, 2) {
    if (!cnt[v][j]) {
      while (sz(fl[3 - j])) {
        int p = fl[3 - j].back();
        if (cnt[p][3 - j] > 1) {
          res += v - p + 1;
          cnt[p][3 - j]--;
          cnt[v][j]++;
          if (cnt[p][3 - j] == 1) fl[3 - j].pp();
          break;
        }
        else fl[3 - j].pp();
      }
    }
  }
  rep(j, 1, 2) {
    while (sz(em[3 - j]) && cnt[v][j] > 1) {
      int p = em[3 - j].back();
      if (!cnt[p][3 - j]) {
        cnt[v][j]--;
        cnt[p][3 - j]++;
        res += v - p + 1;
        em[3 - j].pp();
      }
      else em[3 - j].pp();
    }
  }
  return res + calc(v + 1); 
}
int main() {
	#ifdef IOI
		freopen ("in.txt", "r", stdin);
    freopen ("D.out", "w", stdout);
	#endif
  Kazakhstan
  cin >> n;
  rep(i, 1, n << 1) {
    cin >> a[i].f >> a[i].s;
  }
  ll ans = 0;
  vector < pair <int, int > > to;
  to.pb({1, 1});
  to.pb({1, 2});
  to.pb({n, 1});
  to.pb({n, 2});
  rep(i, 1, n << 1) {
    ll mn = linf;
    pair <int, int> go = {-1, -1};
    
    to.pb({a[i].f, 2});
    to.pb({a[i].f, 1});
    to.pb({n, a[i].s});
    to.pb({1, a[i].s});

    for (auto it : to) {
      if (!(1 <= it.f && it.f <= n && 1 <= it.s && it.s <= 2)) {
        continue;
      }
      ll cur = dst(a[i], it);
      if (cur < mn) {
        mn = cur;
        go = it;
      }
    }
    rep(j, 1, 4) to.pp();
    ans += mn;
    cnt[go.f][go.s]++;
  }
  cout << ans + calc();
	ioi
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 380 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 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 380 KB Output is correct
33 Correct 2 ms 376 KB Output is correct

Subtask #2
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 380 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 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 380 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 504 KB Output is correct
35 Correct 3 ms 504 KB Output is correct
36 Correct 3 ms 504 KB Output is correct
37 Correct 3 ms 504 KB Output is correct
38 Correct 3 ms 504 KB Output is correct
39 Correct 3 ms 504 KB Output is correct
40 Correct 3 ms 504 KB Output is correct
41 Correct 3 ms 504 KB Output is correct
42 Correct 3 ms 504 KB Output is correct
43 Correct 3 ms 504 KB Output is correct
44 Correct 3 ms 504 KB Output is correct
45 Correct 3 ms 504 KB Output is correct
46 Correct 3 ms 476 KB Output is correct
47 Correct 3 ms 504 KB Output is correct
48 Correct 3 ms 600 KB Output is correct
49 Correct 3 ms 504 KB Output is correct
50 Correct 3 ms 504 KB Output is correct
51 Correct 3 ms 504 KB Output is correct
52 Correct 3 ms 504 KB Output is correct
53 Correct 3 ms 504 KB Output is correct
54 Correct 3 ms 508 KB Output is correct
55 Correct 3 ms 504 KB Output is correct
56 Correct 3 ms 504 KB Output is correct
57 Correct 3 ms 504 KB Output is correct
58 Correct 3 ms 504 KB Output is correct
59 Correct 3 ms 504 KB Output is correct
60 Correct 3 ms 504 KB Output is correct
61 Correct 3 ms 504 KB Output is correct
62 Correct 3 ms 504 KB Output is correct
63 Correct 3 ms 504 KB Output is correct
64 Correct 3 ms 504 KB Output is correct

Subtask #3
63.0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 380 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 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 380 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 504 KB Output is correct
35 Correct 3 ms 504 KB Output is correct
36 Correct 3 ms 504 KB Output is correct
37 Correct 3 ms 504 KB Output is correct
38 Correct 3 ms 504 KB Output is correct
39 Correct 3 ms 504 KB Output is correct
40 Correct 3 ms 504 KB Output is correct
41 Correct 3 ms 504 KB Output is correct
42 Correct 3 ms 504 KB Output is correct
43 Correct 3 ms 504 KB Output is correct
44 Correct 3 ms 504 KB Output is correct
45 Correct 3 ms 504 KB Output is correct
46 Correct 3 ms 476 KB Output is correct
47 Correct 3 ms 504 KB Output is correct
48 Correct 3 ms 600 KB Output is correct
49 Correct 3 ms 504 KB Output is correct
50 Correct 3 ms 504 KB Output is correct
51 Correct 3 ms 504 KB Output is correct
52 Correct 3 ms 504 KB Output is correct
53 Correct 3 ms 504 KB Output is correct
54 Correct 3 ms 508 KB Output is correct
55 Correct 3 ms 504 KB Output is correct
56 Correct 3 ms 504 KB Output is correct
57 Correct 3 ms 504 KB Output is correct
58 Correct 3 ms 504 KB Output is correct
59 Correct 3 ms 504 KB Output is correct
60 Correct 3 ms 504 KB Output is correct
61 Correct 3 ms 504 KB Output is correct
62 Correct 3 ms 504 KB Output is correct
63 Correct 3 ms 504 KB Output is correct
64 Correct 3 ms 504 KB Output is correct
65 Correct 60 ms 12596 KB Output is correct
66 Correct 92 ms 14316 KB Output is correct
67 Correct 87 ms 13432 KB Output is correct
68 Correct 82 ms 13224 KB Output is correct
69 Correct 86 ms 13408 KB Output is correct
70 Correct 80 ms 13276 KB Output is correct
71 Correct 87 ms 13400 KB Output is correct
72 Correct 77 ms 14080 KB Output is correct
73 Correct 78 ms 14240 KB Output is correct
74 Correct 77 ms 13880 KB Output is correct
75 Correct 77 ms 13964 KB Output is correct
76 Correct 78 ms 13812 KB Output is correct
77 Correct 82 ms 14092 KB Output is correct
78 Correct 78 ms 13888 KB Output is correct
79 Correct 78 ms 13688 KB Output is correct
80 Correct 78 ms 13788 KB Output is correct
81 Correct 78 ms 13812 KB Output is correct
82 Correct 76 ms 13560 KB Output is correct
83 Correct 77 ms 13560 KB Output is correct
84 Correct 77 ms 13368 KB Output is correct
85 Correct 77 ms 13432 KB Output is correct
86 Correct 77 ms 13276 KB Output is correct
87 Correct 77 ms 13404 KB Output is correct
88 Correct 80 ms 13304 KB Output is correct
89 Correct 79 ms 13432 KB Output is correct
90 Correct 81 ms 13304 KB Output is correct
91 Correct 81 ms 13304 KB Output is correct
92 Correct 79 ms 13316 KB Output is correct
93 Correct 79 ms 13304 KB Output is correct
94 Correct 79 ms 13304 KB Output is correct
95 Correct 78 ms 13288 KB Output is correct
96 Correct 78 ms 13944 KB Output is correct
97 Correct 79 ms 14060 KB Output is correct
98 Correct 78 ms 13760 KB Output is correct
99 Correct 78 ms 13940 KB Output is correct
100 Correct 78 ms 13856 KB Output is correct
101 Correct 78 ms 13852 KB Output is correct
102 Correct 80 ms 13788 KB Output is correct
103 Correct 78 ms 13948 KB Output is correct