oj.uz

답안 #868722

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
868722 2023-11-01T19:04:30 Z Ludissey Art Collections (BOI22_art) C++17
0 / 100
 0 ms 344 KB 
#include "art.h"
#include <bits/stdc++.h>

using namespace std;
vector<int> order;
int N;

int findNumb(int x) {
    for (int i = 0; i < N; i++) if(order[i]==x) return i;
}

void findOrder(int l, int r){
    if(r-l<2) return;
    vector<int> new_order=order;
    int i=l;
    int minOrder=publish(order);
    int iOrder=i;
    for (int j = i+1; j < r; j++)
    {
        swap(new_order[j-1],new_order[j]);
        int val=publish(new_order);
        if(val<minOrder) {
            minOrder=val;
            iOrder=j;
        }
    }
    for (int j = l; j < iOrder; j++)
    {
        swap(order[j],order[j+1]);
    }
    findOrder(l, iOrder);
    findOrder(iOrder+1, r);
}

void solve(int n) {
    N=n;
    order.resize(N);
    for (int i = 0; i < N; i++) order[i]=i+1;
    vector<bool> skip(n,false);
    findOrder(0,N);
    answer(order);
}

Compilation message

art.cpp: In function 'int findNumb(int)':
art.cpp:10:1: warning: control reaches end of non-void function [-Wreturn-type]
   10 | }
      | ^
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

# 결과 실행 시간 메모리 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 Incorrect 0 ms 344 KB Not correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 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 Incorrect 0 ms 344 KB Not correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 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 Incorrect 0 ms 344 KB Not correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 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 Incorrect 0 ms 344 KB Not correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 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 Incorrect 0 ms 344 KB Not correct
6 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 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 Incorrect 0 ms 344 KB Not correct
6 Halted 0 ms 0 KB -