oj.uz

답안 #1094621

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1094621 2024-09-30T07:04:11 Z crafticat Art Collections (BOI22_art) C++17
100 / 100
 1247 ms 1820 KB 
#include "bits/stdc++.h"

using namespace std;
template<typename T>
using V = vector<T>;
using vi = V<int>;

#define F0R(i, n) for(int i = 0; i < n;i++)
#define FOR(i,a, n) for(int i = a; i < n;i++)
#define pb push_back

int publish(std::vector<int>);

void answer(std::vector<int>);

vi remove(vi a, int x) {
    vi aNew;
    F0R(i, a.size()) {
        if (i == x) continue;
        aNew.pb(a[i]);
    }
    return aNew;
}
vi add(vi a, int x, int u) {
    vi aNew;
    F0R(i, a.size() + 1) {
        if (i == x) {
            aNew.pb(u);
        }
        if (i < a.size()) aNew.pb(a[i]);
    }

    return aNew;
}

void solve(int N) {
    vi perm(N);
    F0R(i, N)
        perm[i] = i + 1;

    int score = publish(perm);

    FOR(i, 1, N) {
        perm = remove(perm, i);
        perm = add(perm, 0, i + 1);
        int diff = publish(perm) - score;
        int index = i - ((i - diff) / 2);
        perm = remove(perm, 0);
        perm = add(perm, index, i + 1);

        score -= i - index;
    }

    answer(perm);
}

#if DEBUG
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!");
}

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

