답안 #805308

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
805308	2023-08-03T15:00:17 Z	vjudge1	Art Collections (BOI22_art)	C++17	100 / 100	1421 ms	652 KB

#include<bits/stdc++.h>
#include "art.h"
using namespace std;
#define all(fl) fl.begin(),fl.end()
#define pb push_back
#define fi first
#define se second
#define for1(i,j,k) for(int i=j;i<=k;i++)
#define for2(i,j,k) for(int i=j;i>=k;i--)
#define for3(i,j,k,l) for(int i=j;i<=k;i+=l)
#define lb lower_bound
#define ub upper_bound
#define sz(a) (int)a.size()
#define pii pair<int,int>
#define pli pair<long long,int>
#define gcd __gcd
#define lcm(x,y) x*y/__gcd(x,y)
/*void __attribute__((noreturn)) __attribute__((format(printf, 1, 2))) result(const char *msg, ...) {
    va_list args;
    va_start(args, msg);
    vfprintf(stdout, msg, args);
    fprintf(stdout, "\n");
    va_end(args);
    exit(0);
}

namespace {
    int N;
    int Q = 0;
    const int MAX_Q = 4000;
    const int MAX_N = 4000;
    vector<int> solution;
}  // namespace

int publish(vector<int> R) {
    printf("publish({");
    for(int i = 0; i < int(R.size()); ++i) {
        if(i == 0)
            printf("%d", R[i]);
        else
            printf(", %d", R[i]);
    }
    printf("})\n");
    fflush(stdout);

    if (++Q > MAX_Q)
        result("Too many published rankings!");

    if (int(R.size()) != N)
        result("Invalid published ranking!");

    set<int> chosen;
    for(auto &x : R) {
        if(x < 1 || x > N || chosen.count(x))
            result("Invalid published ranking!");
        chosen.insert(x);
    }
    vector<int> positions(N+1);
    for(int i = 0; i < N; ++i)
        positions[R[i]] = i;

    int complaints = 0;
    for(int i = 0; i < N; ++i) {
        for(int j = i+1; j < N; ++j) {
            if(positions[solution[i]] > positions[solution[j]])
                ++complaints;
        }
    }

    return complaints;
}
void __attribute__((noreturn)) answer(vector<int> R) {
    printf("answer({");
    for(int i = 0; i < int(R.size()); ++i) {
        if(i == 0)
            printf("%d", R[i]);
        else
            printf(", %d", R[i]);
    }
    printf("})\n");
    fflush(stdout);


    if(R == solution)
        result("Correct: %d published ranking(s).", Q);
    else
        result("Wrong answer!");
}*/
void solve(int n){
vector<int>tmp;
for1(i,1,n)tmp.pb(i);
int inv=publish(tmp);
vector<int>ans;
for1(i,1,n){
if (i==1){
    ans.pb(i);
    continue;
}
else {
    //large than i + y= inv
    vector<int>cop;
    cop.pb(i);
    for(auto v:ans)cop.pb(v);
    for1(j,i+1,n)cop.pb(j);
    int newinv=publish(cop);
    //less than i + y=newinv
    int ninv=(newinv+inv-(i-1))/2;
    int largethani=inv-ninv;
    //cerr<<i<<" "<<largethani<<'\n';
    vector<int>fr;
    while (largethani--){
        fr.pb(ans.back());
        ans.pop_back();
    }
    ans.pb(i);
    while (!fr.empty()){
        ans.pb(fr.back());
        fr.pop_back();
    }
    inv=ninv;
}
}
answer(ans);
}
/*signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    //freopen(".INP","r",stdin);
    //freopen(".OUT","w",stdout);
    if (scanf("%d", &N) != 1 || N < 2 || N > MAX_N)
        result("Invalid input!");

    solution.resize(N);
    set<int> chosen;
    for(auto &x : solution) {
        if(scanf("%d", &x) != 1 || x < 1 || x > N || chosen.count(x))
            result("Invalid input!");
        chosen.insert(x);
    }

    solve(N);

    result("No answer!");
}*/

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	1 ms	208 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	0 ms	208 KB	Output is correct
5	Correct	0 ms	208 KB	Output is correct
6	Correct	0 ms	208 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct

