QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#540537#8940. Piggy Sortucup-team987#RE 1ms3680kbC++202.2kb2024-08-31 17:16:272024-08-31 17:16:28

Judging History

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

  • [2024-08-31 17:16:28]
  • 评测
  • 测评结果:RE
  • 用时:1ms
  • 内存:3680kb
  • [2024-08-31 17:16:27]
  • 提交

answer

#if __INCLUDE_LEVEL__ == 0

#include __BASE_FILE__

void Solve() {
  int n, m;
  IN(n, m);
  vector x(m, pair(INT64_C(0), vector<int64_t>(n)));
  for (int t : Rep(0, m)) {
    for (int i : Rep(0, n)) {
      IN(x[t].second[i]);
      x[t].first += x[t].second[i];
    }
  }
  ranges::sort(x);

  vector<pair<int64_t, int>> v(n);
  for (int i : Rep(0, n)) {
    for (int j : Rep(0, n)) {
      if (j && x[1].second[j - 1] == x[1].second[j]) {
        continue;
      }
      bool ok = true;
      int64_t t1 = x[1].first - x[0].first;
      int64_t x1 = x[1].second[j] - x[0].second[i];
      for (int t : Rep(2, m)) {
        int64_t t2 = x[t].first - x[0].first;
        if (x1 * t2 % t1 == 0 && ranges::binary_search(x[t].second, x[0].second[i] + x1 * t2 / t1)) {
        } else {
          ok = false;
          break;
        }
      }
      if (ok) {
        v[i] = {x1, i};
      }
    }
  }
  ranges::sort(v);

  vector<int> ans(n);
  for (int k : Rep(0, n)) {
    ans[v[k].second] = k + 1;
  }
  OUT(ans);
}

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

  int t;
  IN(t);
  while (t--) {
    Solve();
  }
}

#elif __INCLUDE_LEVEL__ == 1

#include <bits/stdc++.h>

template <class T> concept Range = std::ranges::range<T> && !std::convertible_to<T, std::string_view>;
template <class T> concept Tuple = std::__is_tuple_like<T>::value && !Range<T>;

namespace std {

istream& operator>>(istream& is, Range auto&& r) {
  for (auto&& e : r) is >> e;
  return is;
}
istream& operator>>(istream& is, Tuple auto&& t) {
  apply([&](auto&... xs) { (is >> ... >> xs); }, t);
  return is;
}

ostream& operator<<(ostream& os, Range auto&& r) {
  auto sep = "";
  for (auto&& e : r) os << exchange(sep, " ") << e;
  return os;
}
ostream& operator<<(ostream& os, Tuple auto&& t) {
  auto sep = "";
  apply([&](auto&... xs) { ((os << exchange(sep, " ") << xs), ...); }, t);
  return os;
}

}  // namespace std

using namespace std;

#define Rep(...) [](int l, int r) { return views::iota(min(l, r), r); }(__VA_ARGS__)
#define IN(...) cin >> forward_as_tuple(__VA_ARGS__)
#define OUT(...) cout << forward_as_tuple(__VA_ARGS__) << '\n'

#endif  // __INCLUDE_LEVEL__ == 1

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3508kb

input:

3
2 4
1 2
3 4
5 6
7 8
1 2
1
1
3 4
1 2 3
6 9 9
10 15 17
12 18 21

output:

1 2
1
3 1 2

result:

ok 3 lines

Test #2:

score: 0
Accepted
time: 1ms
memory: 3680kb

input:

41
1 2
-19
9531
2 3
11 13
3175 4759
2211 3313
10 19
-54 -25 -19 -18 -1 3 61 63 85 88
-54 753 863 2397 3111 4649 4671 4756 5507 7762
-54 369 479 1245 1575 2345 2367 2452 2819 3922
-54 553 663 1797 2311 3449 3471 3556 4107 5762
-54 87 197 399 447 653 675 760 845 1102
-54 320 430 1098 1379 2051 2073 21...

output:

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

result:

ok 41 lines

Test #3:

score: 0
Accepted
time: 1ms
memory: 3636kb

input:

46
8 12
-50 -35 -20 -10 -9 4 13 91
-24 30 32 143 146 147 173 221
-44 -8 10 13 26 27 61 103
-46 -12 -3 8 14 15 45 99
-22 32 36 147 158 159 189 237
-47 -14 -11 7 8 9 37 97
-31 18 23 104 105 117 129 165
-45 -10 5 9 20 21 53 101
-36 8 18 74 75 77 119 125
-30 20 24 110 111 125 131 173
-48 -19 -16 2 3 6 2...

output:

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

result:

ok 46 lines

Test #4:

score: 0
Accepted
time: 1ms
memory: 3576kb

input:

48
3 4
-4952 -1539 836
-4294 5909 12778
-4811 57 3395
-4529 3249 8513
8 11
-9107 -1143 1324 3936 4088 4381 7658 9440
-2753 531 6032 14986 18097 18264 20240 22022
-5224 -120 5276 9673 12692 12763 15347 17129
-2047 717 6248 16504 19621 19856 21638 23420
-6283 -399 4952 7396 10304 10477 13250 15032
-48...

output:

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

result:

ok 48 lines

Test #5:

score: 0
Accepted
time: 1ms
memory: 3652kb

input:

40
10 20
-4289879 -3663596 -3442064 -3379220 -670906 -329052 1547135 1640345 2662172 3577480
-4280827 -3609576 -3374758 -3321039 -598417 -319197 1583489 1685532 2700424 3645662
-4276115 -3581456 -3339722 -3290753 -560683 -314067 1602413 1709054 2720336 3681154
-4271279 -3552596 -3303764 -3259670 -52...

output:

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

result:

ok 40 lines

Test #6:

score: -100
Runtime Error

input:

79
5 7
-5 -1 7 8 10
-1 1 10 19 20
-1 4 10 25 26
-1 5 10 27 28
-2 -1 10 13 14
-4 -1 9 10 10
-1 3 10 23 24
5 6
-7 -5 2 3 5
2 3 11 13 14
-5 -3 2 3 6
2 3 7 9 12
2 3 3 5 10
2 3 5 7 11
3 4
-10 -7 -5
-10 1 3
-10 -4 -2
-10 0 2
5 10
-10 -6 -1 6 7
-10 4 7 9 11
-10 7 8 13 13
-10 7 14 16 19
-10 7 12 15 17
-10 6...

output:


result: