QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#717131	#8838. Jesse's Job	123BVN	RE	44ms	3596kb	C++23	943b	2024-11-06 17:00:42	2024-11-06 17:00:42

Judging History

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

[2024-11-06 17:00:42]
评测

测评结果：RE
用时：44ms
内存：3596kb

查看

[2024-11-06 17:00:42]
提交

answer

#include<bits/stdc++.h>
#define int long long 
using namespace std;
const int N = 2e3 + 10;
const int mod = 1e9 + 7;
int n, m, k;
int f[N];
int flag;
vector<int>ans;
void solve() {
	cin >> n;
	ans.clear();
	for (int i = 1; i <= n; i++)cin >> f[i];
	vector<int>v;
	int pos;
	pos= f[f[1]];
	v.push_back(f[1]);
	while (pos != f[1]) {
		v.push_back(pos);
		pos = f[pos];
	}
	if (v.size() == n) {
		cout << n - 2 << endl;
		v.clear();
		pos = f[f[1]];
		v.push_back(f[1]);
		while (abs(pos-f[1])!=1) {
			v.push_back(pos);
			pos = f[pos];
		}
		if (v.size() == n) {
			v.clear();
			v.push_back(f[1]);
		}
	}
	else {
		cout << n << endl;
	}
	cout << v.size() << endl;
		for (auto it : v)cout << it << " "; cout << endl;
}
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int _ = 1;
	cin >> _;
	while (_--) {
		solve();
	}
}
/*
3
2
2 1
4
2 1 4 3
6
3 5 4 2 6 1

*/

Source code, Language: C++23

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3592kb

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: 3536kb

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: 0

Accepted

time: 44ms

memory: 3596kb

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
2 1 
7
6
5 7 3 2 6 1 
2
1
3 
5
4
4 6 7 2 
8
3
4 5 1 
6
3
3 8 6 
7
4
6 5 7 1 
8
7
8 6 5 7 4 2 1 
8
6
6 3 4 2 5 1 
8
2
8 1 
8
3
7 4 1 
8
6
2 3 4 5 8 1 
8
7
5 7 6 3 2 8 1 
8
5
3 8 5 7 1 
8
6
2 8 4 5 7 1 
6
3
8 2 4 
8
7
5 4 3 6 8 7 1 
8
6
2 4 7 6 8 1 
6
1
5 
7
1
1 
8
7
2 6 8 4 3 5 1 
4
2
4 2 
8
1
1 ...

result:

ok Correct (46232 test cases)

Test #4:

score: -100

Runtime Error

input:

1
999995
992870 210969 579550 405695 249895 436695 476463 929789 907510 311379 340877 491996 59204 996443 681309 483046 760005 905577 711115 275827 697004 450345 678866 276460 310113 542672 27 914370 232581 624905 590395 136666 628293 731656 670994 184745 662928 389422 848680 447853 325275 979617 82...