oj.uz

답안 #877676

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
877676 2023-11-23T12:32:59 Z vjudge1 Art Collections (BOI22_art) C++17
0 / 100
 0 ms 600 KB 
#include <bits/stdc++.h>
#include "art.h"

#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

void setIO() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

int dp[251][251];
void solve(int N) {
    if(N <= 250) {
       memset(dp, -1, sizeof(dp));
       vector<int> v, v2;
       for(int i=1; i<=N; i++) v.push_back(i);
       v = v2;

       int mx = publish(v);

       auto cmp = [&](int a, int b) {
        if(dp[a][b] != -1) return dp[a][b];
        
        swap(v2[a-1], v2[b-1]);
        int inversions = publish(v2);
        swap(v2[a-1], v2[b-1]);

        bool ans = 0;
        if(inversions < mx && a >= b) ans = 1;
        else if(inversions >= mx && a < b) ans = 1;
        return dp[a][b] = ans;
       };

       stable_sort(all(v), cmp);

       answer(v);
    }
}

// int32_t main() {
//     setIO();

    

//     return 0;
// }

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 Incorrect 0 ms 600 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 600 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 600 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 600 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 600 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 600 KB Not correct
2 Halted 0 ms 0 KB -