Submission #56882952


Source Code Expand

#include <bits/stdc++.h>
#define pii pair<int,int>
#define pil pair<int,long long>
#define pll pair<long long,long long>
#define mp_ make_pair
#define pb_ push_back
#define pob_ pop_back
#define fst first
#define snd second
#define debug cout<<"********\n";
#define reset(x,y) memset(x,y,sizeof(x))
#define fi(x) freopen(x,"r",stdin)
#define fo(x) freopen(x,"w",stdout)
#define iosf ios::sync_with_stdio(0);cin.tie(0);
#define prec(x) cout<<setprecision(x);
#define prec0(x) cout<<fixed<<setprecision(x);
#define Misaka16172 sb
#define kamisako femboy

using ll = long long;
using ld = long double;
using db = double;
using ull = unsigned long long;
using uint = unsigned int;

constexpr int inf = 0x3f3f3f3f;
constexpr ll INF = 0x3f3f3f3f3f3f3f3f;
constexpr ull mod1 = 1e9+7,mod9 = 998244353;

using namespace std;

template <class T>
inline void read(T &x){
    x = 0;T w = 1;
    char c = 0;
    while(!isdigit(c)){
        if(c=='-')  w = -1;
        c = getchar();
    }
    while(isdigit(c)){
        x = ((x<<3)+(x<<1))+c-'0';
        c = getchar();
    }
    x = x*w;
}
template<class T,typename ...Args>
inline void read(T &x,Args &...rest){read(x);read(rest...);}

template<class T>
inline void write(T x){
    if(!x)  return putchar('0'),void();
    else if(x<0) putchar('-'),x*=-1;
    int st[40],t = 0;
    while(x){st[++t] = x%10,x/=10;}
    while(t){putchar(st[t--]+'0');}
}

template <class T>
inline string bin(T x,int d = 0){return (((d>1)||(x>>1))?bin(x>>1,d-1):"")+to_string(x&1);}

int Test = 1,Case = 1;

constexpr int N = 2e5+5;

int col[N],id[N],to[N],sz[N],a[N],deg[N],n;
int fa[N];
bool ring[N];
vector<int> p[N];
ll k;

void dfs(int u,int x,int c){
	sz[c]++,p[c].pb_(u);
	id[u] = x,col[u] = c;
	if(!col[to[u]])	dfs(to[u],x+1,c);
}

deque<int> dq;
vector<int> tr[N];
pii ans[N];

void dfs2(int u,int f){
    dq.pb_(u);
    ans[u].fst = ans[f].fst,ans[u].snd = ans[f].snd+1;
    if(dq.size()>k) fa[u] = dq.front(),dq.pop_front();
    for(int v:tr[u]){
        if(v==f || ring[v]) continue;
        dfs2(v,u);
    }
    if(fa[u]) dq.push_front(fa[u]);
    dq.pob_();
}

void solve(){
    read(n,k);
    for(int i=1;i<=n;i++)	read(to[i]),deg[to[i]]++,tr[to[i]].pb_(i);
    for(int i=1;i<=n;i++)	read(a[i]);
    queue<int> q;
	for(int i=1;i<=n;i++){
		ring[i] = 1;
		if(!deg[i])	q.push(i);
	}
	while(!q.empty()){
		int u = q.front();q.pop();
		ring[u] = 0,deg[to[u]]--;
		if(!deg[to[u]])	q.push(to[u]);
	}
    int cnt = 0;
    for(int i=1;i<=n;i++){
    	if(!ring[i])	continue;
        ans[i] = {i,-1},dfs2(i,i);
    	if(!col[i])	++cnt,dfs(i,0,cnt);
    }
    for(int i=1;i<=n;i++){
    	int u = ans[i].fst,d = ans[i].snd;
    	ll now = k-d;
    	if(now<0)  write(a[fa[i]]),putchar(' ');
    	else    write(a[p[col[u]][(now+id[u])%sz[col[u]]]]),putchar(' ');
    }
}

int main(){
//  read(Test);
    for(;Case<=Test;++Case) solve();
    return 0;
}

Submission Info

Submission Time
Task E - Permute K times
User Misaka16172
Language C++ 23 (Clang 16.0.6)
Score 450
Code Size 2994 Byte
Status AC
Exec Time 64 ms
Memory 31908 KiB

Compile Error

./Main.cpp:84:17: warning: comparison of integers of different signs: 'size_type' (aka 'unsigned long') and 'll' (aka 'long long') [-Wsign-compare]
    if(dq.size()>k) fa[u] = dq.front(),dq.pop_front();
       ~~~~~~~~~^~
./Main.cpp:26:15: warning: unused variable 'inf' [-Wunused-const-variable]
constexpr int inf = 0x3f3f3f3f;
              ^
./Main.cpp:27:14: warning: unused variable 'INF' [-Wunused-const-variable]
constexpr ll INF = 0x3f3f3f3f3f3f3f3f;
             ^
./Main.cpp:28:15: warning: unused variable 'mod1' [-Wunused-const-variable]
constexpr ull mod1 = 1e9+7,mod9 = 998244353;
              ^
./Main.cpp:28:28: warning: unused variable 'mod9' [-Wunused-const-variable]
constexpr ull mod1 = 1e9+7,mod9 = 998244353;
                           ^
