Submission #1259781

#TimeUsernameProblemLanguageResultExecution timeMemory
1259781FaggiAncient Books (IOI17_books)C++20
0 / 100
1 ms324 KiB
#include <bits/stdc++.h>
#define ll long long
#define sz(x) int(x.size())
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define fr first
#define se second
using namespace std;
long long minimum_walk(std::vector<int> p, int s)
{
    ll i, j, n = sz(p), pos, ult = s, tot = 0, in = s;
    ll ul = 0;
    for (j = 0; j < sz(p); j++)
    {
        if (p[j] != j)
            ul = j;
    }
    tot = (ul * 2);
    return tot;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...