oj.uz

Submission #893193

# Submission time Handle Problem Language Result Execution time Memory
893193 2023-12-26T16:42:25 Z vjudge1 Ancient Books (IOI17_books) C++17
0 / 100
 1 ms 504 KB 
#include "books.h"

#include <bits/stdc++.h>

using namespace std;

using vi = vector<int>;

long long minimum_walk(vi p, int s) {
    int n = p.size();
    vi ip(n);
    for(int i = 0; i < n; ++i)
        ip[p[i]] = i;
    int re = 0, nrcic = 0;
    vi vis(n, 0), cul(n, 0), alb(n, 0);
    for(int i = 0; i < n; ++i) {
        if(!vis[i]) {
            int u = i;
            while(!vis[u]) {
                vis[u] = 1;
                cul[u] = nrcic;
                u = p[u];
            }
            alb[nrcic] = (i == p[i]);
            nrcic++;
        }
    }
  //  cout << "alb: ";
  //  for(auto it : alb) cout << it << " ";
  //  cout << "\n";
    vector<vi> L(nrcic);
    for(int i = 0; i + 1 < n; ++i) {
        if(cul[i] != cul[i + 1]) {
            L[cul[i]].push_back(cul[i + 1]);
            L[cul[i + 1]].push_back(cul[i]);
        }
    }
    for(int i = 0; i < nrcic; ++i) {
        sort(L[i].begin(), L[i].end());
        L[i].resize(unique(L[i].begin(), L[i].end()) - L[i].begin());
    }
    for(int i = 0; i < n; ++i)
        re += abs(i - p[i]);
    int rec = alb[cul[s]];
    for(int i = 0; i < nrcic; ++i)
        rec += !alb[i];
    vi viz(nrcic, 0);
    function<int(int)> dfs = [&](int u) {
        viz[u] = 1;
        int re = !alb[u];
        for(auto it : L[u]) 
            if(!viz[it] && !alb[it]) {
                re += dfs(it);
            }
        for(auto it : L[u]) 
            if(!viz[it] && alb[it]) {
                if(dfs(it)) {
                    ++rec;
                    ++re;
                }
            }
        return !!re;
    };
  //  for(auto it : cul)
  //      cout << it << " ";
  //  cout << "\n";
    dfs(cul[s]);
    //cout << "rec e " << rec << "\n";
	return re + 2 * (rec - 1);
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 504 KB Output is correct
6 Incorrect 1 ms 348 KB 3rd lines differ - on the 1st token, expected: '8', found: '10'
7 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 504 KB Output is correct
6 Incorrect 1 ms 348 KB 3rd lines differ - on the 1st token, expected: '8', found: '10'
7 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 504 KB Output is correct
6 Incorrect 1 ms 348 KB 3rd lines differ - on the 1st token, expected: '8', found: '10'
7 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB 3rd lines differ - on the 1st token, expected: '3304', found: '4106'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 504 KB Output is correct
6 Incorrect 1 ms 348 KB 3rd lines differ - on the 1st token, expected: '8', found: '10'
7 Halted 0 ms 0 KB -