oj.uz

답안 #708110

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
708110 2023-03-11T05:30:14 Z Cyanmond 고대 책들 (IOI17_books) C++17
0 / 100
 1 ms 300 KB 
#include "books.h"
#include <bits/stdc++.h>

using i64 = long long;

void chmax(i64 &a, i64 b) {
    if (a < b) a = b;
}

long long minimum_walk(std::vector<int> p, int s) {
    const int n = (int)p.size();
    std::vector<std::vector<int>> cycles;
    std::vector<i64> cycleCost;
    std::vector<bool> used(n);
    for (int i = 0; i < n; ++i) {
        if (used[i]) continue;
        int now = i;
        std::vector<int> cycle;
        i64 cost = 0;
        do {
            cycle.push_back(now);
            used[now] = true;
            const int nx = p[now];
            cost += std::abs(nx - now);
            now = nx;
        } while (now != i);
        if (cycle.size() == 1) {
            continue;
        }
        cycles.push_back(std::move(cycle));
        cycleCost.push_back(cost);
    }
    const int M = (int)cycles.size();
    i64 x = 0;
    for (const auto &vec : cycles) {
        chmax(x, *std::min_element(vec.begin(), vec.end()));
    }
    const i64 costSum = std::accumulate(cycleCost.begin(), cycleCost.end(), 0ll);
    return costSum + 2 * x;
}

Compilation message

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:33:15: warning: unused variable 'M' [-Wunused-variable]
   33 |     const int M = (int)cycles.size();
      |               ^

Subtask #1
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 300 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Incorrect 1 ms 212 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 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 300 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Incorrect 1 ms 212 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 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 300 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Incorrect 1 ms 212 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 Incorrect 1 ms 212 KB 3rd lines differ - on the 1st token, expected: '3304', found: '4728'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

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