QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#457722	#8838. Jesse's Job	ucup-team180^#	WA	1ms	3788kb	C++17	1.0kb	2024-06-29 13:46:28	2024-06-29 13:46:29

Judging History

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

[2024-06-29 13:46:29]
评测

测评结果：WA
用时：1ms
内存：3788kb

查看

[2024-06-29 13:46:28]
提交

answer

#include <bits/stdc++.h>
using namespace std;
int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int t;
  cin >> t;
  for (int i = 0; i < t; i++){
    int n;
    cin >> n;
    vector<int> p(n);
    for (int j = 0; j < n; j++){
      cin >> p[j];
      p[j]--;
    }
    vector<bool> used(n, false);
    for (int j = 0; ; j = p[j]){
      if (used[j]){
        break;
      }
      used[j] = true;
    }
    if (used != vector<bool>(n, true)){
      vector<int> idx;
      for (int j = 0; j < n; j++){
        if (used[j]){
          idx.push_back(j);
        }
      }
      int k = idx.size();
      cout << n << '\n';
      cout << k << '\n';
      for (int j = 0; j < k; j++){
        cout << idx[j] + 1 << ' ';
      }
      cout << '\n';
    } else {
      int a = 0;
      for (int j = 1; j < n; j++){
        if (abs(p[j] - j) < abs(p[a] - a)){
          a = j;
        }
      }
      cout << n - 1 - abs(p[a] - a) << '\n';
      cout << 1 << '\n';
      cout << a + 1 << '\n';
    }
  }
}

源文件, 语言: C++17

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 3788kb

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

Wrong Answer

time: 1ms

memory: 3560kb

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:

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