oj.uz

답안 #290678

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
290678 2020-09-04T10:24:33 Z SamAnd 고대 책들 (IOI17_books) C++17
22 / 100
 193 ms 23032 KB 
#include "books.h"
#include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
typedef long long ll;
const int N = 1003;

int n;

int bfs(vector<int> p, int s)
{
    for (int i = 0; i < n; ++i)
        ++p[i];
    map<pair<vector<int>, pair<int, int> >, int> mp;
    deque<pair<vector<int>, pair<int, int> > > q;
    q.push_back(m_p(p, m_p(s, 0)));
    mp[m_p(p, m_p(s, 0))] = 0;
    while (1)
    {
        pair<vector<int>, pair<int, int> > t = q.front();
        q.pop_front();
        bool z = true;
        if (t.se.fi != s)
            z = false;
        for (int i = 0; i < n; ++i)
        {
            if (t.fi[i] != i + 1)
            {
                z = false;
                break;
            }
        }
        if (z)
            return mp[t];

        pair<vector<int>, pair<int, int> > h;

        h = t;
        if (h.se.fi != n - 1)
        {
            ++h.se.fi;
            if (mp.find(h) == mp.end())
            {
                mp[h] = mp[t] + 1;
                q.push_back(h);
            }
        }

        h = t;
        if (h.se.fi != 0)
        {
            --h.se.fi;
            if (mp.find(h) == mp.end())
            {
                mp[h] = mp[t] + 1;
                q.push_back(h);
            }
        }

        h = t;
        swap(h.se.se, h.fi[h.se.fi]);
        if (mp.find(h) == mp.end())
        {
            mp[h] = mp[t];
            q.push_front(h);
        }
    }
}

bool c[N];
long long minimum_walk(std::vector<int> p, int s)
{
    n = sz(p);
    ll ans = 0;
    for (int i = 0; i < n; ++i)
    {
        ans += abs(i - p[i]);
    }
    for (int i = 0; i < n; ++i)
    {
        for (int j = min(i, p[i]); j < max(i, p[i]); ++j)
            c[j] = true;
    }
    for (int i = 0; i < n; ++i)
    {
        if (!c[i])
        {
            bool zl = false;
            bool zr = false;
            for (int j = 0; j <= i; ++j)
            {
                if (j != p[j])
                {
                    zl = true;
                    break;
                }
            }
            for (int j = i + 1; j < n; ++j)
            {
                if (j != p[j])
                {
                    zr = true;
                    break;
                }
            }
            if (zr)
                ans += 2;
        }
    }
    //printf("%d\n", bfs(p, s));
    return ans;
}

Compilation message

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:92:18: warning: variable 'zl' set but not used [-Wunused-but-set-variable]
   92 |             bool zl = false;
      |                  ^~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 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 Correct 1 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 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 Correct 1 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 1 ms 256 KB Output is correct
24 Correct 1 ms 256 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 256 KB Output is correct
28 Correct 1 ms 256 KB Output is correct
29 Correct 1 ms 256 KB Output is correct

Subtask #3
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 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 Correct 1 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 1 ms 256 KB Output is correct
24 Correct 1 ms 256 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 256 KB Output is correct
28 Correct 1 ms 256 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Runtime error 193 ms 23032 KB Execution killed with signal 11
31 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

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

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 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 Correct 1 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 1 ms 256 KB Output is correct
24 Correct 1 ms 256 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 256 KB Output is correct
28 Correct 1 ms 256 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Runtime error 193 ms 23032 KB Execution killed with signal 11
31 Halted 0 ms 0 KB -