oj.uz

Submission #321286

# Submission time Handle Problem Language Result Execution time Memory
321286 2020-11-11T22:39:10 Z VROOM_VARUN Ancient Books (IOI17_books) C++14
50 / 100
 221 ms 26816 KB 
/*
ID: varunra2
LANG: C++
TASK: books
*/

#include <bits/stdc++.h>
using namespace std;

#ifdef DEBUG
#include "lib/debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define debug_arr(...) \
  cerr << "[" << #__VA_ARGS__ << "]:", debug_arr(__VA_ARGS__)
#pragma GCC diagnostic ignored "-Wsign-compare"
//#pragma GCC diagnostic ignored "-Wunused-parameter"
//#pragma GCC diagnostic ignored "-Wunused-variable"
#else
#define debug(...) 42
#endif

#define EPS 1e-9
#define IN(A, B, C) assert(B <= A && A <= C)
#define INF (int)1e9
#define MEM(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define MP make_pair
#define PB push_back
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define x first
#define y second

const double PI = acos(-1.0);
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef map<int, int> MPII;
typedef multiset<int> MSETI;
typedef set<int> SETI;
typedef set<string> SETS;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef vector<string> VS;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto& a : x)
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef vector<int> vi;
#pragma GCC diagnostic ignored "-Wsign-compare"
// util functions

int s;
int n;
int targl, targr;
int cycs = 0;
VI wcyc;
VI lcyc;
VI rcyc;
ll retgood = 0;
ll retbad = 0;

void init(VI& order) {
  n = sz(order);
  targl = s;
  targr = s;
  wcyc.assign(n, -1);
  lcyc.resize(n);
  rcyc.resize(n);
}

void extend(int& l, int& r) {
  // can we move l or r?
  int nl, nr;
  nl = min(lcyc[wcyc[l]], lcyc[wcyc[r]]);
  nr = max(rcyc[wcyc[l]], rcyc[wcyc[r]]);

  while (nl < l or nr > r) {
    if (l > nl) {
      l--;
      nl = min(nl, lcyc[wcyc[l]]);
      nr = max(nr, rcyc[wcyc[r]]);
    } else {
      r++;
      nl = min(nl, lcyc[wcyc[r]]);
      nr = max(nr, rcyc[wcyc[r]]);
    }
  }
}

ll solve() {
  int l = s, r = s;
  do {
    // debug(l, r, targl, targr);
    extend(l, r);
    // debug(l, r, targl, targr);

    int costl = 0, costr = 0, ll = l, lr = r, rl = l, rr = r;
    bool next = false;

    while (true) {
      if (ll <= targl) break;
      ll--;
      extend(ll, lr);
      costl += 2;
      if (lr > r) {
        next = true;
        break;
      }
    }

    while (true) {
      if (rr >= targr or rl < l) break;
      rr++;
      extend(rl, rr);
      costl += 2;
    }

    if (next)
      retbad += min(costl, costr);
    else
      retbad += (costl + costr);

    l = min(ll, rl);
    r = max(rr, lr);

    // debug(l, r, targl, targr, l > targl, r < targr);

  } while (l > targl or r < targr);

  return retbad;
}

ll minimum_walk(VI order, int s) {
  ::s = s;
  init(order);
  for (int i = 0; i < n; i++) {
    debug(i);
    retgood += abs(i - order[i]);
    if (wcyc[i] != -1) continue;
    int pos = i;
    lcyc[cycs] = i;
    rcyc[cycs] = i;
    do {
      wcyc[pos] = cycs;
      rcyc[cycs] = max(rcyc[cycs], pos);
      pos = order[pos];
    } while (pos != i);
    if (i != order[i]) {
      targl = min(targl, lcyc[cycs]);
      targr = max(targr, rcyc[cycs]);
    }
    cycs++;
  }
  return retgood + solve();
}

// int main() {
// #ifndef ONLINE_JUDGE
//   freopen("books.in", "r", stdin);
//   freopen("books.out", "w", stdout);
// #endif
//   cin.sync_with_stdio(0);
//   cin.tie(0);

//   int n, s;
//   cin >> n >> s;
//   VI order(n);

//   for (int i = 0; i < n; i++) {
//     cin >> order[i];
//   }

//   cout << minimum_walk(order, s) << '\n';

//   return 0;
// }

Compilation message

books.cpp: In function 'll minimum_walk(VI, int)':
books.cpp:19:20: warning: statement has no effect [-Wunused-value]
   19 | #define debug(...) 42
      |                    ^~
books.cpp:140:5: note: in expansion of macro 'debug'
  140 |     debug(i);
      |     ^~~~~

Subtask #1
12.0 / 12.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 0 ms 364 KB Output is correct
12 Correct 0 ms 364 KB Output is correct
13 Correct 0 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 0 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 0 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 368 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 220 ms 26596 KB Output is correct
31 Correct 221 ms 26596 KB Output is correct
32 Correct 150 ms 26720 KB Output is correct
33 Correct 174 ms 26596 KB Output is correct
34 Correct 164 ms 26816 KB Output is correct
35 Correct 175 ms 26596 KB Output is correct
36 Correct 150 ms 26596 KB Output is correct
37 Correct 148 ms 26596 KB Output is correct
38 Correct 148 ms 26524 KB Output is correct
39 Correct 149 ms 26720 KB Output is correct
40 Correct 151 ms 26596 KB Output is correct
41 Correct 171 ms 26596 KB Output is correct
42 Correct 164 ms 26596 KB Output is correct
43 Correct 160 ms 26600 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 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 1 ms 492 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 0 ms 364 KB Output is correct
12 Correct 0 ms 364 KB Output is correct
13 Correct 0 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 0 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 0 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 368 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 220 ms 26596 KB Output is correct
31 Correct 221 ms 26596 KB Output is correct
32 Correct 150 ms 26720 KB Output is correct
33 Correct 174 ms 26596 KB Output is correct
34 Correct 164 ms 26816 KB Output is correct
35 Correct 175 ms 26596 KB Output is correct
36 Correct 150 ms 26596 KB Output is correct
37 Correct 148 ms 26596 KB Output is correct
38 Correct 148 ms 26524 KB Output is correct
39 Correct 149 ms 26720 KB Output is correct
40 Correct 151 ms 26596 KB Output is correct
41 Correct 171 ms 26596 KB Output is correct
42 Correct 164 ms 26596 KB Output is correct
43 Correct 160 ms 26600 KB Output is correct
44 Incorrect 1 ms 364 KB 3rd lines differ - on the 1st token, expected: '3304', found: '2744'
45 Halted 0 ms 0 KB -