oj.uz

답안 #805507

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
805507 2023-08-03T17:16:09 Z HaroldVemeno 고대 책들 (IOI17_books) C++17
0 / 100
 1 ms 308 KB 
#include "books.h"
#include <bits/stdc++.h>

#ifdef GUDEB
    #define D(x) cerr << #x << ": " << (x) << '\n';
    #define ifdeb if(true)
#else
    #define D(x) ;
    #define ifdeb if(false)
#endif

#define all(x) begin(x), end(x)

using namespace std;
using ull = unsigned long long;
using ll = long long;
using pii = pair<int, int>;
// #define int ll;

struct N {
    int c;
    int i;

    friend bool operator < (const N& a, const N& b) {
        return a.c > b.c;
    }
};

int n;
ll ret = 0;
priority_queue<N> q;
bool vis[1000000];


long long minimum_walk(vector<int> p, int s) {
    n = p.size();
    for(int i = 0; i < n; ++i) {
        if(p[i] == i) vis[i] = true;
        ret += abs(i - p[i]);
    }
    vis[s] = false;
    q.push({0, s});

    while(!q.empty()) {
        N t = q.top();
        q.pop();
        D(t.i)
        D(t.c)
        if(vis[t.i]) continue;
        ret += 2*t.c;
        D(ret)
        vis[t.i] = true;
        q.push({0, p[t.i]});
        {
            int ln = t.i+1;
            if(ln < n && ln == p[ln]) ++ln;
            if(ln != n) {
                q.push({ln - t.i, ln});
            }
        }
        {
            int rn = t.i-1;
            if(rn >= 0 && rn == p[rn]) --rn;
            if(rn >= 0) {
                q.push({t.i - rn, rn});
            }
        }
    }

	return ret;
}

Subtask #1
0 / 12.0

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

Subtask #5
0 / 30.0

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