답안 #749293

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
749293	2023-05-27T17:23:08 Z	GrindMachine	Art Collections (BOI22_art)	C++17	20 / 100	105 ms	248 KB

// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "art.h"

void solve(int n) {
    vector<int> bef_cnt(n);

    rep(i,n){
        for(int j = i + 1; j < n; ++j){
            // check if pos[i] < pos[j]
            vector<int> a(n);
            a[0] = i+1, a[1] = j+1;
            int ptr = 2;

            rep(k,n){
                if(k == i or k == j) conts;
                a[ptr++] = k+1;
            }

            auto b = a;
            swap(b[0], b[1]);

            int res1 = publish(a);
            int res2 = publish(b);

            if(res1 < res2){
                // pos[i] < pos[j]
                bef_cnt[j]++;
            }
            else{
                // pos[i] > pos[j]
                bef_cnt[i]++;
            }
        }
    }

    vector<pii> order;
    rep(i,n) order.pb({bef_cnt[i], i});

    sort(all(order));

    vector<int> ans;
    trav(p,order) ans.pb(p.ss+1);

    assert(publish(ans) == 0);
    answer(ans);
}

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

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	1 ms	208 KB	Output is correct
3	Correct	1 ms	208 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	1 ms	208 KB	Output is correct

Subtask #2
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	1 ms	208 KB	Output is correct
3	Correct	1 ms	208 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	1 ms	208 KB	Output is correct
8	Correct	0 ms	208 KB	Output is correct
9	Correct	23 ms	208 KB	Output is correct
10	Correct	16 ms	208 KB	Output is correct
11	Correct	19 ms	208 KB	Output is correct
12	Correct	24 ms	208 KB	Output is correct
13	Correct	1 ms	248 KB	Output is correct
14	Correct	1 ms	208 KB	Output is correct
15	Correct	1 ms	208 KB	Output is correct
16	Correct	1 ms	208 KB	Output is correct
17	Correct	1 ms	208 KB	Output is correct
18	Correct	1 ms	208 KB	Output is correct
19	Correct	17 ms	208 KB	Output is correct
20	Correct	17 ms	208 KB	Output is correct

Subtask #3
0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	1 ms	208 KB	Output is correct
3	Correct	1 ms	208 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	1 ms	208 KB	Output is correct
8	Correct	0 ms	208 KB	Output is correct
9	Correct	23 ms	208 KB	Output is correct
10	Correct	16 ms	208 KB	Output is correct
11	Correct	19 ms	208 KB	Output is correct
12	Correct	24 ms	208 KB	Output is correct
13	Correct	1 ms	248 KB	Output is correct
14	Correct	1 ms	208 KB	Output is correct
15	Correct	1 ms	208 KB	Output is correct
16	Correct	1 ms	208 KB	Output is correct
17	Correct	1 ms	208 KB	Output is correct
18	Correct	1 ms	208 KB	Output is correct
19	Correct	17 ms	208 KB	Output is correct
20	Correct	17 ms	208 KB	Output is correct
21	Correct	0 ms	208 KB	Output is correct
22	Correct	21 ms	208 KB	Output is correct
23	Correct	21 ms	208 KB	Output is correct
24	Correct	21 ms	208 KB	Output is correct
25	Correct	20 ms	208 KB	Output is correct
26	Incorrect	105 ms	208 KB	Not correct
27	Halted	0 ms	0 KB	-

Subtask #4
0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	1 ms	208 KB	Output is correct
3	Correct	1 ms	208 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	1 ms	208 KB	Output is correct
8	Correct	0 ms	208 KB	Output is correct
9	Correct	23 ms	208 KB	Output is correct
10	Correct	16 ms	208 KB	Output is correct
11	Correct	19 ms	208 KB	Output is correct
12	Correct	24 ms	208 KB	Output is correct
13	Correct	1 ms	248 KB	Output is correct
14	Correct	1 ms	208 KB	Output is correct
15	Correct	1 ms	208 KB	Output is correct
16	Correct	1 ms	208 KB	Output is correct
17	Correct	1 ms	208 KB	Output is correct
18	Correct	1 ms	208 KB	Output is correct
19	Correct	17 ms	208 KB	Output is correct
20	Correct	17 ms	208 KB	Output is correct
21	Correct	0 ms	208 KB	Output is correct
22	Correct	21 ms	208 KB	Output is correct
23	Correct	21 ms	208 KB	Output is correct
24	Correct	21 ms	208 KB	Output is correct
25	Correct	20 ms	208 KB	Output is correct
26	Incorrect	105 ms	208 KB	Not correct
27	Halted	0 ms	0 KB	-

Subtask #5
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	1 ms	208 KB	Output is correct
3	Correct	1 ms	208 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	1 ms	208 KB	Output is correct
8	Correct	0 ms	208 KB	Output is correct
9	Correct	23 ms	208 KB	Output is correct
10	Correct	16 ms	208 KB	Output is correct
11	Correct	19 ms	208 KB	Output is correct
12	Correct	24 ms	208 KB	Output is correct
13	Correct	1 ms	248 KB	Output is correct
14	Correct	1 ms	208 KB	Output is correct
15	Correct	1 ms	208 KB	Output is correct
16	Correct	1 ms	208 KB	Output is correct
17	Correct	1 ms	208 KB	Output is correct
18	Correct	1 ms	208 KB	Output is correct
19	Correct	17 ms	208 KB	Output is correct
20	Correct	17 ms	208 KB	Output is correct
21	Correct	0 ms	208 KB	Output is correct
22	Correct	21 ms	208 KB	Output is correct
23	Correct	21 ms	208 KB	Output is correct
24	Correct	21 ms	208 KB	Output is correct
25	Correct	20 ms	208 KB	Output is correct
26	Incorrect	105 ms	208 KB	Not correct
27	Halted	0 ms	0 KB	-

Subtask #6
0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	1 ms	208 KB	Output is correct
3	Correct	1 ms	208 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	1 ms	208 KB	Output is correct
8	Correct	0 ms	208 KB	Output is correct
9	Correct	23 ms	208 KB	Output is correct
10	Correct	16 ms	208 KB	Output is correct
11	Correct	19 ms	208 KB	Output is correct
12	Correct	24 ms	208 KB	Output is correct
13	Correct	1 ms	248 KB	Output is correct
14	Correct	1 ms	208 KB	Output is correct
15	Correct	1 ms	208 KB	Output is correct
16	Correct	1 ms	208 KB	Output is correct
17	Correct	1 ms	208 KB	Output is correct
18	Correct	1 ms	208 KB	Output is correct
19	Correct	17 ms	208 KB	Output is correct
20	Correct	17 ms	208 KB	Output is correct
21	Correct	0 ms	208 KB	Output is correct
22	Correct	21 ms	208 KB	Output is correct
23	Correct	21 ms	208 KB	Output is correct
24	Correct	21 ms	208 KB	Output is correct
25	Correct	20 ms	208 KB	Output is correct
26	Incorrect	105 ms	208 KB	Not correct
27	Halted	0 ms	0 KB	-

답안 #749293

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 15.0 / 15.0

Subtask #3 0 / 15.0

Subtask #4 0 / 15.0

Subtask #5 0 / 20.0

Subtask #6 0 / 30.0

Subtask #1
5.0 / 5.0

Subtask #2
15.0 / 15.0

Subtask #3
0 / 15.0

Subtask #4
0 / 15.0

Subtask #5
0 / 20.0

Subtask #6
0 / 30.0