oj.uz

답안 #293031

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
293031 2020-09-07T15:40:33 Z Haunted_Cpp 고대 책들 (IOI17_books) C++17
0 / 100
 1 ms 512 KB 
#include "books.h"
#include <bits/stdc++.h>
using namespace std;


const int MAX_N = 1e6 + 5;
vector<int> p;

int last_p = -1;

long long solve(int idx, int carry) {
  int current_location = idx;
  int nxt_location = carry;
  if (current_location != nxt_location) {
    return abs(idx - nxt_location) + solve(nxt_location, carry);
  }
  assert(idx != -1);
  int was = p[current_location];
  p[current_location] = carry;
  assert(was != carry);
  carry = was;
  nxt_location = carry;
  if (carry == -1) {
    last_p = idx;
    return 0;
  }
  return abs(idx - nxt_location) + solve(nxt_location, carry);
}

long long minimum_walk(vector<int> p, int s) {
  assert(s == 0);
  ::p = p;
  const int n = p.size();
  long long res = 0;
  int idx = 0;
  for (int i = 0; i < n; i++) {
    if (p[i] != i) {
      int was = ::p[i];
      ::p[i] = -1;
      last_p = -1;
      res += abs(idx - i) + solve(i, was);
      if (is_sorted(::p.begin(), ::p.end())) {
        return last_p + res;
      }
      idx = last_p;
    }
  }
}

Compilation message

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:48:1: warning: control reaches end of non-void function [-Wreturn-type]
   48 | }
      | ^

Subtask #1
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Incorrect 0 ms 256 KB 3rd lines differ - on the 1st token, expected: '8', found: '10'
7 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Incorrect 0 ms 256 KB 3rd lines differ - on the 1st token, expected: '8', found: '10'
7 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Incorrect 0 ms 256 KB 3rd lines differ - on the 1st token, expected: '8', found: '10'
7 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 512 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Incorrect 0 ms 256 KB 3rd lines differ - on the 1st token, expected: '8', found: '10'
7 Halted 0 ms 0 KB -