Subtask #2
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	208 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	0 ms	208 KB	Output is correct
5	Correct	0 ms	208 KB	Output is correct
6	Correct	0 ms	208 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Correct	0 ms	208 KB	Output is correct
9	Correct	1 ms	208 KB	Output is correct
10	Correct	1 ms	208 KB	Output is correct
11	Correct	1 ms	208 KB	Output is correct
12	Correct	1 ms	208 KB	Output is correct
13	Correct	0 ms	208 KB	Output is correct
14	Correct	0 ms	208 KB	Output is correct
15	Correct	0 ms	208 KB	Output is correct
16	Correct	0 ms	208 KB	Output is correct
17	Correct	0 ms	208 KB	Output is correct
18	Correct	0 ms	208 KB	Output is correct
19	Correct	1 ms	208 KB	Output is correct
20	Correct	1 ms	208 KB	Output is correct

Subtask #3
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	208 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	0 ms	208 KB	Output is correct
5	Correct	0 ms	208 KB	Output is correct
6	Correct	0 ms	208 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Correct	0 ms	208 KB	Output is correct
9	Correct	1 ms	208 KB	Output is correct
10	Correct	1 ms	208 KB	Output is correct
11	Correct	1 ms	208 KB	Output is correct
12	Correct	1 ms	208 KB	Output is correct
13	Correct	0 ms	208 KB	Output is correct
14	Correct	0 ms	208 KB	Output is correct
15	Correct	0 ms	208 KB	Output is correct
16	Correct	0 ms	208 KB	Output is correct
17	Correct	0 ms	208 KB	Output is correct
18	Correct	0 ms	208 KB	Output is correct
19	Correct	1 ms	208 KB	Output is correct
20	Correct	1 ms	208 KB	Output is correct
21	Correct	0 ms	208 KB	Output is correct
22	Correct	1 ms	208 KB	Output is correct
23	Correct	1 ms	208 KB	Output is correct
24	Correct	1 ms	208 KB	Output is correct
25	Correct	1 ms	208 KB	Output is correct
26	Correct	7 ms	208 KB	Output is correct
27	Correct	7 ms	300 KB	Output is correct
28	Correct	9 ms	208 KB	Output is correct
29	Correct	7 ms	208 KB	Output is correct
30	Correct	9 ms	304 KB	Output is correct
31	Correct	7 ms	304 KB	Output is correct
32	Correct	0 ms	208 KB	Output is correct
33	Correct	0 ms	208 KB	Output is correct
34	Correct	0 ms	208 KB	Output is correct
35	Correct	0 ms	208 KB	Output is correct
36	Correct	0 ms	208 KB	Output is correct
37	Correct	0 ms	208 KB	Output is correct
38	Correct	1 ms	208 KB	Output is correct
39	Correct	1 ms	208 KB	Output is correct

Subtask #4
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	208 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	0 ms	208 KB	Output is correct
5	Correct	0 ms	208 KB	Output is correct
6	Correct	0 ms	208 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Correct	0 ms	208 KB	Output is correct
9	Correct	1 ms	208 KB	Output is correct
10	Correct	1 ms	208 KB	Output is correct
11	Correct	1 ms	208 KB	Output is correct
12	Correct	1 ms	208 KB	Output is correct
13	Correct	0 ms	208 KB	Output is correct
14	Correct	0 ms	208 KB	Output is correct
15	Correct	0 ms	208 KB	Output is correct
16	Correct	0 ms	208 KB	Output is correct
17	Correct	0 ms	208 KB	Output is correct
18	Correct	0 ms	208 KB	Output is correct
19	Correct	1 ms	208 KB	Output is correct
20	Correct	1 ms	208 KB	Output is correct
21	Correct	0 ms	208 KB	Output is correct
22	Correct	1 ms	208 KB	Output is correct
23	Correct	1 ms	208 KB	Output is correct
24	Correct	1 ms	208 KB	Output is correct
25	Correct	1 ms	208 KB	Output is correct
26	Correct	7 ms	208 KB	Output is correct
27	Correct	7 ms	300 KB	Output is correct
28	Correct	9 ms	208 KB	Output is correct
29	Correct	7 ms	208 KB	Output is correct
30	Correct	9 ms	304 KB	Output is correct
31	Correct	7 ms	304 KB	Output is correct
32	Correct	0 ms	208 KB	Output is correct
33	Correct	0 ms	208 KB	Output is correct
34	Correct	0 ms	208 KB	Output is correct
35	Correct	0 ms	208 KB	Output is correct
36	Correct	0 ms	208 KB	Output is correct
37	Correct	0 ms	208 KB	Output is correct
38	Correct	1 ms	208 KB	Output is correct
39	Correct	1 ms	208 KB	Output is correct
40	Correct	1 ms	208 KB	Output is correct
41	Correct	1 ms	208 KB	Output is correct
42	Correct	1 ms	208 KB	Output is correct
43	Correct	1 ms	208 KB	Output is correct
44	Correct	1 ms	224 KB	Output is correct
45	Correct	7 ms	284 KB	Output is correct
46	Correct	7 ms	308 KB	Output is correct
47	Correct	7 ms	304 KB	Output is correct
48	Correct	7 ms	208 KB	Output is correct
49	Correct	7 ms	208 KB	Output is correct
50	Correct	8 ms	208 KB	Output is correct
51	Correct	1 ms	208 KB	Output is correct
52	Correct	19 ms	336 KB	Output is correct
53	Correct	19 ms	208 KB	Output is correct
54	Correct	17 ms	296 KB	Output is correct
55	Correct	19 ms	304 KB	Output is correct
56	Correct	17 ms	300 KB	Output is correct
57	Correct	19 ms	288 KB	Output is correct
58	Correct	0 ms	208 KB	Output is correct
59	Correct	1 ms	208 KB	Output is correct
60	Correct	0 ms	208 KB	Output is correct
61	Correct	0 ms	208 KB	Output is correct
62	Correct	1 ms	208 KB	Output is correct
63	Correct	1 ms	208 KB	Output is correct
64	Correct	1 ms	208 KB	Output is correct

