답안 #980064

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
980064	2024-05-11T21:05:16 Z	asdfgrace	Art Collections (BOI22_art)	C++17	70 / 100	1202 ms	1628 KB

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

#define dbg(x) x
#define prt(x) dbg(cerr << x)
#define pv(x) dbg(cerr << #x << " = " << x << '\n')
#define pv2(x) dbg(cerr << #x << " = " << x.first << ',' << x.second << '\n')
#define parr(x) dbg(prt(#x << " = { "); for (auto y : x) prt(y << ' '); prt("}\n");)
#define parr2(x) dbg(prt(#x << " = { "); for (auto [y, z] : x) prt(y << ',' << z << "  "); prt("}\n");)
#define parr2d(x) dbg(prt(#x << ":\n"); for (auto arr : x) {parr(arr);} prt('\n'));
#define parr2d2(x) dbg(prt(#x << ":\n"); for (auto arr : x) {parr2(arr);} prt('\n'));

/*
number of pairs (x, y)
so that g.at[x] < g.at[y] and r.at[x] > r.at[y]
what about pairs (x, y)
so that g.at[x] > g.at[y] and r.at[y] < r.at[x]
basically
number of "inversions" when you replace each value i in r with g.at[i]
when there are 0 inversions you just submit whatever you guessed g was
useful guesses?
identity permutation first obvs
g.at[i] = i for all i
gives number of inversions in r
can probably then find contribution of each index?
if we swap any two elements, does it reduce the number of inversions?
if yes, swap them; else don't
this should make n^2 guesses ez it's like bubble sort
can some other sort be applied here?
maybe some kind of sort calculating contribution of each elem?
like take the first element and make it last
so you find the rank of the first elem?
so you find how much the number of inversions changes by
and basically
the increase in the number of inversions
is probably useful
and can be used to determine the position of the element
dif = (elems after v[0]) - (elems before v[0])
-dif = (elems before v[0]) - (elems after v[0])

*/

void solve(int n) {
  vector<int> v(n), at(n);
  iota(v.begin(), v.end(), 1);
  for (int i = 0; i < n; i++) {
    int inv1 = publish(v);
    vector<int> v2;
    for (int i = 1; i < n; i++) v2.push_back(v[i]);
    v2.push_back(v[0]);
    int inv2 = publish(v2);
    int dif = inv1 - inv2, ind = (n - 1 + dif) / 2;
    at[v[0] - 1] = ind;
    swap(v, v2);
  }
  vector<int> res(n);
  for (int i = 0; i < n; i++) {
    res[at[i]] = i + 1;
  }
  answer(res);
}

Compilation message

