oj.uz

Submission #301968

# Submission time Handle Problem Language Result Execution time Memory
301968 2020-09-18T10:41:16 Z kevlee Ancient Books (IOI17_books) C++17
0 / 100
 1 ms 512 KB 
#include "books.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mod 1000000007
#define h1 7897897897897897
#define h2 7897466719774591
#define b1 98762051
#define b2 98765431
#define inf 1000000000
#define pi 3.1415926535897932384626
#define LMAX 9223372036854775807
#define ll long long
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define vp vector<pii>
#define SET(a, b) memset(a, b, sizeof(a))
#define all(x) (x).begin(), (x).end()
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
bool first_cycle;
int p[1000005], n;
bool vis[1000005];
ll ans;
void dfs(int x) {
  if (vis[x]) return;
  vis[x] = true;
  ans += abs(x - p[x]);
  dfs(p[x]);
}
long long minimum_walk(vector<int> perm, int s) {
  n = perm.size();
  FOR(i, 0, n-1) p[i] = perm[i];
  int furthest = 0;
  vi v;
  FOR(i, 0, n-1) {
    if (!vis[i]) {
      dfs(i);
      v.pb(i);
    }
  }
  if (v.size() == 1) {
    return ans;
  }
  ans += v.back();
  int closest = 0;
  int cur = p[0];
  while (cur != 0) {
    if (cur < v[1]) closest = max(closest, cur);
    cur = p[cur];
  }
  ans += abs(v.back() - closest);
	return ans;
}

Compilation message

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:38:7: warning: unused variable 'furthest' [-Wunused-variable]
   38 |   int furthest = 0;
      |       ^~~~~~~~

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Incorrect 1 ms 384 KB 3rd lines differ - on the 1st token, expected: '6', found: '8'
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Incorrect 1 ms 384 KB 3rd lines differ - on the 1st token, expected: '6', found: '8'
3 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Incorrect 1 ms 384 KB 3rd lines differ - on the 1st token, expected: '6', found: '8'
3 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

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

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Incorrect 1 ms 384 KB 3rd lines differ - on the 1st token, expected: '6', found: '8'
3 Halted 0 ms 0 KB -