Submission #245631

#	Time	Username	Problem	Language	Result	Execution time	Memory
245631		LittleFlowers__	고대 책들 (IOI17_books)	C++17	0 / 100	2080 ms	384 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<int> st;
    forinc(i,0,p.size()-1){
        if(p[i]!=i && !dd[i]){
            tot+=2;
            int j=i;
            int mi=i;
            do{
                tot+=abs(p[j]-j);
                j=p[j];
                dd[j]=1;
                mi=min(mi,j);
            } while(j!=p[j]);
            st.push_back(mi);
        }
    }
    st.push_back(0);
    sort(all(st)), st.erase(unique(all(st)),st.end());
    forinc(i,1,st.size()-1)
        tot+=st[i]-st[i-1];
    return tot;
}

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