fork download
  1. #include <cstdio>
  2. #include <cstring>
  3. #include <functional>
  4. #include <algorithm>
  5. using namespace std;
  6. long long Tc, N, T, P, n[2001][2001], scr[2001], mscr[2001];
  7. int main()
  8. {
  9. scanf("%lld", &Tc);
  10. for (int i = 0; i < Tc; i++)
  11. {
  12. memset(n, 0, sizeof(n)); memset(scr, 0, sizeof(scr)); memset(mscr, 0, sizeof(mscr));
  13. scanf(" %lld %lld %lld", &N, &T, &P);
  14. for (int i = 1; i <= N; i++)
  15. {
  16. int pnum = 0, ps;
  17. for (int j = 1; j <= T; j++)
  18. {
  19. scanf(" %d", &ps);
  20. if (!ps) scr[j] += 100000000;
  21. else n[i][pnum++] = j;
  22. }
  23. }
  24. for (int i = 1; i <= N; i++)
  25. {
  26. for (int j = 0; j < T; j++)
  27. if (n[i][j]) mscr[i] += (scr[n[i][j]] + 10000);
  28. else break;
  29. mscr[i] += (2000 - i);
  30. }
  31. sort(mscr + 1, mscr + 1 + N, greater<int>());
  32. for (int j = 1; j <= N; j++)
  33. if (mscr[j] % 10000 == 2000 - P && printf("#%d %lld %d\n", i + 1, mscr[j] / 100000000, j))
  34. break;
  35. }
  36. }
Success #stdin #stdout 0s 4528KB
stdin
Standard input is empty
stdout
Standard output is empty