Submission #864311

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
864311	2023-10-22T11:19:41 Z	vjudge1	Monster Game (JOI21_monster)	C++17	10 / 100	113 ms	596 KB

monster

#include "monster.h"
#include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
using namespace std;

vector<int> Solve(int n) {
  vector <int> A(n, 0);
  for (int i = 0; i < n; i++){
    for (int j = i + 1; j < n; j++){
      if (Query(i,j))A[i]++;
      else A[j]++;
    }
  }
  vector <int> pos(n);
  iota(all(pos), 0);
  sort(all(pos), [&](auto x, auto y){
    return A[x] < A[y];
  });
  if (!Query(pos[0],pos[1]))
    swap(pos[0], pos[1]);
  if (Query(pos[n - 2], pos[n - 1]) == false)
    swap(pos[n - 2], pos[n - 1]);
  for (int i = 0; i < n; i++){
    A[pos[i]] = i;
  }
  return A;
}

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	596 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	0 ms	500 KB	Output is correct
9	Correct	1 ms	344 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	0 ms	344 KB	Output is correct
16	Correct	80 ms	344 KB	Output is correct
17	Correct	84 ms	344 KB	Output is correct
18	Correct	85 ms	344 KB	Output is correct
19	Correct	81 ms	352 KB	Output is correct
20	Correct	83 ms	344 KB	Output is correct
21	Correct	0 ms	344 KB	Output is correct
22	Correct	0 ms	344 KB	Output is correct
23	Correct	0 ms	344 KB	Output is correct
24	Correct	0 ms	344 KB	Output is correct
25	Correct	0 ms	344 KB	Output is correct
26	Correct	80 ms	344 KB	Output is correct
27	Correct	0 ms	344 KB	Output is correct
28	Correct	0 ms	344 KB	Output is correct
29	Correct	0 ms	340 KB	Output is correct
30	Correct	0 ms	344 KB	Output is correct
31	Correct	0 ms	344 KB	Output is correct
32	Correct	80 ms	344 KB	Output is correct

Subtask #2

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	596 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	0 ms	500 KB	Output is correct
9	Correct	1 ms	344 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	0 ms	344 KB	Output is correct
16	Correct	80 ms	344 KB	Output is correct
17	Correct	84 ms	344 KB	Output is correct
18	Correct	85 ms	344 KB	Output is correct
19	Correct	81 ms	352 KB	Output is correct
20	Correct	83 ms	344 KB	Output is correct
21	Correct	0 ms	344 KB	Output is correct
22	Correct	0 ms	344 KB	Output is correct
23	Correct	0 ms	344 KB	Output is correct
24	Correct	0 ms	344 KB	Output is correct
25	Correct	0 ms	344 KB	Output is correct
26	Correct	80 ms	344 KB	Output is correct
27	Correct	0 ms	344 KB	Output is correct
28	Correct	0 ms	344 KB	Output is correct
29	Correct	0 ms	340 KB	Output is correct
30	Correct	0 ms	344 KB	Output is correct
31	Correct	0 ms	344 KB	Output is correct
32	Correct	80 ms	344 KB	Output is correct
33	Incorrect	113 ms	416 KB	Wrong Answer [6]
34	Halted	0 ms	0 KB	-

Subtask #3

0 / 75.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	99 ms	416 KB	Wrong Answer [6]
2	Halted	0 ms	0 KB	-