oj.uz

Submission #1072257

# Submission time Handle Problem Language Result Execution time Memory
1072257 2024-08-23T16:04:53 Z duckindog Art Collections (BOI22_art) C++17
35 / 100
 119 ms 596 KB 
#include <bits/stdc++.h>

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

using namespace std;

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);
}

#ifdef LOCAL
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

void solve(int n) {
  vector<int> vt(n); iota(vt.begin(), vt.end(), 1);

  for (int i = 1; i < n; ++i) { 
    int x = vt.end()[-1 - i];
    vt.erase(vt.end() - i - 1, vt.end() - i);

    vector<int> fast(n + 1);

    auto chk = [&](int p) { 
      if (fast[p]) return fast[p];

      vt.insert(vt.end() - p, x);
      int ret = publish(vt);
      if (!ret) { answer(vt); exit(0); }

      vt.erase(vt.end() - p - 1, vt.end() - p);
      return fast[p] = ret;
    };

    int l = 0, r = i - 1, it = 0;
    while (l <= r) { 
      int mid = l + r >> 1;
      if (chk(mid) > chk(mid + 1)) l = it = mid + 1;
      else r = mid - 1;
    }

    vt.insert(vt.end() - it, x);
  }
  answer(vt);
}

#ifdef LOCAL
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 'void solve(int)':
art.cpp:106:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  106 |       int mid = l + r >> 1;
      |                 ~~^~~
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

# 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 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 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct

Subtask #2
15.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 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 0 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 3 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 3 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 0 ms 344 KB Output is correct
20 Correct 2 ms 344 KB Output is correct

Subtask #3
15.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 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 0 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 3 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 3 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 0 ms 344 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 2 ms 344 KB Output is correct
23 Correct 3 ms 344 KB Output is correct
24 Correct 2 ms 344 KB Output is correct
25 Correct 3 ms 344 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 51 ms 344 KB Output is correct
28 Correct 55 ms 344 KB Output is correct
29 Correct 66 ms 344 KB Output is correct
30 Correct 49 ms 340 KB Output is correct
31 Correct 50 ms 344 KB Output is correct
32 Correct 0 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 0 ms 344 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 2 ms 344 KB Output is correct

Subtask #4
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 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 0 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 3 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 3 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 0 ms 344 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 2 ms 344 KB Output is correct
23 Correct 3 ms 344 KB Output is correct
24 Correct 2 ms 344 KB Output is correct
25 Correct 3 ms 344 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 51 ms 344 KB Output is correct
28 Correct 55 ms 344 KB Output is correct
29 Correct 66 ms 344 KB Output is correct
30 Correct 49 ms 340 KB Output is correct
31 Correct 50 ms 344 KB Output is correct
32 Correct 0 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 0 ms 344 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 2 ms 344 KB Output is correct
40 Correct 0 ms 344 KB Output is correct
41 Correct 2 ms 344 KB Output is correct
42 Correct 2 ms 344 KB Output is correct
43 Correct 2 ms 344 KB Output is correct
44 Correct 2 ms 596 KB Output is correct
45 Correct 0 ms 344 KB Output is correct
46 Correct 68 ms 344 KB Output is correct
47 Correct 65 ms 344 KB Output is correct
48 Correct 47 ms 344 KB Output is correct
49 Correct 64 ms 344 KB Output is correct
50 Correct 54 ms 344 KB Output is correct
51 Correct 1 ms 344 KB Output is correct
52 Correct 0 ms 344 KB Output is correct
53 Incorrect 119 ms 344 KB Not correct
54 Halted 0 ms 0 KB -

Subtask #5
0 / 20.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 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 0 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 3 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 3 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 0 ms 344 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 2 ms 344 KB Output is correct
23 Correct 3 ms 344 KB Output is correct
24 Correct 2 ms 344 KB Output is correct
25 Correct 3 ms 344 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 51 ms 344 KB Output is correct
28 Correct 55 ms 344 KB Output is correct
29 Correct 66 ms 344 KB Output is correct
30 Correct 49 ms 340 KB Output is correct
31 Correct 50 ms 344 KB Output is correct
32 Correct 0 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 0 ms 344 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 2 ms 344 KB Output is correct
40 Correct 0 ms 344 KB Output is correct
41 Correct 2 ms 344 KB Output is correct
42 Correct 2 ms 344 KB Output is correct
43 Correct 2 ms 344 KB Output is correct
44 Correct 2 ms 596 KB Output is correct
45 Correct 0 ms 344 KB Output is correct
46 Correct 68 ms 344 KB Output is correct
47 Correct 65 ms 344 KB Output is correct
48 Correct 47 ms 344 KB Output is correct
49 Correct 64 ms 344 KB Output is correct
50 Correct 54 ms 344 KB Output is correct
51 Correct 1 ms 344 KB Output is correct
52 Correct 0 ms 344 KB Output is correct
53 Incorrect 119 ms 344 KB Not correct
54 Halted 0 ms 0 KB -

Subtask #6
0 / 30.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 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 0 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 3 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 3 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 0 ms 344 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 2 ms 344 KB Output is correct
23 Correct 3 ms 344 KB Output is correct
24 Correct 2 ms 344 KB Output is correct
25 Correct 3 ms 344 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 51 ms 344 KB Output is correct
28 Correct 55 ms 344 KB Output is correct
29 Correct 66 ms 344 KB Output is correct
30 Correct 49 ms 340 KB Output is correct
31 Correct 50 ms 344 KB Output is correct
32 Correct 0 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 0 ms 344 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 2 ms 344 KB Output is correct
40 Correct 0 ms 344 KB Output is correct
41 Correct 2 ms 344 KB Output is correct
42 Correct 2 ms 344 KB Output is correct
43 Correct 2 ms 344 KB Output is correct
44 Correct 2 ms 596 KB Output is correct
45 Correct 0 ms 344 KB Output is correct
46 Correct 68 ms 344 KB Output is correct
47 Correct 65 ms 344 KB Output is correct
48 Correct 47 ms 344 KB Output is correct
49 Correct 64 ms 344 KB Output is correct
50 Correct 54 ms 344 KB Output is correct
51 Correct 1 ms 344 KB Output is correct
52 Correct 0 ms 344 KB Output is correct
53 Incorrect 119 ms 344 KB Not correct
54 Halted 0 ms 0 KB -