oj.uz

Submission #595623

# Submission time Handle Problem Language Result Execution time Memory
595623 2022-07-13T22:04:30 Z ThegeekKnight16 Art Collections (BOI22_art) C++17
0 / 100
 1 ms 208 KB 
#include <bits/stdc++.h>
#include <art.h>
using namespace std;
const int MAXN = 4e3 + 10;
int pos[MAXN];

void solve(int N)
{
    vector<int> v;
    for (int i = 1; i <= N; i++) {v.push_back(i); pos[i] = i-1;}
    
    int lastPermut = publish(v);
    for (int i = 1; i < N; i++)
    {
        int x = v[i];
        while (pos[x] > 0)
        {
            swap(v[pos[x]], v[pos[x]-1]);
            int newPermut = publish(v);
            if (newPermut > lastPermut) {swap(v[pos[x]], v[pos[x]-1]); break;}
            pos[v[pos[x]-1]]++;
            pos[x]--;
            lastPermut = newPermut;
        }
    }
    answer(v);
}

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
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Incorrect 1 ms 208 KB Not correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Incorrect 1 ms 208 KB Not correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Incorrect 1 ms 208 KB Not correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Incorrect 1 ms 208 KB Not correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Incorrect 1 ms 208 KB Not correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Incorrect 1 ms 208 KB Not correct
4 Halted 0 ms 0 KB -