Subtask #5
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	208 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	0 ms	208 KB	Output is correct
5	Correct	0 ms	208 KB	Output is correct
6	Correct	0 ms	208 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Correct	0 ms	208 KB	Output is correct
9	Correct	1 ms	208 KB	Output is correct
10	Correct	1 ms	208 KB	Output is correct
11	Correct	1 ms	208 KB	Output is correct
12	Correct	1 ms	208 KB	Output is correct
13	Correct	0 ms	208 KB	Output is correct
14	Correct	0 ms	208 KB	Output is correct
15	Correct	0 ms	208 KB	Output is correct
16	Correct	0 ms	208 KB	Output is correct
17	Correct	0 ms	208 KB	Output is correct
18	Correct	0 ms	208 KB	Output is correct
19	Correct	1 ms	208 KB	Output is correct
20	Correct	1 ms	208 KB	Output is correct
21	Correct	0 ms	208 KB	Output is correct
22	Correct	1 ms	208 KB	Output is correct
23	Correct	1 ms	208 KB	Output is correct
24	Correct	1 ms	208 KB	Output is correct
25	Correct	1 ms	208 KB	Output is correct
26	Correct	7 ms	208 KB	Output is correct
27	Correct	7 ms	300 KB	Output is correct
28	Correct	9 ms	208 KB	Output is correct
29	Correct	7 ms	208 KB	Output is correct
30	Correct	9 ms	304 KB	Output is correct
31	Correct	7 ms	304 KB	Output is correct
32	Correct	0 ms	208 KB	Output is correct
33	Correct	0 ms	208 KB	Output is correct
34	Correct	0 ms	208 KB	Output is correct
35	Correct	0 ms	208 KB	Output is correct
36	Correct	0 ms	208 KB	Output is correct
37	Correct	0 ms	208 KB	Output is correct
38	Correct	1 ms	208 KB	Output is correct
39	Correct	1 ms	208 KB	Output is correct
40	Correct	1 ms	208 KB	Output is correct
41	Correct	1 ms	208 KB	Output is correct
42	Correct	1 ms	208 KB	Output is correct
43	Correct	1 ms	208 KB	Output is correct
44	Correct	1 ms	224 KB	Output is correct
45	Correct	7 ms	284 KB	Output is correct
46	Correct	7 ms	308 KB	Output is correct
47	Correct	7 ms	304 KB	Output is correct
48	Correct	7 ms	208 KB	Output is correct
49	Correct	7 ms	208 KB	Output is correct
50	Correct	8 ms	208 KB	Output is correct
51	Correct	1 ms	208 KB	Output is correct
52	Correct	19 ms	336 KB	Output is correct
53	Correct	19 ms	208 KB	Output is correct
54	Correct	17 ms	296 KB	Output is correct
55	Correct	19 ms	304 KB	Output is correct
56	Correct	17 ms	300 KB	Output is correct
57	Correct	19 ms	288 KB	Output is correct
58	Correct	0 ms	208 KB	Output is correct
59	Correct	1 ms	208 KB	Output is correct
60	Correct	0 ms	208 KB	Output is correct
61	Correct	0 ms	208 KB	Output is correct
62	Correct	1 ms	208 KB	Output is correct
63	Correct	1 ms	208 KB	Output is correct
64	Correct	1 ms	208 KB	Output is correct
65	Correct	0 ms	208 KB	Output is correct
66	Correct	1 ms	208 KB	Output is correct
67	Correct	1 ms	208 KB	Output is correct
68	Correct	1 ms	208 KB	Output is correct
69	Correct	1 ms	208 KB	Output is correct
70	Correct	7 ms	208 KB	Output is correct
71	Correct	7 ms	304 KB	Output is correct
72	Correct	7 ms	304 KB	Output is correct
73	Correct	8 ms	304 KB	Output is correct
74	Correct	9 ms	304 KB	Output is correct
75	Correct	7 ms	208 KB	Output is correct
76	Correct	0 ms	208 KB	Output is correct
77	Correct	20 ms	300 KB	Output is correct
78	Correct	21 ms	304 KB	Output is correct
79	Correct	23 ms	308 KB	Output is correct
80	Correct	22 ms	208 KB	Output is correct
81	Correct	18 ms	208 KB	Output is correct
82	Correct	17 ms	312 KB	Output is correct
83	Correct	337 ms	460 KB	Output is correct
84	Correct	348 ms	536 KB	Output is correct
85	Correct	340 ms	464 KB	Output is correct
86	Correct	409 ms	348 KB	Output is correct
87	Correct	0 ms	208 KB	Output is correct
88	Correct	321 ms	404 KB	Output is correct
89	Correct	359 ms	432 KB	Output is correct
90	Correct	0 ms	208 KB	Output is correct
91	Correct	0 ms	208 KB	Output is correct
92	Correct	0 ms	208 KB	Output is correct
93	Correct	0 ms	208 KB	Output is correct
94	Correct	1 ms	208 KB	Output is correct
95	Correct	1 ms	208 KB	Output is correct