5 warnings generated.

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 450 / 450
Status
AC × 3
AC × 83
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_40.txt, test_41.txt, test_42.txt, test_43.txt, test_44.txt, test_45.txt, test_46.txt, test_47.txt, test_48.txt, test_49.txt, test_50.txt, test_51.txt, test_52.txt, test_53.txt, test_54.txt, test_55.txt, test_56.txt, test_57.txt, test_58.txt, test_59.txt, test_60.txt, test_61.txt, test_62.txt, test_63.txt, test_64.txt, test_65.txt, test_66.txt, test_67.txt, test_68.txt, test_69.txt, test_70.txt, test_71.txt, test_72.txt, test_73.txt, test_74.txt, test_75.txt, test_76.txt, test_77.txt, test_78.txt, test_79.txt, test_80.txt
Case Name Status Exec Time Memory
sample_01.txt AC 2 ms 3540 KiB
sample_02.txt AC 2 ms 3488 KiB
sample_03.txt AC 2 ms 3552 KiB
test_01.txt AC 2 ms 3560 KiB
test_02.txt AC 2 ms 3436 KiB
test_03.txt AC 14 ms 8420 KiB
test_04.txt AC 56 ms 20860 KiB
test_05.txt AC 53 ms 19220 KiB
test_06.txt AC 32 ms 14332 KiB
test_07.txt AC 4 ms 4324 KiB
test_08.txt AC 14 ms 8288 KiB
test_09.txt AC 35 ms 14632 KiB
test_10.txt AC 57 ms 20896 KiB
test_11.txt AC 54 ms 20732 KiB
test_12.txt AC 8 ms 6156 KiB
test_13.txt AC 30 ms 12620 KiB
test_14.txt AC 57 ms 20660 KiB
test_15.txt AC 6 ms 5444 KiB
test_16.txt AC 18 ms 9908 KiB
test_17.txt AC 10 ms 7220 KiB
test_18.txt AC 12 ms 7628 KiB
test_19.txt AC 27 ms 12896 KiB
test_20.txt AC 55 ms 20772 KiB
test_21.txt AC 56 ms 20768 KiB
test_22.txt AC 3 ms 3972 KiB
test_23.txt AC 41 ms 31888 KiB
test_24.txt AC 32 ms 20728 KiB
test_25.txt AC 32 ms 20768 KiB
test_26.txt AC 40 ms 31852 KiB
test_27.txt AC 32 ms 20716 KiB
test_28.txt AC 31 ms 20788 KiB
test_29.txt AC 6 ms 5388 KiB
test_30.txt AC 53 ms 21416 KiB
test_31.txt AC 56 ms 20960 KiB
test_32.txt AC 4 ms 4588 KiB
test_33.txt AC 54 ms 19552 KiB
test_34.txt AC 55 ms 20620 KiB
test_35.txt AC 24 ms 12296 KiB
test_36.txt AC 3 ms 3776 KiB
test_37.txt AC 24 ms 11972 KiB
test_38.txt AC 8 ms 6728 KiB
test_39.txt AC 53 ms 21556 KiB
test_40.txt AC 53 ms 21516 KiB
test_41.txt AC 48 ms 18052 KiB
test_42.txt AC 10 ms 5904 KiB
test_43.txt AC 8 ms 5740 KiB
test_44.txt AC 48 ms 17304 KiB
test_45.txt AC 13 ms 7428 KiB
test_46.txt AC 9 ms 6184 KiB
test_47.txt AC 46 ms 16776 KiB
test_48.txt AC 15 ms 7756 KiB
test_49.txt AC 31 ms 13492 KiB
test_50.txt AC 50 ms 17972 KiB
test_51.txt AC 50 ms 17920 KiB
test_52.txt AC 20 ms 9436 KiB
test_53.txt AC 11 ms 6836 KiB
test_54.txt AC 52 ms 17672 KiB
test_55.txt AC 14 ms 7708 KiB
test_56.txt AC 25 ms 11288 KiB
test_57.txt AC 22 ms 10260 KiB
test_58.txt AC 9 ms 5900 KiB
test_59.txt AC 51 ms 17732 KiB
test_60.txt AC 54 ms 17980 KiB
test_61.txt AC 37 ms 31908 KiB
test_62.txt AC 37 ms 31832 KiB
test_63.txt AC 37 ms 31892 KiB
test_64.txt AC 38 ms 31904 KiB
test_65.txt AC 22 ms 12716 KiB
test_66.txt AC 32 ms 15372 KiB
test_67.txt AC 15 ms 10472 KiB
test_68.txt AC 9 ms 6860 KiB
test_69.txt AC 38 ms 17856 KiB
test_70.txt AC 60 ms 21136 KiB
test_71.txt AC 64 ms 26808 KiB
test_72.txt AC 57 ms 18736 KiB
test_73.txt AC 12 ms 8800 KiB
test_74.txt AC 62 ms 21672 KiB
test_75.txt AC 51 ms 18936 KiB
test_76.txt AC 50 ms 18124 KiB
test_77.txt AC 23 ms 8912 KiB
test_78.txt AC 21 ms 8160 KiB
test_79.txt AC 23 ms 8852 KiB
test_80.txt AC 20 ms 8160 KiB