oj.uz

Submission #595381

# Submission time Handle Problem Language Result Execution time Memory
595381 2022-07-13T16:58:04 Z Deepesson Art Collections (BOI22_art) C++17
5 / 100
 64 ms 336 KB 
#include <bits/stdc++.h>
/**
 * returns how many complaints you will receive for this ordering of the art collections
 */
int publish(std::vector<int>);

/**
 * use this function when you have found the correct order of the art collections
 * You must call answer exactly once; your program will be automatically
 * terminated afterwards.
 */
void answer(std::vector<int>);

/**
 * implement this function
 */
void solve(int N);


void solve(int N) {
    std::vector<int> order;
    for(int i=0;i!=N;++i)order.push_back(i+1);
    for(;;){
        int x = publish(order);
        if(!x){
            answer(order);
            return;
        }
        std::next_permutation(order.begin(),order.end());
    }
}

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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 7 ms 208 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 3 ms 208 KB Output is correct
7 Correct 2 ms 336 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 7 ms 208 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 3 ms 208 KB Output is correct
7 Correct 2 ms 336 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Incorrect 64 ms 208 KB Not correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 7 ms 208 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 3 ms 208 KB Output is correct
7 Correct 2 ms 336 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Incorrect 64 ms 208 KB Not correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 7 ms 208 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 3 ms 208 KB Output is correct
7 Correct 2 ms 336 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Incorrect 64 ms 208 KB Not correct
10 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 7 ms 208 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 3 ms 208 KB Output is correct
7 Correct 2 ms 336 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Incorrect 64 ms 208 KB Not correct
10 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 7 ms 208 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 3 ms 208 KB Output is correct
7 Correct 2 ms 336 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Incorrect 64 ms 208 KB Not correct
10 Halted 0 ms 0 KB -