QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#475079	#8838. Jesse's Job	ucup-team3646^#	WA	1ms	3600kb	C++20	1.5kb	2024-07-13 11:05:36	2024-07-13 11:05:38

Judging History

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

[2024-07-13 11:05:38]
评测

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

查看

[2024-07-13 11:05:36]
提交

answer

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

using ll = long long;

struct UnionFind {
  int n;
  int siz;
  vector<int> par;

  UnionFind() = default;
  UnionFind(int n_) : n(n_), siz(n_), par(n_) {
    for (int i = 0; i < n; ++i) par[i] = i;
  }

  int root(int x) {
    if (par[x] == x) return x;
    else return par[x] = root(par[x]);
  }

  bool same(int x, int y) {
    return root(x) == root(y);
  }

  void merge(int x, int y) {
    if (same(x, y)) return;
    par[root(y)] = root(x);
    siz--;
    return;
  }

};

void solve() {
  ll N; cin >> N;
  vector<ll> P(N);
  for (auto &p : P) cin >> p, p--;

  UnionFind uf(N);
  for (int i = 0; i < N; ++i) {
    uf.merge(i, P[i]);
  }

  if (uf.siz > 1) {
    vector<ll> vec1, vec2;
    for (int i = 0; i < N; ++i) {
      if (uf.same(i, 0)) vec1.emplace_back(i);
      else vec2.emplace_back(i);
    }
    ll siz = vec1.size();

    cout << N << "\n";
    cout << siz << "\n";
    for (int i = 0; i < siz; ++i) {
      cout << vec1[i] + 1 << " \n"[i+1==siz];
    }

    return;
  }

  ll fix = -1, ans = -1;
  for (int i = 0; i < N; ++i) {
    ll tmp = N - 1 - abs(P[i] - i);
    if (tmp > ans) {
      fix = i;
      ans = tmp;
    }
  }
  cout << ans << "\n";
  cout << 1 << "\n";
  cout << fix + 1 << "\n";

  return;
}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(0);

  ll 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: 3600kb

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

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:

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

result:

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