oj.uz

답안 #708141

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

using i64 = long long;
constexpr i64 inf = 1ll << 50;

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<i64> imos(n), imos2(n);
    for (int i = 0; i < n; ++i) {
        int a = i, b = p[i];
        if (a > b) std::swap(a, b);
        ++imos[a];
        --imos[b];
        if (a != b) {
            ++imos2[a];
            --imos2[b - 1];
        }
    }
    for (int i = 0; i < n - 1; ++i) {
        imos[i + 1] += imos[i];
        imos2[i + 1] += imos2[i];
    }
    i64 baseCost = std::accumulate(imos.begin(), imos.end(), 0ll);

    auto solve = [&](const int f) {
        i64 x = 0, c = 0;
        for (int i = f; i < n; ++i) {
            if (imos[i] == 0) {
                ++c;
            }
            if (imos[i] != 0) {
                x += c;
                c = 0;
            }
        }
        c = 0;
        for (int i = f - 1; i >= 0; --i) {
            if (imos[i] == 0) {
                ++c;
            }
            if (imos[i] != 0) {
                x += c;
                c = 0;
            }
        }
        return x;
    };
    const auto u = solve(s);
    i64 m = inf;
    for (int i = s; i < n; ++i) {
        if (imos2[i] == 0) {
            m = std::min(m, (i64)i - s);
        }
    }
    for (int i = s - 1; i >= 0; --i) {
        if (i == 0 or imos2[i] == 0) {
            m = std::min(m, (i64)s - i);
        }
    }
    return baseCost + 2 * (solve(s) + (imos[s] == 0 ? 0 : m));
}

Compilation message

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:53:16: warning: unused variable 'u' [-Wunused-variable]
   53 |     const auto u = solve(s);
      |                ^

Subtask #1
0 / 12.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 28.0

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

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB 3rd lines differ - on the 1st token, expected: '3304', found: '3594'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

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