답안 #704004

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
704004	2023-03-01T10:27:24 Z	vjudge1	Art Collections (BOI22_art)	C++17	35 / 100	180 ms	296 KB

#include <bits/stdc++.h>
#define pb push_back
#define vt vector
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()

#ifndef ONLINE_JUDGE
	#include "art.h"
#endif

using namespace std;

#ifdef ONLINE_JUDGE
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!");
}
#endif

bool cmp (int n, int i, int j) {
	vt<int> v = {i, j};
	for (int k = 1; k <= n; k++) {
		if (k != i && k != j) v.pb(k);
	}
	int res1 = publish(v);
	swap(v[0], v[1]);
	int res2 = publish(v);
	return (res1 < res2);
}

vt<int> merge_sort (int n, vt<int> p) {
	if (sz(p) == 1) return p;
	vt<int> L, R;
	for (int i = 0; i < sz(p); i++) (i < sz(p) / 2 ? L : R).pb(p[i]);
	L = merge_sort(n, L), R = merge_sort(n, R);
	p.clear();
	int i = 0, j = 0;
	while (i < sz(L) && j < sz(R)) {
		if (cmp(n, L[i], R[j])) p.pb(L[i]), i++;
		else p.pb(R[j]), j++;
	}
	while (i < sz(L)) p.pb(L[i]), i++;
	while (j < sz(R)) p.pb(R[j]), j++;
	return p;
}

void solve (int n) {
	vt<int> p(n);
	iota(all(p), 1);
	p = merge_sort(n, p);
	answer(p);
}

#ifdef ONLINE_JUDGE

int main() {
    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!");
}
#endif

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

Subtask #2
15.0 / 15.0

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

Subtask #3
15.0 / 15.0

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

Subtask #4
0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	1 ms	208 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	0 ms	208 KB	Output is correct
7	Correct	0 ms	208 KB	Output is correct
8	Correct	0 ms	208 KB	Output is correct
9	Correct	4 ms	208 KB	Output is correct
10	Correct	4 ms	208 KB	Output is correct
11	Correct	5 ms	208 KB	Output is correct
12	Correct	4 ms	208 KB	Output is correct
13	Correct	1 ms	208 KB	Output is correct
14	Correct	1 ms	208 KB	Output is correct
15	Correct	1 ms	208 KB	Output is correct
16	Correct	0 ms	208 KB	Output is correct
17	Correct	1 ms	208 KB	Output is correct
18	Correct	0 ms	208 KB	Output is correct
19	Correct	3 ms	208 KB	Output is correct
20	Correct	3 ms	208 KB	Output is correct
21	Correct	1 ms	208 KB	Output is correct
22	Correct	4 ms	208 KB	Output is correct
23	Correct	4 ms	208 KB	Output is correct
24	Correct	3 ms	208 KB	Output is correct
25	Correct	5 ms	208 KB	Output is correct
26	Correct	58 ms	208 KB	Output is correct
27	Correct	57 ms	208 KB	Output is correct
28	Correct	107 ms	208 KB	Output is correct
29	Correct	95 ms	208 KB	Output is correct
30	Correct	94 ms	208 KB	Output is correct
31	Correct	109 ms	208 KB	Output is correct
32	Correct	0 ms	208 KB	Output is correct
33	Correct	0 ms	208 KB	Output is correct
34	Correct	1 ms	208 KB	Output is correct
35	Correct	0 ms	208 KB	Output is correct
36	Correct	1 ms	208 KB	Output is correct
37	Correct	0 ms	208 KB	Output is correct
38	Correct	2 ms	208 KB	Output is correct
39	Correct	3 ms	208 KB	Output is correct
40	Correct	0 ms	208 KB	Output is correct
41	Correct	4 ms	208 KB	Output is correct
42	Correct	3 ms	296 KB	Output is correct
43	Correct	6 ms	208 KB	Output is correct
44	Correct	4 ms	208 KB	Output is correct
45	Correct	61 ms	208 KB	Output is correct
46	Correct	60 ms	208 KB	Output is correct
47	Correct	92 ms	208 KB	Output is correct
48	Correct	96 ms	208 KB	Output is correct
49	Correct	129 ms	208 KB	Output is correct
50	Correct	81 ms	208 KB	Output is correct
51	Correct	0 ms	208 KB	Output is correct
52	Correct	171 ms	292 KB	Output is correct
53	Incorrect	180 ms	208 KB	Not correct
54	Halted	0 ms	0 KB	-

