oj.uz

Submission #395989

# Submission time Handle Problem Language Result Execution time Memory
395989 2021-04-29T10:11:39 Z usachevd0 Ancient Books (IOI17_books) C++14
50 / 100
 296 ms 23808 KB 
#include <bits/stdc++.h>
#ifndef DEBUG
  #include "books.h"
#endif

using namespace std;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define all(a) (a).begin(), (a).end()
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
using ld = long double;
template<typename T1, typename T2> bool chkmin(T1 &x, T2 y) {
  return y < x ? (x = y, true) : false; 
}
template<typename T1, typename T2> bool chkmax(T1 &x, T2 y) {
  return y > x ? (x = y, true) : false;
}
void debug_out() {
  cerr << endl;
}
template<typename T1, typename... T2> void debug_out(T1 A, T2... B) {
  cerr << ' ' << A;
  debug_out(B...);
}
template<typename T> void mdebug_out(T* a, int n) {
  for (int i = 0; i < n; ++i) {
    cerr << a[i] << ' ';
  }
  cerr << endl;
}
#ifdef DEBUG
  #define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
  #define mdebug(a, n) cerr << #a << ": ", mdebug_out(a, n)
#else
  #define debug(...) 1337
  #define mdebug(a, n) 1337
#endif
template<typename T> ostream& operator << (ostream& stream, const vector<T> &v) {
  for (auto& x : v) {
    stream << x << ' ';
  }
  return stream;
}
template<typename T1, typename T2> ostream& operator << (ostream& stream, const pair<T1, T2>& p) {
  return stream << p.first << ' ' << p.second;
}

const int maxN = 1000006;
const int INF32 = 1e9;
int n;

namespace fnw {
  int f[maxN];
  void add(int i) {
    for (++i; i < maxN; i += i & -i) {
      ++f[i];
    } 
  }
  int pref(int i) {
    int ans = 0;
    for (++i; i >= 1; i -= i & -i) {
      ans += f[i];
    }
    return ans;
  }
}

namespace dsu {
  int q[maxN];
  void reset() {
    memset(q, 255, sizeof q);
  }
  int gt(int x) {
    return q[x] < 0 ? x : q[x] = gt(q[x]);
  }
  bool un(int x, int y) {
    x = gt(x);
    y = gt(y);
    if (x == y) return false;
    if (-q[x] < -q[y]) swap(x, y);
    q[x] += q[y];
    q[y] = x;
    return true;
  }
}

ll minimum_walk(vector<int> p, int s) {
  n = p.size();
  ll ans = 0;
  int mn = 1e9;
  int mx = -1e9;
  dsu::reset();
  for (int i = 0; i + 1 < n; ++i) {
    fnw::add(p[i]);
    int r = i + 1 - fnw::pref(i);
    if (r > 0) {
      ans += 2 * r;
      dsu::un(i, i + 1);
      chkmin(mn, i);
      chkmax(mx, i + 1);
    }
  }

  vector<int> comp(n, -1);
  vector<int> min_comp(n, INF32);
  int C = 0;
  for (int x = 0; x < n; ++x) if (comp[x] == -1) {
    int y = x;
    min_comp[C] = x;
    do {
      comp[y] = C;
      y = p[y];
    } while (y != x);
    ++C;
  }
  
  int mnD = INF32;
  for (int i = 0; i < n; ++i) {
    if (p[i] != i && i == min_comp[comp[i]]/*(i == 0 || dsu::gt(i) != dsu::gt(i - 1) || i == n - 1 || dsu::gt(i) != dsu::gt(i + 1))*/) {
      chkmin(mnD, labs(i - s));
    } 
  }
  if (mnD == INF32) return 0;
  for (int i = mn; i < mx; ++i) {
    if (dsu::un(i, i + 1)) {
      ans += 2;
    }
  }
  return ans + 2 * mnD;
}

