oj.uz

답안 #849254

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
849254 2023-09-14T10:09:59 Z vjudge1 Art Collections (BOI22_art) C++17
0 / 100
 1 ms 344 KB 
#include "art.h"
#include "bits/stdc++.h"
using namespace std;

const int mxN = 4007;

int n, pos[mxN];
bool les[mxN][mxN];

void fix(int a, int b) {
    les[a][b] = true;
    for (int c = 1; c <= n; ++c) {
        if (les[b][c] && !les[a][c]) {
            fix(a, c);
        }
    }
}

void solve(int N) {
    n = N;

    vector<int> check;
    for (int i = 1; i <= n; ++i) {
        check.push_back(i);
        pos[i] = i - 1;
    }
    
    int cur = publish(check);
    while (cur) {
        for (int i = 0; i < n - 1 && cur; ++i) {
            int a = check[i], b = check[i + 1];
            if (!les[a][b] && !les[b][a]) {
                swap(check[i], check[i + 1]);
                int nex = publish(check);

                if (nex < cur) {
                    cur = nex;
                    fix(a, b);
                }
                else {
                    fix(b, a);
                    swap(check[i], check[i + 1]);
                }
            }
            else if (les[a][b]) {
                swap(check[i], check[i + 1]);
                --cur;
            }
            else if (les[b][a]) {
                swap(check[i + 1], check[i]);
                --cur;
            }
        }
    }
    
    answer(check);
}

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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 1 ms 344 KB Not correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 1 ms 344 KB Not correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 1 ms 344 KB Not correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 1 ms 344 KB Not correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 1 ms 344 KB Not correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 1 ms 344 KB Not correct
4 Halted 0 ms 0 KB -