Subtask #5
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	1 ms	208 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	0 ms	208 KB	Output is correct
7	Correct	0 ms	208 KB	Output is correct
8	Correct	0 ms	208 KB	Output is correct
9	Correct	4 ms	208 KB	Output is correct
10	Correct	4 ms	208 KB	Output is correct
11	Correct	5 ms	208 KB	Output is correct
12	Correct	4 ms	208 KB	Output is correct
13	Correct	1 ms	208 KB	Output is correct
14	Correct	1 ms	208 KB	Output is correct
15	Correct	1 ms	208 KB	Output is correct
16	Correct	0 ms	208 KB	Output is correct
17	Correct	1 ms	208 KB	Output is correct
18	Correct	0 ms	208 KB	Output is correct
19	Correct	3 ms	208 KB	Output is correct
20	Correct	3 ms	208 KB	Output is correct
21	Correct	1 ms	208 KB	Output is correct
22	Correct	4 ms	208 KB	Output is correct
23	Correct	4 ms	208 KB	Output is correct
24	Correct	3 ms	208 KB	Output is correct
25	Correct	5 ms	208 KB	Output is correct
26	Correct	58 ms	208 KB	Output is correct
27	Correct	57 ms	208 KB	Output is correct
28	Correct	107 ms	208 KB	Output is correct
29	Correct	95 ms	208 KB	Output is correct
30	Correct	94 ms	208 KB	Output is correct
31	Correct	109 ms	208 KB	Output is correct
32	Correct	0 ms	208 KB	Output is correct
33	Correct	0 ms	208 KB	Output is correct
34	Correct	1 ms	208 KB	Output is correct
35	Correct	0 ms	208 KB	Output is correct
36	Correct	1 ms	208 KB	Output is correct
37	Correct	0 ms	208 KB	Output is correct
38	Correct	2 ms	208 KB	Output is correct
39	Correct	3 ms	208 KB	Output is correct
40	Correct	0 ms	208 KB	Output is correct
41	Correct	4 ms	208 KB	Output is correct
42	Correct	3 ms	296 KB	Output is correct
43	Correct	6 ms	208 KB	Output is correct
44	Correct	4 ms	208 KB	Output is correct
45	Correct	61 ms	208 KB	Output is correct
46	Correct	60 ms	208 KB	Output is correct
47	Correct	92 ms	208 KB	Output is correct
48	Correct	96 ms	208 KB	Output is correct
49	Correct	129 ms	208 KB	Output is correct
50	Correct	81 ms	208 KB	Output is correct
51	Correct	0 ms	208 KB	Output is correct
52	Correct	171 ms	292 KB	Output is correct
53	Incorrect	180 ms	208 KB	Not correct
54	Halted	0 ms	0 KB	-

Subtask #6
0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	1 ms	208 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	0 ms	208 KB	Output is correct
7	Correct	0 ms	208 KB	Output is correct
8	Correct	0 ms	208 KB	Output is correct
9	Correct	4 ms	208 KB	Output is correct
10	Correct	4 ms	208 KB	Output is correct
11	Correct	5 ms	208 KB	Output is correct
12	Correct	4 ms	208 KB	Output is correct
13	Correct	1 ms	208 KB	Output is correct
14	Correct	1 ms	208 KB	Output is correct
15	Correct	1 ms	208 KB	Output is correct
16	Correct	0 ms	208 KB	Output is correct
17	Correct	1 ms	208 KB	Output is correct
18	Correct	0 ms	208 KB	Output is correct
19	Correct	3 ms	208 KB	Output is correct
20	Correct	3 ms	208 KB	Output is correct
21	Correct	1 ms	208 KB	Output is correct
22	Correct	4 ms	208 KB	Output is correct
23	Correct	4 ms	208 KB	Output is correct
24	Correct	3 ms	208 KB	Output is correct
25	Correct	5 ms	208 KB	Output is correct
26	Correct	58 ms	208 KB	Output is correct
27	Correct	57 ms	208 KB	Output is correct
28	Correct	107 ms	208 KB	Output is correct
29	Correct	95 ms	208 KB	Output is correct
30	Correct	94 ms	208 KB	Output is correct
31	Correct	109 ms	208 KB	Output is correct
32	Correct	0 ms	208 KB	Output is correct
33	Correct	0 ms	208 KB	Output is correct
34	Correct	1 ms	208 KB	Output is correct
35	Correct	0 ms	208 KB	Output is correct
36	Correct	1 ms	208 KB	Output is correct
37	Correct	0 ms	208 KB	Output is correct
38	Correct	2 ms	208 KB	Output is correct
39	Correct	3 ms	208 KB	Output is correct
40	Correct	0 ms	208 KB	Output is correct
41	Correct	4 ms	208 KB	Output is correct
42	Correct	3 ms	296 KB	Output is correct
43	Correct	6 ms	208 KB	Output is correct
44	Correct	4 ms	208 KB	Output is correct
45	Correct	61 ms	208 KB	Output is correct
46	Correct	60 ms	208 KB	Output is correct
47	Correct	92 ms	208 KB	Output is correct
48	Correct	96 ms	208 KB	Output is correct
49	Correct	129 ms	208 KB	Output is correct
50	Correct	81 ms	208 KB	Output is correct
51	Correct	0 ms	208 KB	Output is correct
52	Correct	171 ms	292 KB	Output is correct
53	Incorrect	180 ms	208 KB	Not correct
54	Halted	0 ms	0 KB	-

답안 #704004

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 15.0 / 15.0

Subtask #3 15.0 / 15.0

Subtask #4 0 / 15.0

Subtask #5 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
0 / 15.0

Subtask #5
0 / 20.0

Subtask #6
0 / 30.0