oj.uz

Submission #849243

# Submission time Handle Problem Language Result Execution time Memory
849243 2023-09-14T09:54:32 Z vjudge1 Art Collections (BOI22_art) C++17
20 / 100
 94 ms 344 KB 
#include <bits/stdc++.h>
#define all(v) ((v).begin(),(v).end())
#define ll long long
#define F first
#define S second
const ll mod = 1e9 + 7;
const ll mxN = 1e5 + 2;
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);
// }
// 
// namespace {
//   int N;
//   int Q = 0;
//   const int MAX_Q = 4000;
//   const int MAX_N = 4000;
//   vector<int> solution;
// }  // namespace
// 
// 
// 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 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 answer(std::vector<int>);

void solve(int N) {
    vector<int>order;
    for(int i = 1; i<= N;i++){
      order.push_back(i);
    }
    int x = publish(order);
    while(1) {
      bool cont = 0;
      for(int i = 0; i < N - 1;i++){
        swap(order[i],order[i + 1]);
        int y = publish(order);
        if(y < x){
          cont = 1;
          x = y;
          // break;
        }else{
          swap(order[i],order[i + 1]);
        }
      }
      if(!cont)break;
    }
    answer(order);
}


// 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!");
// }

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 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 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 1 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 1 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 1 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 7 ms 344 KB Output is correct
10 Correct 10 ms 344 KB Output is correct
11 Correct 11 ms 344 KB Output is correct
12 Correct 11 ms 344 KB Output is correct
13 Correct 0 ms 340 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 12 ms 344 KB Output is correct

Subtask #3
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 1 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 1 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 7 ms 344 KB Output is correct
10 Correct 10 ms 344 KB Output is correct
11 Correct 11 ms 344 KB Output is correct
12 Correct 11 ms 344 KB Output is correct
13 Correct 0 ms 340 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 12 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 8 ms 344 KB Output is correct
23 Correct 9 ms 344 KB Output is correct
24 Correct 12 ms 344 KB Output is correct
25 Correct 10 ms 344 KB Output is correct
26 Correct 6 ms 344 KB Output is correct
27 Incorrect 94 ms 344 KB Not correct
28 Halted 0 ms 0 KB -

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 1 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 1 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 7 ms 344 KB Output is correct
10 Correct 10 ms 344 KB Output is correct
11 Correct 11 ms 344 KB Output is correct
12 Correct 11 ms 344 KB Output is correct
13 Correct 0 ms 340 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 12 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 8 ms 344 KB Output is correct
23 Correct 9 ms 344 KB Output is correct
24 Correct 12 ms 344 KB Output is correct
25 Correct 10 ms 344 KB Output is correct
26 Correct 6 ms 344 KB Output is correct
27 Incorrect 94 ms 344 KB Not correct
28 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 1 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 1 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 7 ms 344 KB Output is correct
10 Correct 10 ms 344 KB Output is correct
11 Correct 11 ms 344 KB Output is correct
12 Correct 11 ms 344 KB Output is correct
13 Correct 0 ms 340 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 12 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 8 ms 344 KB Output is correct
23 Correct 9 ms 344 KB Output is correct
24 Correct 12 ms 344 KB Output is correct
25 Correct 10 ms 344 KB Output is correct
26 Correct 6 ms 344 KB Output is correct
27 Incorrect 94 ms 344 KB Not correct
28 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 1 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 1 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 7 ms 344 KB Output is correct
10 Correct 10 ms 344 KB Output is correct
11 Correct 11 ms 344 KB Output is correct
12 Correct 11 ms 344 KB Output is correct
13 Correct 0 ms 340 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 12 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 8 ms 344 KB Output is correct
23 Correct 9 ms 344 KB Output is correct
24 Correct 12 ms 344 KB Output is correct
25 Correct 10 ms 344 KB Output is correct
26 Correct 6 ms 344 KB Output is correct
27 Incorrect 94 ms 344 KB Not correct
28 Halted 0 ms 0 KB -