#ifdef DEBUG
int32_t main() {
#ifdef DEBUG
  freopen("in", "r", stdin);
#endif
  ios::sync_with_stdio(0);
  cin.tie(0);

  int n, s;
  cin >> n >> s;
  vector<int> p(n);
  for (auto& x : p) cin >> x;
  cout << minimum_walk(p, s) << '\n';

  return 0;
}
#endif

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4172 KB Output is correct
2 Correct 3 ms 4172 KB Output is correct
3 Correct 3 ms 4172 KB Output is correct
4 Correct 2 ms 4172 KB Output is correct
5 Correct 3 ms 4172 KB Output is correct
6 Correct 2 ms 4172 KB Output is correct
7 Correct 3 ms 4172 KB Output is correct
8 Correct 3 ms 4172 KB Output is correct
9 Correct 3 ms 4172 KB Output is correct
10 Correct 3 ms 4172 KB Output is correct
11 Correct 3 ms 4172 KB Output is correct
12 Correct 3 ms 4172 KB Output is correct
13 Correct 3 ms 4172 KB Output is correct
14 Correct 3 ms 4172 KB Output is correct
15 Correct 3 ms 4208 KB Output is correct
16 Correct 3 ms 4172 KB Output is correct
17 Correct 2 ms 4172 KB Output is correct
18 Correct 3 ms 4176 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4172 KB Output is correct
2 Correct 3 ms 4172 KB Output is correct
3 Correct 3 ms 4172 KB Output is correct
4 Correct 2 ms 4172 KB Output is correct
5 Correct 3 ms 4172 KB Output is correct
6 Correct 2 ms 4172 KB Output is correct
7 Correct 3 ms 4172 KB Output is correct
8 Correct 3 ms 4172 KB Output is correct
9 Correct 3 ms 4172 KB Output is correct
10 Correct 3 ms 4172 KB Output is correct
11 Correct 3 ms 4172 KB Output is correct
12 Correct 3 ms 4172 KB Output is correct
13 Correct 3 ms 4172 KB Output is correct
14 Correct 3 ms 4172 KB Output is correct
15 Correct 3 ms 4208 KB Output is correct
16 Correct 3 ms 4172 KB Output is correct
17 Correct 2 ms 4172 KB Output is correct
18 Correct 3 ms 4176 KB Output is correct
19 Correct 3 ms 4172 KB Output is correct
20 Correct 3 ms 4172 KB Output is correct
21 Correct 3 ms 4172 KB Output is correct
22 Correct 3 ms 4172 KB Output is correct
23 Correct 3 ms 4172 KB Output is correct
24 Correct 3 ms 4172 KB Output is correct
25 Correct 3 ms 4172 KB Output is correct
26 Correct 3 ms 4172 KB Output is correct
27 Correct 3 ms 4172 KB Output is correct
28 Correct 4 ms 4300 KB Output is correct
29 Correct 3 ms 4172 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4172 KB Output is correct
2 Correct 3 ms 4172 KB Output is correct
3 Correct 3 ms 4172 KB Output is correct
4 Correct 2 ms 4172 KB Output is correct
5 Correct 3 ms 4172 KB Output is correct
6 Correct 2 ms 4172 KB Output is correct
7 Correct 3 ms 4172 KB Output is correct
8 Correct 3 ms 4172 KB Output is correct
9 Correct 3 ms 4172 KB Output is correct
10 Correct 3 ms 4172 KB Output is correct
11 Correct 3 ms 4172 KB Output is correct
12 Correct 3 ms 4172 KB Output is correct
13 Correct 3 ms 4172 KB Output is correct
14 Correct 3 ms 4172 KB Output is correct
15 Correct 3 ms 4208 KB Output is correct
16 Correct 3 ms 4172 KB Output is correct
17 Correct 2 ms 4172 KB Output is correct
18 Correct 3 ms 4176 KB Output is correct
19 Correct 3 ms 4172 KB Output is correct
20 Correct 3 ms 4172 KB Output is correct
21 Correct 3 ms 4172 KB Output is correct
22 Correct 3 ms 4172 KB Output is correct
23 Correct 3 ms 4172 KB Output is correct
24 Correct 3 ms 4172 KB Output is correct
25 Correct 3 ms 4172 KB Output is correct
26 Correct 3 ms 4172 KB Output is correct
27 Correct 3 ms 4172 KB Output is correct
28 Correct 4 ms 4300 KB Output is correct
29 Correct 3 ms 4172 KB Output is correct
30 Correct 263 ms 23676 KB Output is correct
31 Correct 296 ms 23660 KB Output is correct
32 Correct 171 ms 23664 KB Output is correct
33 Correct 191 ms 23712 KB Output is correct
34 Correct 213 ms 23740 KB Output is correct
35 Correct 203 ms 23808 KB Output is correct
36 Correct 200 ms 23660 KB Output is correct
37 Correct 242 ms 23676 KB Output is correct
38 Correct 190 ms 23676 KB Output is correct
39 Correct 198 ms 23660 KB Output is correct
40 Correct 202 ms 23748 KB Output is correct
41 Correct 221 ms 23680 KB Output is correct
42 Correct 210 ms 23748 KB Output is correct
43 Correct 215 ms 23748 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 4176 KB 3rd lines differ - on the 1st token, expected: '3304', found: '2744'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4172 KB Output is correct
2 Correct 3 ms 4172 KB Output is correct
3 Correct 3 ms 4172 KB Output is correct
4 Correct 2 ms 4172 KB Output is correct
5 Correct 3 ms 4172 KB Output is correct
6 Correct 2 ms 4172 KB Output is correct
7 Correct 3 ms 4172 KB Output is correct
8 Correct 3 ms 4172 KB Output is correct
9 Correct 3 ms 4172 KB Output is correct
10 Correct 3 ms 4172 KB Output is correct
11 Correct 3 ms 4172 KB Output is correct
12 Correct 3 ms 4172 KB Output is correct
13 Correct 3 ms 4172 KB Output is correct
14 Correct 3 ms 4172 KB Output is correct
15 Correct 3 ms 4208 KB Output is correct
16 Correct 3 ms 4172 KB Output is correct
17 Correct 2 ms 4172 KB Output is correct
18 Correct 3 ms 4176 KB Output is correct
19 Correct 3 ms 4172 KB Output is correct
20 Correct 3 ms 4172 KB Output is correct
21 Correct 3 ms 4172 KB Output is correct
22 Correct 3 ms 4172 KB Output is correct
23 Correct 3 ms 4172 KB Output is correct
24 Correct 3 ms 4172 KB Output is correct
25 Correct 3 ms 4172 KB Output is correct
26 Correct 3 ms 4172 KB Output is correct
27 Correct 3 ms 4172 KB Output is correct
28 Correct 4 ms 4300 KB Output is correct
29 Correct 3 ms 4172 KB Output is correct
30 Correct 263 ms 23676 KB Output is correct
31 Correct 296 ms 23660 KB Output is correct
32 Correct 171 ms 23664 KB Output is correct
33 Correct 191 ms 23712 KB Output is correct
34 Correct 213 ms 23740 KB Output is correct
35 Correct 203 ms 23808 KB Output is correct
36 Correct 200 ms 23660 KB Output is correct
37 Correct 242 ms 23676 KB Output is correct
38 Correct 190 ms 23676 KB Output is correct
39 Correct 198 ms 23660 KB Output is correct
40 Correct 202 ms 23748 KB Output is correct
41 Correct 221 ms 23680 KB Output is correct
42 Correct 210 ms 23748 KB Output is correct
43 Correct 215 ms 23748 KB Output is correct
44 Incorrect 3 ms 4176 KB 3rd lines differ - on the 1st token, expected: '3304', found: '2744'
45 Halted 0 ms 0 KB -