oj.uz

Submission #572908

# Submission time Handle Problem Language Result Execution time Memory
572908 2022-06-05T13:22:22 Z MohamedAliSaidane Art Collections (BOI22_art) C++17
35 / 100
 213 ms 564 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include "art.h"
        using namespace __gnu_pbds;
        using namespace std;

        typedef tree<int,null_type,less<int>,rb_tree_tag,
        tree_order_statistics_node_update> indexed_set;

        typedef long long ll;
        typedef long double ld;

        typedef pair<int,int> pii;
        typedef pair<ll,ll> pll;
        typedef pair<ld,ld> pld;

        typedef vector<int> vi;
        typedef vector<ll> vll;
        typedef vector<pii> vpi;
        typedef vector<pll> vpl;

        #define pb push_back
        #define popb pop_back
        #define pp pop_back
        #define pf push_front
        #define popf pop_front
        #define all(x) (x).begin(),(x).end()
        #define ff first
        #define ss second

        ///#define int ll

        int nx[4] = {0,0,1,-1}, ny[4] = {1,-1,0,0};
        ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;}
        ll lcm(ll a , ll b) {return (a * b) / gcd(a , b);}

        const int nax = 4001;
        int n;
        vi adj[nax];
        unordered_set<int> vis;
        int curcost ;
        bool chng = true;
        vi res;
        int rnk[nax];
        /*int publish(vi a)
        {
            int rep = 0;
            for(int i = 0; i < n ; i++)
            {
                for(int j = 0; j < i ; j++)
                    rep += (rnk[a[i]] < rnk[a[j]]);
            }
            return rep;
        }
        */
        int sup(int x, int g)
        {
            if(x == g)
                return 1;
            vis.insert(x);
            for(auto e: adj[x])
            {
                if(vis.count(e) != 0)
                    continue;
                if(sup(e,g) == 1)
                    return 1;
            }
            return 0;
        }
        bool gr(int a, int b)
        {
            vis.clear();
            if(sup(a,b))
                return true;
            vis.clear();
            if(sup(b,a))
                return false;
            vi perm; perm.pb(a); perm.pb(b);
            for(int i = 1; i <= n; i++)
            {
                if(i != a && i != b)
                    perm.pb(i);
            }
            int c = publish(perm);
            swap(perm[0],perm[1]);
            int d = publish(perm);
            if(d > c)
            {
                adj[a].pb(b);
                return true;
            }
            else
            {
                adj[b].pb(a);
                return false;
            }
        }
        vi merge_sort(vi L, int l, int r)
        {
            int k = (r - l + 1);
            if(k == 1)
                return L;
            vi A = merge_sort(L,l,(l+r)/2);
            vi B = merge_sort(A,(l+r)/2+1,r);
            int i =l, j = (l+r)/2 + 1;
            vi res = B;
            int curi = i;
            while(curi <= r)
            {
                if(i > (l+r)/2 || (j <= r && gr(B[j],B[i])))
                    res[curi++] = B[j++];
                else
                    res[curi++] = B[i++];
            }
            return res;
        }
        void solve(int N)
        {
            n = N;
            vi perm;
            for(int i = 1 ;i <= n; i ++)
                perm.pb(i);
            answer(merge_sort(perm, 0, N - 1));
        }
        /*
        int main()
        {
            ios::sync_with_stdio(false);
            cin.tie(0); cout.tie(0);
            int N; cin >> N;
            for(int i = 0; i < N; i ++)
            {
                int x; cin >> x;
                res.pb(x);
                rnk[x] = i;
            }
            vi u = solve(N);
            for(auto e: u)
                cout << e << ' ' ;
        }
        */

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 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 2 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 2 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 5 ms 336 KB Output is correct
10 Correct 5 ms 336 KB Output is correct
11 Correct 5 ms 336 KB Output is correct
12 Correct 6 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 0 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 4 ms 336 KB Output is correct
20 Correct 3 ms 336 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 2 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 5 ms 336 KB Output is correct
10 Correct 5 ms 336 KB Output is correct
11 Correct 5 ms 336 KB Output is correct
12 Correct 6 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 0 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 4 ms 336 KB Output is correct
20 Correct 3 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 5 ms 336 KB Output is correct
23 Correct 7 ms 336 KB Output is correct
24 Correct 7 ms 336 KB Output is correct
25 Correct 4 ms 336 KB Output is correct
26 Correct 73 ms 416 KB Output is correct
27 Correct 64 ms 412 KB Output is correct
28 Correct 115 ms 404 KB Output is correct
29 Correct 104 ms 412 KB Output is correct
30 Correct 114 ms 400 KB Output is correct
31 Correct 113 ms 396 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 1 ms 336 KB Output is correct
37 Correct 1 ms 336 KB Output is correct
38 Correct 4 ms 336 KB Output is correct
39 Correct 4 ms 336 KB Output is correct

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 2 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 5 ms 336 KB Output is correct
10 Correct 5 ms 336 KB Output is correct
11 Correct 5 ms 336 KB Output is correct
12 Correct 6 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 0 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 4 ms 336 KB Output is correct
20 Correct 3 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 5 ms 336 KB Output is correct
23 Correct 7 ms 336 KB Output is correct
24 Correct 7 ms 336 KB Output is correct
25 Correct 4 ms 336 KB Output is correct
26 Correct 73 ms 416 KB Output is correct
27 Correct 64 ms 412 KB Output is correct
28 Correct 115 ms 404 KB Output is correct
29 Correct 104 ms 412 KB Output is correct
30 Correct 114 ms 400 KB Output is correct
31 Correct 113 ms 396 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 1 ms 336 KB Output is correct
37 Correct 1 ms 336 KB Output is correct
38 Correct 4 ms 336 KB Output is correct
39 Correct 4 ms 336 KB Output is correct
40 Correct 1 ms 336 KB Output is correct
41 Correct 6 ms 336 KB Output is correct
42 Correct 4 ms 336 KB Output is correct
43 Correct 4 ms 336 KB Output is correct
44 Correct 5 ms 336 KB Output is correct
45 Correct 66 ms 412 KB Output is correct
46 Correct 66 ms 424 KB Output is correct
47 Correct 115 ms 416 KB Output is correct
48 Correct 110 ms 408 KB Output is correct
49 Correct 109 ms 408 KB Output is correct
50 Correct 106 ms 404 KB Output is correct
51 Correct 1 ms 336 KB Output is correct
52 Incorrect 213 ms 564 KB Not correct
53 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 2 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 5 ms 336 KB Output is correct
10 Correct 5 ms 336 KB Output is correct
11 Correct 5 ms 336 KB Output is correct
12 Correct 6 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 0 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 4 ms 336 KB Output is correct
20 Correct 3 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 5 ms 336 KB Output is correct
23 Correct 7 ms 336 KB Output is correct
24 Correct 7 ms 336 KB Output is correct
25 Correct 4 ms 336 KB Output is correct
26 Correct 73 ms 416 KB Output is correct
27 Correct 64 ms 412 KB Output is correct
28 Correct 115 ms 404 KB Output is correct
29 Correct 104 ms 412 KB Output is correct
30 Correct 114 ms 400 KB Output is correct
31 Correct 113 ms 396 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 1 ms 336 KB Output is correct
37 Correct 1 ms 336 KB Output is correct
38 Correct 4 ms 336 KB Output is correct
39 Correct 4 ms 336 KB Output is correct
40 Correct 1 ms 336 KB Output is correct
41 Correct 6 ms 336 KB Output is correct
42 Correct 4 ms 336 KB Output is correct
43 Correct 4 ms 336 KB Output is correct
44 Correct 5 ms 336 KB Output is correct
45 Correct 66 ms 412 KB Output is correct
46 Correct 66 ms 424 KB Output is correct
47 Correct 115 ms 416 KB Output is correct
48 Correct 110 ms 408 KB Output is correct
49 Correct 109 ms 408 KB Output is correct
50 Correct 106 ms 404 KB Output is correct
51 Correct 1 ms 336 KB Output is correct
52 Incorrect 213 ms 564 KB Not correct
53 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 2 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 5 ms 336 KB Output is correct
10 Correct 5 ms 336 KB Output is correct
11 Correct 5 ms 336 KB Output is correct
12 Correct 6 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 0 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 4 ms 336 KB Output is correct
20 Correct 3 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 5 ms 336 KB Output is correct
23 Correct 7 ms 336 KB Output is correct
24 Correct 7 ms 336 KB Output is correct
25 Correct 4 ms 336 KB Output is correct
26 Correct 73 ms 416 KB Output is correct
27 Correct 64 ms 412 KB Output is correct
28 Correct 115 ms 404 KB Output is correct
29 Correct 104 ms 412 KB Output is correct
30 Correct 114 ms 400 KB Output is correct
31 Correct 113 ms 396 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 1 ms 336 KB Output is correct
37 Correct 1 ms 336 KB Output is correct
38 Correct 4 ms 336 KB Output is correct
39 Correct 4 ms 336 KB Output is correct
40 Correct 1 ms 336 KB Output is correct
41 Correct 6 ms 336 KB Output is correct
42 Correct 4 ms 336 KB Output is correct
43 Correct 4 ms 336 KB Output is correct
44 Correct 5 ms 336 KB Output is correct
45 Correct 66 ms 412 KB Output is correct
46 Correct 66 ms 424 KB Output is correct
47 Correct 115 ms 416 KB Output is correct
48 Correct 110 ms 408 KB Output is correct
49 Correct 109 ms 408 KB Output is correct
50 Correct 106 ms 404 KB Output is correct
51 Correct 1 ms 336 KB Output is correct
52 Incorrect 213 ms 564 KB Not correct
53 Halted 0 ms 0 KB -