QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#658057	#8838. Jesse's Job	ucup-team3661^#	WA	80ms	3668kb	C++20	953b	2024-10-19 16:04:16	2024-10-19 16:04:21

Judging History

你现在查看的是最新测评结果

[2024-10-19 16:04:21]
评测

测评结果：WA
用时：80ms
内存：3668kb

查看

[2024-10-19 16:04:16]
提交

answer

#include<bits/stdc++.h>
using namespace std;

void solve(){
	int N; cin >> N;
	vector<int> P(N);
	for(int i = 0; i < N; i++){
		cin >> P[i];
		--P[i];
	}
	int cnt = 0;
	int now = 0;
	set<int> s;
	while(cnt == 0 || now != 0){
		cnt++;
		s.insert(now);
		now = P[now];
	}
	if(cnt != N){
		cout << N << endl;
		cout << s.size() << endl;
		for(auto c:s)cout << c+1 << ' ';
		cout << endl;
		return;
	}
	int ans = -1;
	int x = 0;
	bool flag = 0;
	for(int i = 0; i < N; i++){
		if(ans < N-abs(P[i]-i)-1){
			ans = N-abs(P[i]-i)-1;
			x = i;
			flag = 0;
		}
		if(N != 2 && ans < N-abs(P[P[i]]-i)-1){
			ans = N-abs(P[P[i]]-i)-1;
			x = i;
			flag = 1;
		}
	}
	cout << ans << endl;
	if(!flag){
		cout << 1 << endl;
		cout << x+1 << endl;
	}
	else{
		cout << 2 << endl;
		cout << x+1 << ' ' << P[x]+1 << ' ' << endl;
	}
	return;
}

int main(){
	int T; cin >> T;
	while(T--){
		solve();
	}
	return 0;
}

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3668kb

input:

3
2
2 1
4
2 1 4 3
6
3 5 4 2 6 1

output:

result:

ok Correct (3 test cases)

Test #2:

score: 0

Accepted

time: 4ms

memory: 3512kb

input:

872
6
1 5 2 6 3 4
6
5 2 1 3 4 6
4
2 1 3 4
6
2 3 1 4 5 6
6
4 5 1 6 2 3
6
6 2 3 1 4 5
5
2 1 3 4 5
6
1 2 6 4 3 5
4
2 1 4 3
6
1 6 4 2 5 3
6
6 1 3 5 4 2
6
2 1 4 5 6 3
6
3 4 1 5 6 2
6
4 1 5 3 2 6
6
5 2 1 6 3 4
6
4 1 6 2 5 3
6
5 1 3 6 2 4
6
6 2 5 4 3 1
6
6 2 5 3 1 4
6
5 2 4 1 3 6
6
6 1 3 2 4 5
6
2 3 4 6 5 ...

output:

result:

ok Correct (872 test cases)

Test #3:

score: -100

Wrong Answer

time: 80ms

memory: 3556kb

input:

46232
7
2 1 7 5 3 6 4
7
5 6 2 4 7 1 3
4
3 4 2 1
7
4 5 1 6 3 7 2
8
4 2 6 5 1 7 3 8
8
3 4 8 7 1 2 5 6
7
6 2 4 3 7 5 1
8
8 1 3 2 7 5 4 6
8
6 5 4 2 1 3 8 7
8
8 3 5 6 2 7 4 1
8
7 3 6 1 8 5 4 2
8
2 3 4 5 8 6 7 1
8
5 8 2 4 7 3 6 1
8
3 4 8 2 7 6 1 5
8
2 8 3 5 7 6 1 4
8
8 4 5 7 6 1 3 2
8
5 2 6 3 4 8 1 7
8
2 ...

output:

7
2
1 2 
7
6
1 2 3 5 6 7 
2
2
1 3 
5
2
2 5 
8
3
1 4 5 
6
2
4 7 
7
4
1 5 6 7 
8
7
1 2 4 5 6 7 8 
8
6
1 2 3 4 5 6 
8
2
1 8 
8
3
1 4 7 
8
6
1 2 3 4 5 8 
8
7
1 2 3 5 6 7 8 
8
5
1 3 5 7 8 
8
6
1 2 4 5 7 8 
6
2
1 8 
8
7
1 3 4 5 6 7 8 
8
6
1 2 4 6 7 8 
6
2
2 8 
7
1
1 
8
7
1 2 3 4 5 6 8 
4
2
1 4 
8
1
1 
8
1...

result:

wrong answer Jury found better answer than participant (test case 2337)