oj.uz

Submission #714223

# Submission time Handle Problem Language Result Execution time Memory
714223 2023-03-24T06:44:17 Z vjudge1 Art Collections (BOI22_art) C++17
20 / 100
 87 ms 256 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")

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

/* DEFINES */
#define F first
#define S second
#define ll long long
#define ull unsigned long long
#define ld long double
#define npos ULLONG_MAX
#define INF LLONG_MAX
#define vv(a) vector<a>
#define pp(a, b) pair<a, b>
#define pq(a) priority_queue<a>
#define qq(a) queue<a>
#define ss(a) set<a>
#define mm(a, b) map<a, b>
#define ump(a, b) unordered_map<a, b>
#define sync                      \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);
#define elif else if
#define endl "\n"
#define allc(a) begin(a), end(a)
#define all(a) a, a + sizeof(a) / sizeof(a[0])
#define pb push_back
#define logi(a) __lg(a)
#define sqrt(a) sqrtl(a)
#define mpr make_pair
#define ins insert
using namespace std;
using namespace __gnu_pbds;
using namespace __cxx11;
typedef char chr;
typedef basic_string<chr> str;
template <typename T, typename key = less<T>>
using ordered_set = tree<T, null_type, key, rb_tree_tag, tree_order_statistics_node_update>;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

void solve(int n)
{
    vv(int) ans;
    vv(int) r;
    for (ll i = 1; i <= n; i++)
        r.pb(i);
    for (ll i = 0; i < n; i++)
    {
        ll val = publish(r), tmp;
        for (ll j = i + 1; j < n; j++)
        {
            swap(r[i], r[j]);
            tmp = publish(r);
            if (val <= tmp)
                swap(r[i], r[j]);
            else
                val = tmp;
        }
    }
    answer(r);
}
/*

*/
// int main()
// {
//     sync
//         // precomp();
//         ll t = 1;
//     cin >> t;
//     for (ll i = 1; i <= t; i++)
//         // cout << "Case " << i << ": ",
//         solve();
//     cerr << "\nTime elapsed : " << clock() * 1000.0 / CLOCKS_PER_SEC << " ms\n";
// }

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

# 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 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 0 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

# 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 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 0 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 13 ms 208 KB Output is correct
10 Correct 14 ms 208 KB Output is correct
11 Correct 12 ms 208 KB Output is correct
12 Correct 13 ms 208 KB Output is correct
13 Correct 1 ms 208 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 9 ms 208 KB Output is correct
20 Correct 13 ms 256 KB Output is correct

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 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 0 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 13 ms 208 KB Output is correct
10 Correct 14 ms 208 KB Output is correct
11 Correct 12 ms 208 KB Output is correct
12 Correct 13 ms 208 KB Output is correct
13 Correct 1 ms 208 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 9 ms 208 KB Output is correct
20 Correct 13 ms 256 KB Output is correct
21 Correct 1 ms 208 KB Output is correct
22 Correct 12 ms 208 KB Output is correct
23 Correct 11 ms 208 KB Output is correct
24 Correct 13 ms 208 KB Output is correct
25 Correct 9 ms 208 KB Output is correct
26 Incorrect 87 ms 208 KB Not correct
27 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 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 0 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 13 ms 208 KB Output is correct
10 Correct 14 ms 208 KB Output is correct
11 Correct 12 ms 208 KB Output is correct
12 Correct 13 ms 208 KB Output is correct
13 Correct 1 ms 208 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 9 ms 208 KB Output is correct
20 Correct 13 ms 256 KB Output is correct
21 Correct 1 ms 208 KB Output is correct
22 Correct 12 ms 208 KB Output is correct
23 Correct 11 ms 208 KB Output is correct
24 Correct 13 ms 208 KB Output is correct
25 Correct 9 ms 208 KB Output is correct
26 Incorrect 87 ms 208 KB Not correct
27 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 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 0 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 13 ms 208 KB Output is correct
10 Correct 14 ms 208 KB Output is correct
11 Correct 12 ms 208 KB Output is correct
12 Correct 13 ms 208 KB Output is correct
13 Correct 1 ms 208 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 9 ms 208 KB Output is correct
20 Correct 13 ms 256 KB Output is correct
21 Correct 1 ms 208 KB Output is correct
22 Correct 12 ms 208 KB Output is correct
23 Correct 11 ms 208 KB Output is correct
24 Correct 13 ms 208 KB Output is correct
25 Correct 9 ms 208 KB Output is correct
26 Incorrect 87 ms 208 KB Not correct
27 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 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 0 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 13 ms 208 KB Output is correct
10 Correct 14 ms 208 KB Output is correct
11 Correct 12 ms 208 KB Output is correct
12 Correct 13 ms 208 KB Output is correct
13 Correct 1 ms 208 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 9 ms 208 KB Output is correct
20 Correct 13 ms 256 KB Output is correct
21 Correct 1 ms 208 KB Output is correct
22 Correct 12 ms 208 KB Output is correct
23 Correct 11 ms 208 KB Output is correct
24 Correct 13 ms 208 KB Output is correct
25 Correct 9 ms 208 KB Output is correct
26 Incorrect 87 ms 208 KB Not correct
27 Halted 0 ms 0 KB -