Subtask #6
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	208 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	0 ms	208 KB	Output is correct
5	Correct	0 ms	208 KB	Output is correct
6	Correct	0 ms	208 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Correct	0 ms	208 KB	Output is correct
9	Correct	1 ms	208 KB	Output is correct
10	Correct	1 ms	208 KB	Output is correct
11	Correct	1 ms	208 KB	Output is correct
12	Correct	1 ms	208 KB	Output is correct
13	Correct	0 ms	208 KB	Output is correct
14	Correct	0 ms	208 KB	Output is correct
15	Correct	0 ms	208 KB	Output is correct
16	Correct	0 ms	208 KB	Output is correct
17	Correct	0 ms	208 KB	Output is correct
18	Correct	0 ms	208 KB	Output is correct
19	Correct	1 ms	208 KB	Output is correct
20	Correct	1 ms	208 KB	Output is correct
21	Correct	0 ms	208 KB	Output is correct
22	Correct	1 ms	208 KB	Output is correct
23	Correct	1 ms	208 KB	Output is correct
24	Correct	1 ms	208 KB	Output is correct
25	Correct	1 ms	208 KB	Output is correct
26	Correct	7 ms	208 KB	Output is correct
27	Correct	7 ms	300 KB	Output is correct
28	Correct	9 ms	208 KB	Output is correct
29	Correct	7 ms	208 KB	Output is correct
30	Correct	9 ms	304 KB	Output is correct
31	Correct	7 ms	304 KB	Output is correct
32	Correct	0 ms	208 KB	Output is correct
33	Correct	0 ms	208 KB	Output is correct
34	Correct	0 ms	208 KB	Output is correct
35	Correct	0 ms	208 KB	Output is correct
36	Correct	0 ms	208 KB	Output is correct
37	Correct	0 ms	208 KB	Output is correct
38	Correct	1 ms	208 KB	Output is correct
39	Correct	1 ms	208 KB	Output is correct
40	Correct	1 ms	208 KB	Output is correct
41	Correct	1 ms	208 KB	Output is correct
42	Correct	1 ms	208 KB	Output is correct
43	Correct	1 ms	208 KB	Output is correct
44	Correct	1 ms	224 KB	Output is correct
45	Correct	7 ms	284 KB	Output is correct
46	Correct	7 ms	308 KB	Output is correct
47	Correct	7 ms	304 KB	Output is correct
48	Correct	7 ms	208 KB	Output is correct
49	Correct	7 ms	208 KB	Output is correct
50	Correct	8 ms	208 KB	Output is correct
51	Correct	1 ms	208 KB	Output is correct
52	Correct	19 ms	336 KB	Output is correct
53	Correct	19 ms	208 KB	Output is correct
54	Correct	17 ms	296 KB	Output is correct
55	Correct	19 ms	304 KB	Output is correct
56	Correct	17 ms	300 KB	Output is correct
57	Correct	19 ms	288 KB	Output is correct
58	Correct	0 ms	208 KB	Output is correct
59	Correct	1 ms	208 KB	Output is correct
60	Correct	0 ms	208 KB	Output is correct
61	Correct	0 ms	208 KB	Output is correct
62	Correct	1 ms	208 KB	Output is correct
63	Correct	1 ms	208 KB	Output is correct
64	Correct	1 ms	208 KB	Output is correct
65	Correct	0 ms	208 KB	Output is correct
66	Correct	1 ms	208 KB	Output is correct
67	Correct	1 ms	208 KB	Output is correct
68	Correct	1 ms	208 KB	Output is correct
69	Correct	1 ms	208 KB	Output is correct
70	Correct	7 ms	208 KB	Output is correct
71	Correct	7 ms	304 KB	Output is correct
72	Correct	7 ms	304 KB	Output is correct
73	Correct	8 ms	304 KB	Output is correct
74	Correct	9 ms	304 KB	Output is correct
75	Correct	7 ms	208 KB	Output is correct
76	Correct	0 ms	208 KB	Output is correct
77	Correct	20 ms	300 KB	Output is correct
78	Correct	21 ms	304 KB	Output is correct
79	Correct	23 ms	308 KB	Output is correct
80	Correct	22 ms	208 KB	Output is correct
81	Correct	18 ms	208 KB	Output is correct
82	Correct	17 ms	312 KB	Output is correct
83	Correct	337 ms	460 KB	Output is correct
84	Correct	348 ms	536 KB	Output is correct
85	Correct	340 ms	464 KB	Output is correct
86	Correct	409 ms	348 KB	Output is correct
87	Correct	0 ms	208 KB	Output is correct
88	Correct	321 ms	404 KB	Output is correct
89	Correct	359 ms	432 KB	Output is correct
90	Correct	0 ms	208 KB	Output is correct
91	Correct	0 ms	208 KB	Output is correct
92	Correct	0 ms	208 KB	Output is correct
93	Correct	0 ms	208 KB	Output is correct
94	Correct	1 ms	208 KB	Output is correct
95	Correct	1 ms	208 KB	Output is correct
96	Correct	0 ms	208 KB	Output is correct
97	Correct	1 ms	208 KB	Output is correct
98	Correct	1 ms	208 KB	Output is correct
99	Correct	1 ms	208 KB	Output is correct
100	Correct	1 ms	208 KB	Output is correct
101	Correct	6 ms	324 KB	Output is correct
102	Correct	6 ms	208 KB	Output is correct
103	Correct	8 ms	208 KB	Output is correct
104	Correct	7 ms	304 KB	Output is correct
105	Correct	9 ms	208 KB	Output is correct
106	Correct	7 ms	304 KB	Output is correct
107	Correct	0 ms	208 KB	Output is correct
108	Correct	19 ms	308 KB	Output is correct
109	Correct	19 ms	208 KB	Output is correct
110	Correct	21 ms	288 KB	Output is correct
111	Correct	18 ms	304 KB	Output is correct
112	Correct	18 ms	208 KB	Output is correct
113	Correct	20 ms	308 KB	Output is correct
114	Correct	342 ms	444 KB	Output is correct
115	Correct	318 ms	432 KB	Output is correct
116	Correct	350 ms	452 KB	Output is correct
117	Correct	428 ms	436 KB	Output is correct
118	Correct	1 ms	208 KB	Output is correct
119	Correct	378 ms	428 KB	Output is correct
120	Correct	353 ms	544 KB	Output is correct
121	Correct	1352 ms	584 KB	Output is correct
122	Correct	1407 ms	584 KB	Output is correct
123	Correct	1365 ms	652 KB	Output is correct
124	Correct	1303 ms	652 KB	Output is correct
125	Correct	1421 ms	564 KB	Output is correct
126	Correct	1381 ms	576 KB	Output is correct
127	Correct	0 ms	208 KB	Output is correct
128	Correct	0 ms	208 KB	Output is correct
129	Correct	1 ms	208 KB	Output is correct
130	Correct	0 ms	208 KB	Output is correct
131	Correct	1 ms	208 KB	Output is correct
132	Correct	1 ms	208 KB	Output is correct

답안 #805308

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 30.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
30.0 / 30.0