interface.cpp: In function 'int publish(std::vector<int>)':
interface.cpp:20:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   20 |     if(v.size() != N) {
      |        ~~~~~~~~~^~~~
interface.cpp: In function 'void answer(std::vector<int>)':
interface.cpp:36:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   36 |     if(v.size() != N) {
      |        ~~~~~~~~~^~~~

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	500 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	1 ms	584 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct

Subtask #2
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	500 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	1 ms	584 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	1 ms	344 KB	Output is correct
10	Correct	1 ms	344 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	1 ms	340 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	0 ms	344 KB	Output is correct
17	Correct	0 ms	344 KB	Output is correct
18	Correct	0 ms	344 KB	Output is correct
19	Correct	1 ms	344 KB	Output is correct
20	Correct	1 ms	344 KB	Output is correct

Subtask #3
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	500 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	1 ms	584 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	1 ms	344 KB	Output is correct
10	Correct	1 ms	344 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	1 ms	340 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	0 ms	344 KB	Output is correct
17	Correct	0 ms	344 KB	Output is correct
18	Correct	0 ms	344 KB	Output is correct
19	Correct	1 ms	344 KB	Output is correct
20	Correct	1 ms	344 KB	Output is correct
21	Correct	0 ms	600 KB	Output is correct
22	Correct	1 ms	344 KB	Output is correct
23	Correct	1 ms	344 KB	Output is correct
24	Correct	1 ms	344 KB	Output is correct
25	Correct	1 ms	344 KB	Output is correct
26	Correct	11 ms	440 KB	Output is correct
27	Correct	11 ms	440 KB	Output is correct
28	Correct	11 ms	440 KB	Output is correct
29	Correct	12 ms	436 KB	Output is correct
30	Correct	12 ms	592 KB	Output is correct
31	Correct	12 ms	436 KB	Output is correct
32	Correct	0 ms	344 KB	Output is correct
33	Correct	1 ms	344 KB	Output is correct
34	Correct	0 ms	344 KB	Output is correct
35	Correct	0 ms	344 KB	Output is correct
36	Correct	0 ms	344 KB	Output is correct
37	Correct	0 ms	344 KB	Output is correct
38	Correct	1 ms	344 KB	Output is correct
39	Correct	1 ms	344 KB	Output is correct

Subtask #4
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	500 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	1 ms	584 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	1 ms	344 KB	Output is correct
10	Correct	1 ms	344 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	1 ms	340 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	0 ms	344 KB	Output is correct
17	Correct	0 ms	344 KB	Output is correct
18	Correct	0 ms	344 KB	Output is correct
19	Correct	1 ms	344 KB	Output is correct
20	Correct	1 ms	344 KB	Output is correct
21	Correct	0 ms	600 KB	Output is correct
22	Correct	1 ms	344 KB	Output is correct
23	Correct	1 ms	344 KB	Output is correct
24	Correct	1 ms	344 KB	Output is correct
25	Correct	1 ms	344 KB	Output is correct
26	Correct	11 ms	440 KB	Output is correct
27	Correct	11 ms	440 KB	Output is correct
28	Correct	11 ms	440 KB	Output is correct
29	Correct	12 ms	436 KB	Output is correct
30	Correct	12 ms	592 KB	Output is correct
31	Correct	12 ms	436 KB	Output is correct
32	Correct	0 ms	344 KB	Output is correct
33	Correct	1 ms	344 KB	Output is correct
34	Correct	0 ms	344 KB	Output is correct
35	Correct	0 ms	344 KB	Output is correct
36	Correct	0 ms	344 KB	Output is correct
37	Correct	0 ms	344 KB	Output is correct
38	Correct	1 ms	344 KB	Output is correct
39	Correct	1 ms	344 KB	Output is correct
40	Correct	0 ms	344 KB	Output is correct
41	Correct	1 ms	344 KB	Output is correct
42	Correct	1 ms	344 KB	Output is correct
43	Correct	1 ms	344 KB	Output is correct
44	Correct	1 ms	344 KB	Output is correct
45	Correct	12 ms	612 KB	Output is correct
46	Correct	11 ms	440 KB	Output is correct
47	Correct	11 ms	440 KB	Output is correct
48	Correct	11 ms	440 KB	Output is correct
49	Correct	11 ms	440 KB	Output is correct
50	Correct	12 ms	440 KB	Output is correct
51	Correct	0 ms	344 KB	Output is correct
52	Correct	32 ms	436 KB	Output is correct
53	Correct	32 ms	596 KB	Output is correct
54	Correct	34 ms	440 KB	Output is correct
55	Correct	32 ms	432 KB	Output is correct
56	Correct	32 ms	440 KB	Output is correct
57	Correct	33 ms	440 KB	Output is correct
58	Correct	1 ms	340 KB	Output is correct
59	Correct	1 ms	344 KB	Output is correct
60	Correct	0 ms	344 KB	Output is correct
61	Correct	0 ms	344 KB	Output is correct
62	Correct	0 ms	344 KB	Output is correct
63	Correct	1 ms	344 KB	Output is correct
64	Correct	1 ms	344 KB	Output is correct

Subtask #5
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	500 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	1 ms	584 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	1 ms	344 KB	Output is correct
10	Correct	1 ms	344 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	1 ms	340 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	0 ms	344 KB	Output is correct
17	Correct	0 ms	344 KB	Output is correct
18	Correct	0 ms	344 KB	Output is correct
19	Correct	1 ms	344 KB	Output is correct
20	Correct	1 ms	344 KB	Output is correct
21	Correct	0 ms	600 KB	Output is correct
22	Correct	1 ms	344 KB	Output is correct
23	Correct	1 ms	344 KB	Output is correct
24	Correct	1 ms	344 KB	Output is correct
25	Correct	1 ms	344 KB	Output is correct
26	Correct	11 ms	440 KB	Output is correct
27	Correct	11 ms	440 KB	Output is correct
28	Correct	11 ms	440 KB	Output is correct
29	Correct	12 ms	436 KB	Output is correct
30	Correct	12 ms	592 KB	Output is correct
31	Correct	12 ms	436 KB	Output is correct
32	Correct	0 ms	344 KB	Output is correct
33	Correct	1 ms	344 KB	Output is correct
34	Correct	0 ms	344 KB	Output is correct
35	Correct	0 ms	344 KB	Output is correct
36	Correct	0 ms	344 KB	Output is correct
37	Correct	0 ms	344 KB	Output is correct
38	Correct	1 ms	344 KB	Output is correct
39	Correct	1 ms	344 KB	Output is correct
40	Correct	0 ms	344 KB	Output is correct
41	Correct	1 ms	344 KB	Output is correct
42	Correct	1 ms	344 KB	Output is correct
43	Correct	1 ms	344 KB	Output is correct
44	Correct	1 ms	344 KB	Output is correct
45	Correct	12 ms	612 KB	Output is correct
46	Correct	11 ms	440 KB	Output is correct
47	Correct	11 ms	440 KB	Output is correct
48	Correct	11 ms	440 KB	Output is correct
49	Correct	11 ms	440 KB	Output is correct
50	Correct	12 ms	440 KB	Output is correct
51	Correct	0 ms	344 KB	Output is correct
52	Correct	32 ms	436 KB	Output is correct
53	Correct	32 ms	596 KB	Output is correct
54	Correct	34 ms	440 KB	Output is correct
55	Correct	32 ms	432 KB	Output is correct
56	Correct	32 ms	440 KB	Output is correct
57	Correct	33 ms	440 KB	Output is correct
58	Correct	1 ms	340 KB	Output is correct
59	Correct	1 ms	344 KB	Output is correct
60	Correct	0 ms	344 KB	Output is correct
61	Correct	0 ms	344 KB	Output is correct
62	Correct	0 ms	344 KB	Output is correct
63	Correct	1 ms	344 KB	Output is correct
64	Correct	1 ms	344 KB	Output is correct
65	Correct	0 ms	344 KB	Output is correct
66	Correct	1 ms	344 KB	Output is correct
67	Correct	1 ms	344 KB	Output is correct
68	Correct	1 ms	344 KB	Output is correct
69	Correct	1 ms	344 KB	Output is correct
70	Correct	11 ms	440 KB	Output is correct
71	Correct	14 ms	436 KB	Output is correct
72	Correct	11 ms	440 KB	Output is correct
73	Correct	12 ms	436 KB	Output is correct
74	Correct	12 ms	436 KB	Output is correct
75	Correct	12 ms	444 KB	Output is correct
76	Correct	0 ms	344 KB	Output is correct
77	Correct	33 ms	440 KB	Output is correct
78	Correct	32 ms	436 KB	Output is correct
79	Correct	33 ms	436 KB	Output is correct
80	Correct	33 ms	440 KB	Output is correct
81	Correct	32 ms	444 KB	Output is correct
82	Correct	35 ms	440 KB	Output is correct
83	Correct	610 ms	1560 KB	Output is correct
84	Correct	603 ms	1256 KB	Output is correct
85	Correct	606 ms	1476 KB	Output is correct
86	Correct	601 ms	1540 KB	Output is correct
87	Correct	1 ms	344 KB	Output is correct
88	Correct	608 ms	1576 KB	Output is correct
89	Correct	605 ms	1284 KB	Output is correct
90	Correct	0 ms	344 KB	Output is correct
91	Correct	0 ms	344 KB	Output is correct
92	Correct	0 ms	344 KB	Output is correct
93	Correct	0 ms	344 KB	Output is correct
94	Correct	1 ms	344 KB	Output is correct
95	Correct	1 ms	344 KB	Output is correct

Subtask #6
0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	500 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	1 ms	584 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	1 ms	344 KB	Output is correct
10	Correct	1 ms	344 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	1 ms	340 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	0 ms	344 KB	Output is correct
17	Correct	0 ms	344 KB	Output is correct
18	Correct	0 ms	344 KB	Output is correct
19	Correct	1 ms	344 KB	Output is correct
20	Correct	1 ms	344 KB	Output is correct
21	Correct	0 ms	600 KB	Output is correct
22	Correct	1 ms	344 KB	Output is correct
23	Correct	1 ms	344 KB	Output is correct
24	Correct	1 ms	344 KB	Output is correct
25	Correct	1 ms	344 KB	Output is correct
26	Correct	11 ms	440 KB	Output is correct
27	Correct	11 ms	440 KB	Output is correct
28	Correct	11 ms	440 KB	Output is correct
29	Correct	12 ms	436 KB	Output is correct
30	Correct	12 ms	592 KB	Output is correct
31	Correct	12 ms	436 KB	Output is correct
32	Correct	0 ms	344 KB	Output is correct
33	Correct	1 ms	344 KB	Output is correct
34	Correct	0 ms	344 KB	Output is correct
35	Correct	0 ms	344 KB	Output is correct
36	Correct	0 ms	344 KB	Output is correct
37	Correct	0 ms	344 KB	Output is correct
38	Correct	1 ms	344 KB	Output is correct
39	Correct	1 ms	344 KB	Output is correct
40	Correct	0 ms	344 KB	Output is correct
41	Correct	1 ms	344 KB	Output is correct
42	Correct	1 ms	344 KB	Output is correct
43	Correct	1 ms	344 KB	Output is correct
44	Correct	1 ms	344 KB	Output is correct
45	Correct	12 ms	612 KB	Output is correct
46	Correct	11 ms	440 KB	Output is correct
47	Correct	11 ms	440 KB	Output is correct
48	Correct	11 ms	440 KB	Output is correct
49	Correct	11 ms	440 KB	Output is correct
50	Correct	12 ms	440 KB	Output is correct
51	Correct	0 ms	344 KB	Output is correct
52	Correct	32 ms	436 KB	Output is correct
53	Correct	32 ms	596 KB	Output is correct
54	Correct	34 ms	440 KB	Output is correct
55	Correct	32 ms	432 KB	Output is correct
56	Correct	32 ms	440 KB	Output is correct
57	Correct	33 ms	440 KB	Output is correct
58	Correct	1 ms	340 KB	Output is correct
59	Correct	1 ms	344 KB	Output is correct
60	Correct	0 ms	344 KB	Output is correct
61	Correct	0 ms	344 KB	Output is correct
62	Correct	0 ms	344 KB	Output is correct
63	Correct	1 ms	344 KB	Output is correct
64	Correct	1 ms	344 KB	Output is correct
65	Correct	0 ms	344 KB	Output is correct
66	Correct	1 ms	344 KB	Output is correct
67	Correct	1 ms	344 KB	Output is correct
68	Correct	1 ms	344 KB	Output is correct
69	Correct	1 ms	344 KB	Output is correct
70	Correct	11 ms	440 KB	Output is correct
71	Correct	14 ms	436 KB	Output is correct
72	Correct	11 ms	440 KB	Output is correct
73	Correct	12 ms	436 KB	Output is correct
74	Correct	12 ms	436 KB	Output is correct
75	Correct	12 ms	444 KB	Output is correct
76	Correct	0 ms	344 KB	Output is correct
77	Correct	33 ms	440 KB	Output is correct
78	Correct	32 ms	436 KB	Output is correct
79	Correct	33 ms	436 KB	Output is correct
80	Correct	33 ms	440 KB	Output is correct
81	Correct	32 ms	444 KB	Output is correct
82	Correct	35 ms	440 KB	Output is correct
83	Correct	610 ms	1560 KB	Output is correct
84	Correct	603 ms	1256 KB	Output is correct
85	Correct	606 ms	1476 KB	Output is correct
86	Correct	601 ms	1540 KB	Output is correct
87	Correct	1 ms	344 KB	Output is correct
88	Correct	608 ms	1576 KB	Output is correct
89	Correct	605 ms	1284 KB	Output is correct
90	Correct	0 ms	344 KB	Output is correct
91	Correct	0 ms	344 KB	Output is correct
92	Correct	0 ms	344 KB	Output is correct
93	Correct	0 ms	344 KB	Output is correct
94	Correct	1 ms	344 KB	Output is correct
95	Correct	1 ms	344 KB	Output is correct
96	Correct	0 ms	344 KB	Output is correct
97	Correct	1 ms	344 KB	Output is correct
98	Correct	1 ms	344 KB	Output is correct
99	Correct	1 ms	344 KB	Output is correct
100	Correct	1 ms	344 KB	Output is correct
101	Correct	11 ms	440 KB	Output is correct
102	Correct	11 ms	436 KB	Output is correct
103	Correct	11 ms	440 KB	Output is correct
104	Correct	11 ms	444 KB	Output is correct
105	Correct	12 ms	436 KB	Output is correct
106	Correct	12 ms	436 KB	Output is correct
107	Correct	1 ms	344 KB	Output is correct
108	Correct	32 ms	444 KB	Output is correct
109	Correct	32 ms	432 KB	Output is correct
110	Correct	37 ms	440 KB	Output is correct
111	Correct	32 ms	436 KB	Output is correct
112	Correct	32 ms	444 KB	Output is correct
113	Correct	35 ms	432 KB	Output is correct
114	Correct	606 ms	1476 KB	Output is correct
115	Correct	606 ms	1396 KB	Output is correct
116	Correct	608 ms	1628 KB	Output is correct
117	Correct	607 ms	1360 KB	Output is correct
118	Correct	1 ms	344 KB	Output is correct
119	Correct	608 ms	1492 KB	Output is correct
120	Correct	609 ms	1516 KB	Output is correct
121	Incorrect	1202 ms	1412 KB	Not correct
122	Halted	0 ms	0 KB	-

답안 #980064

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 15.0 / 15.0

Subtask #3 15.0 / 15.0

Subtask #4 15.0 / 15.0

Subtask #5 20.0 / 20.0

Subtask #6 0 / 30.0

Subtask #1
5.0 / 5.0

Subtask #2
15.0 / 15.0

Subtask #3
15.0 / 15.0

Subtask #4
15.0 / 15.0

Subtask #5
20.0 / 20.0

Subtask #6
0 / 30.0