art.cpp: In function 'vi remove(vi, int)':
art.cpp:8:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 | #define F0R(i, n) for(int i = 0; i < n;i++)
......
   18 |     F0R(i, a.size()) {
      |         ~~~~~~~~~~~                 
art.cpp:18:5: note: in expansion of macro 'F0R'
   18 |     F0R(i, a.size()) {
      |     ^~~
art.cpp: In function 'vi add(vi, int, int)':
art.cpp:8:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 | #define F0R(i, n) for(int i = 0; i < n;i++)
......
   26 |     F0R(i, a.size() + 1) {
      |         ~~~~~~~~~~~~~~~             
art.cpp:26:5: note: in expansion of macro 'F0R'
   26 |     F0R(i, a.size() + 1) {
      |     ^~~
art.cpp:30:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |         if (i < a.size()) aNew.pb(a[i]);
      |             ~~^~~~~~~~~~
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 340 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 356 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 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 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 1 ms 340 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 356 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 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 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 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 5 ms 340 KB Output is correct
27 Correct 5 ms 344 KB Output is correct
28 Correct 8 ms 344 KB Output is correct
29 Correct 5 ms 344 KB Output is correct
30 Correct 5 ms 344 KB Output is correct
31 Correct 6 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Correct 1 ms 596 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 1 ms 340 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 356 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 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 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 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 5 ms 340 KB Output is correct
27 Correct 5 ms 344 KB Output is correct
28 Correct 8 ms 344 KB Output is correct
29 Correct 5 ms 344 KB Output is correct
30 Correct 5 ms 344 KB Output is correct
31 Correct 6 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Correct 1 ms 596 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 1 ms 344 KB Output is correct
40 Correct 1 ms 344 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 0 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 5 ms 344 KB Output is correct
46 Correct 5 ms 344 KB Output is correct
47 Correct 5 ms 344 KB Output is correct
48 Correct 5 ms 344 KB Output is correct
49 Correct 5 ms 344 KB Output is correct
50 Correct 5 ms 344 KB Output is correct
51 Correct 0 ms 340 KB Output is correct
52 Correct 12 ms 344 KB Output is correct
53 Correct 18 ms 344 KB Output is correct
54 Correct 13 ms 344 KB Output is correct
55 Correct 13 ms 344 KB Output is correct
56 Correct 13 ms 344 KB Output is correct
57 Correct 14 ms 344 KB Output is correct
58 Correct 0 ms 344 KB Output is correct
59 Correct 0 ms 344 KB Output is correct
60 Correct 0 ms 344 KB Output is correct
61 Correct 1 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 0 ms 344 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 356 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 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 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 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 5 ms 340 KB Output is correct
27 Correct 5 ms 344 KB Output is correct
28 Correct 8 ms 344 KB Output is correct
29 Correct 5 ms 344 KB Output is correct
30 Correct 5 ms 344 KB Output is correct
31 Correct 6 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Correct 1 ms 596 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 1 ms 344 KB Output is correct
40 Correct 1 ms 344 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 0 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 5 ms 344 KB Output is correct
46 Correct 5 ms 344 KB Output is correct
47 Correct 5 ms 344 KB Output is correct
48 Correct 5 ms 344 KB Output is correct
49 Correct 5 ms 344 KB Output is correct
50 Correct 5 ms 344 KB Output is correct
51 Correct 0 ms 340 KB Output is correct
52 Correct 12 ms 344 KB Output is correct
53 Correct 18 ms 344 KB Output is correct
54 Correct 13 ms 344 KB Output is correct
55 Correct 13 ms 344 KB Output is correct
56 Correct 13 ms 344 KB Output is correct
57 Correct 14 ms 344 KB Output is correct
58 Correct 0 ms 344 KB Output is correct
59 Correct 0 ms 344 KB Output is correct
60 Correct 0 ms 344 KB Output is correct
61 Correct 1 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 0 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 420 KB Output is correct
69 Correct 1 ms 344 KB Output is correct
70 Correct 9 ms 432 KB Output is correct
71 Correct 5 ms 344 KB Output is correct
72 Correct 8 ms 344 KB Output is correct
73 Correct 5 ms 344 KB Output is correct
74 Correct 5 ms 344 KB Output is correct
75 Correct 5 ms 344 KB Output is correct
76 Correct 0 ms 344 KB Output is correct
77 Correct 19 ms 344 KB Output is correct
78 Correct 14 ms 344 KB Output is correct
79 Correct 13 ms 344 KB Output is correct
80 Correct 23 ms 344 KB Output is correct
81 Correct 17 ms 344 KB Output is correct
82 Correct 25 ms 344 KB Output is correct
83 Correct 255 ms 1584 KB Output is correct
84 Correct 354 ms 1408 KB Output is correct
85 Correct 266 ms 804 KB Output is correct
86 Correct 277 ms 1076 KB Output is correct
87 Correct 0 ms 344 KB Output is correct
88 Correct 261 ms 688 KB Output is correct
89 Correct 262 ms 992 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 0 ms 344 KB Output is correct

Subtask #6
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 356 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 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 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 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 5 ms 340 KB Output is correct
27 Correct 5 ms 344 KB Output is correct
28 Correct 8 ms 344 KB Output is correct
29 Correct 5 ms 344 KB Output is correct
30 Correct 5 ms 344 KB Output is correct
31 Correct 6 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Correct 1 ms 596 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 1 ms 344 KB Output is correct
40 Correct 1 ms 344 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 0 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 5 ms 344 KB Output is correct
46 Correct 5 ms 344 KB Output is correct
47 Correct 5 ms 344 KB Output is correct
48 Correct 5 ms 344 KB Output is correct
49 Correct 5 ms 344 KB Output is correct
50 Correct 5 ms 344 KB Output is correct
51 Correct 0 ms 340 KB Output is correct
52 Correct 12 ms 344 KB Output is correct
53 Correct 18 ms 344 KB Output is correct
54 Correct 13 ms 344 KB Output is correct
55 Correct 13 ms 344 KB Output is correct
56 Correct 13 ms 344 KB Output is correct
57 Correct 14 ms 344 KB Output is correct
58 Correct 0 ms 344 KB Output is correct
59 Correct 0 ms 344 KB Output is correct
60 Correct 0 ms 344 KB Output is correct
61 Correct 1 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 0 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 420 KB Output is correct
69 Correct 1 ms 344 KB Output is correct
70 Correct 9 ms 432 KB Output is correct
71 Correct 5 ms 344 KB Output is correct
72 Correct 8 ms 344 KB Output is correct
73 Correct 5 ms 344 KB Output is correct
74 Correct 5 ms 344 KB Output is correct
75 Correct 5 ms 344 KB Output is correct
76 Correct 0 ms 344 KB Output is correct
77 Correct 19 ms 344 KB Output is correct
78 Correct 14 ms 344 KB Output is correct
79 Correct 13 ms 344 KB Output is correct
80 Correct 23 ms 344 KB Output is correct
81 Correct 17 ms 344 KB Output is correct
82 Correct 25 ms 344 KB Output is correct
83 Correct 255 ms 1584 KB Output is correct
84 Correct 354 ms 1408 KB Output is correct
85 Correct 266 ms 804 KB Output is correct
86 Correct 277 ms 1076 KB Output is correct
87 Correct 0 ms 344 KB Output is correct
88 Correct 261 ms 688 KB Output is correct
89 Correct 262 ms 992 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 0 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 0 ms 344 KB Output is correct
100 Correct 1 ms 344 KB Output is correct
101 Correct 8 ms 344 KB Output is correct
102 Correct 5 ms 344 KB Output is correct
103 Correct 5 ms 344 KB Output is correct
104 Correct 9 ms 344 KB Output is correct
105 Correct 5 ms 344 KB Output is correct
106 Correct 8 ms 344 KB Output is correct
107 Correct 0 ms 344 KB Output is correct
108 Correct 16 ms 344 KB Output is correct
109 Correct 18 ms 344 KB Output is correct
110 Correct 13 ms 344 KB Output is correct
111 Correct 13 ms 344 KB Output is correct
112 Correct 13 ms 344 KB Output is correct
113 Correct 13 ms 344 KB Output is correct
114 Correct 243 ms 1060 KB Output is correct
115 Correct 324 ms 1352 KB Output is correct
116 Correct 267 ms 1652 KB Output is correct
117 Correct 344 ms 1820 KB Output is correct
118 Correct 0 ms 344 KB Output is correct
119 Correct 324 ms 1716 KB Output is correct
120 Correct 263 ms 1620 KB Output is correct
121 Correct 1004 ms 1424 KB Output is correct
122 Correct 1247 ms 1468 KB Output is correct
123 Correct 1135 ms 1228 KB Output is correct
124 Correct 1164 ms 1272 KB Output is correct
125 Correct 1020 ms 1064 KB Output is correct
126 Correct 1153 ms 1228 KB Output is correct
127 Correct 1 ms 344 KB Output is correct
128 Correct 0 ms 344 KB Output is correct
129 Correct 1 ms 344 KB Output is correct
130 Correct 1 ms 344 KB Output is correct
131 Correct 1 ms 344 KB Output is correct
132 Correct 0 ms 344 KB Output is correct