oj.uz

Submission #902593

# Submission time Handle Problem Language Result Execution time Memory
902593 2024-01-10T18:49:42 Z gogopro Art Collections (BOI22_art) C++17
5 / 100
 29 ms 596 KB 
#include <algorithm>
#include <iostream>
#include <random>
#include "art.h"
using namespace std;
//
// --- Sample implementation for the task art ---
//
// To compile this program with the sample grader, place:
//     art.h art_sample.cpp sample_grader.cpp
// in a single folder, then open the terminal in this directory (right-click onto an empty spot in the directory,
// left click on "Open in terminal") and enter e.g.:
//     g++ -std=c++17 art_sample.cpp sample_grader.cpp
// in this folder. This will create a file a.out in the current directory which you can execute from the terminal
// as ./a.out
// See task statement or sample_grader.cpp for the input specification
//
int complaints;
vector<int> order;

void solve(int N) {

    order.reserve(N);
    for (int i = 0; i < N; ++i) {
        order.push_back(i + 1);
    }
    int current_idx = 0;
    complaints = publish(order);
    stable_sort(order.begin(), order.end());
    std::random_device rd;
    std::mt19937 g(rd());
    vector<int> indexes;
    indexes.reserve(N);
    for (int i = 0; i < N; ++i) {
        indexes.push_back(i);

    }
    shuffle(indexes.begin(), indexes.end(), g);
    while (complaints != 0) {
        swap(order[indexes[current_idx]], order[indexes[current_idx + 1]]);
        int new_complaints = publish(order);
        if (new_complaints > complaints) swap(order[indexes[current_idx]], order[indexes[current_idx + 1]]); // return to back
        ++current_idx;
        complaints = min(complaints, new_complaints);
        if (current_idx == order.size() - 1) {
            current_idx = 0;
            shuffle(indexes.begin(), indexes.end(), g);
        }
    }
    answer(order);
}

Compilation message

art.cpp: In function 'void solve(int)':
art.cpp:45:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |         if (current_idx == order.size() - 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 1 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 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 22 ms 344 KB Output is correct
10 Correct 24 ms 344 KB Output is correct
11 Correct 21 ms 344 KB Output is correct
12 Correct 25 ms 596 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 596 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 Incorrect 29 ms 596 KB Not correct
21 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 22 ms 344 KB Output is correct
10 Correct 24 ms 344 KB Output is correct
11 Correct 21 ms 344 KB Output is correct
12 Correct 25 ms 596 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 596 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 Incorrect 29 ms 596 KB Not correct
21 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 22 ms 344 KB Output is correct
10 Correct 24 ms 344 KB Output is correct
11 Correct 21 ms 344 KB Output is correct
12 Correct 25 ms 596 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 596 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 Incorrect 29 ms 596 KB Not correct
21 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 22 ms 344 KB Output is correct
10 Correct 24 ms 344 KB Output is correct
11 Correct 21 ms 344 KB Output is correct
12 Correct 25 ms 596 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 596 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 Incorrect 29 ms 596 KB Not correct
21 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 22 ms 344 KB Output is correct
10 Correct 24 ms 344 KB Output is correct
11 Correct 21 ms 344 KB Output is correct
12 Correct 25 ms 596 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 596 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 Incorrect 29 ms 596 KB Not correct
21 Halted 0 ms 0 KB -