Submission #245639

#	Time	Username	Problem	Language	Result	Execution time	Memory
245639		LittleFlowers__	Ancient Books (IOI17_books)	C++17	50 / 100	229 ms	21100 KiB

books

#include <bits/stdc++.h>
using namespace std;
#define in ({int x=0;int c=getchar(),n=0;for(;!isdigit(c);c=getchar()) n=(c=='-');for(;isdigit(c);c=getchar()) x=x*10+c-'0';n?-x:x;})
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l,int r){return l+rng()%(r-l+1);}
#define fasty ios_base::sync_with_stdio(0),cin.tie(0);
#define forinc(a,b,c) for(int a=b,_c=c;a<=_c;++a)
#define fordec(a,b,c) for(int a=b,_c=c;a>=_c;--a)
#define forv(a,b) for(auto&a:b)
#define fi first
#define se second
#define pb push_back
#define ii pair<int,int>
#define mt make_tuple
#define all(a) a.begin(),a.end()
#define reset(f, x) memset(f, x, sizeof(f))
#define gg exit(0);

long long minimum_walk(vector<int> p, int s){
    long long tot=0;
    vector<int> dd(p.size());
    vector<ii> q;
    forinc(i,0,p.size()-1){
        if(!dd[i]){
            if(i && p[i]==i) continue;
            int j=i;
            int mi=i;
            int ma=i;
            do{
                tot+=abs(p[j]-j);
                j=p[j];
                dd[j]=1;
                mi=min(mi,j);
                ma=max(ma,j);
            } while(j!=i);
            q.push_back({mi,ma});
        }
    }

    sort(all(q));

    int j=0;
    forv(i,q){
        if(i.se<=j) continue;
        if(i.fi>j) tot+=abs(j-i.fi)*2;
        j=max(j,i.se);
    }
    return tot;
}

• Subtask 1: 12 / 12
• Subtask 2: 10 / 10
• Subtask 3: 28 / 28
• Subtask 4: 0 / 20
• Subtask 5: 0 / 30