oj.uz

Submission #919305

# Submission time Handle Problem Language Result Execution time Memory
919305 2024-01-31T14:57:06 Z thanh913 Swap (BOI16_swap) C++14
68 / 100
 1000 ms 190324 KB 
//test code


#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
 
#define ll long long
const int nmax = 2e5 + 5, dmax = 2e5 + 5;
const ll oo = 1e18, base = 311;
const int lg = 18, M =2e2 + 5;
const ll mod = 1e9 + 7;
#define pii pair<ll, int>
#define fi first
#define se second
#define debug(a, n) for(int i = 1; i <= n; ++i) cout << a[i] << ' ';
using namespace std;
 
int n, d[nmax];
vector<int> adj[nmax], tmp;
vector<vector<int>> dp[nmax];
void get(vector<int> &a, vector<int> &b, vector<int> &c){
  	a.reserve(b.size() + c.size());
    int i = 1, j = 1;
    for(int cur = 0; cur <= lg; ++cur){
        int x = __lg(i), y = __lg(j);
        while(i <= b.size() && __lg(i) <= cur){
            a.push_back(b[i - 1]);
            ++i;
        }
        while(j <= c.size() && __lg(j) <= cur){
            a.push_back(c[j - 1]);
            ++j;
        }
    }
}
void calc(int x,  vector<int> &b, vector<int> &c){
    tmp.clear();
    tmp.push_back(x);
    get(tmp, b, c);
}
void ckmin(vector<int> &a, vector<int> &b){
    if(a.empty()) a = b;
    else{
        for(int i = 0; i < a.size(); ++i){
            int u = a[i], v = b[i];
            if(d[u] > d[v]){
                a = b;
                return;
            }
            if(d[u] < d[v]) return;
        }
    }
}
vector<int> gg;
int L[nmax], R[nmax];
 
void update(int u){
    dp[u].resize(adj[u].size() + 1);
 
    if(u * 2 > n){
        for(int i = 0; i < adj[u].size(); ++i){
            dp[u][i].push_back(adj[u][i]);
        }
    }
    else{
        if(u * 2 + 1 > n){
 
            for(int i = 0; i < adj[u * 2].size(); ++i) L[adj[u * 2][i]] = i;
            for(int j = 0; j < adj[u].size(); ++j){
                int x = adj[u][j];
                calc(x, dp[u * 2][L[u * 2]], gg);
                ckmin(dp[u][j], tmp);
                calc(u * 2,dp[u * 2][L[x]], gg);
                ckmin(dp[u][j], tmp);
            }
            dp[u * 2].clear();
            adj[u * 2].clear();
        }
        else{
            for(int i = 0; i < adj[u * 2].size(); ++i) L[adj[u * 2][i]] = i;
            for(int i = 0; i < adj[u * 2 + 1].size(); ++i) R[adj[u * 2 + 1][i]] = i;
            for(int j = 0; j < adj[u].size(); ++j){
                int x = adj[u][j];
                calc(x, dp[u * 2][L[u * 2]], dp[u * 2 + 1][R[u * 2 + 1]]);
                ckmin(dp[u][j], tmp);
 
                calc(u * 2, dp[u * 2][L[x]], dp[u * 2 + 1][R[u * 2 + 1]]);
                ckmin(dp[u][j], tmp);
 
                calc(u * 2 + 1, dp[u * 2][L[x]], dp[u * 2 + 1][R[u * 2]]);
                ckmin(dp[u][j], tmp);
 
                calc(u * 2 + 1, dp[u * 2][L[u * 2]], dp[u * 2 + 1][R[x]]);
                ckmin(dp[u][j], tmp);
//                cout << u << ' ' << x << " # ";
//                for(auto p : dp[u][j]) cout << p << ' ';
//                cout << "\n";
            }
            dp[u * 2].clear();  adj[u * 2].clear();
            dp[u * 2 + 1].clear();  adj[u * 2 + 1].clear();
        }
    }
 
}
main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
//    freopen("code.inp", "r", stdin);
//    freopen("code.out", "w", stdout);
    cin >> n;
    for(int i = 1; i <= n; ++i) cin >> d[i];
    for(int i = n; i >= 1; --i){
//        adj[i].push_back(i);
        int u = i;
        while(u > 0){
            if(u - 1 > 0 && u % 2 == 1) adj[i].push_back(u - 1);
            adj[i].push_back(u);
            u /= 2;
        }
//        cout << i << '#';
//        for(auto p : adj[i])cout << p << ' ';
//        cout << "\n";
    }
    for(int i = n; i >= 1; --i) update(i);
//    for(int i )
    for(auto p : dp[1][0]) cout << d[p] << ' ';
 
}
/*
5 2
3 2
2 5
3 4
3 1
 
*/

Compilation message

swap.cpp: In function 'void get(std::vector<int>&, std::vector<int>&, std::vector<int>&)':
swap.cpp:28:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |         while(i <= b.size() && __lg(i) <= cur){
      |               ~~^~~~~~~~~~~
swap.cpp:32:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |         while(j <= c.size() && __lg(j) <= cur){
      |               ~~^~~~~~~~~~~
swap.cpp:27:13: warning: unused variable 'x' [-Wunused-variable]
   27 |         int x = __lg(i), y = __lg(j);
      |             ^
swap.cpp:27:26: warning: unused variable 'y' [-Wunused-variable]
   27 |         int x = __lg(i), y = __lg(j);
      |                          ^
swap.cpp: In function 'void ckmin(std::vector<int>&, std::vector<int>&)':
swap.cpp:46:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |         for(int i = 0; i < a.size(); ++i){
      |                        ~~^~~~~~~~~~
swap.cpp: In function 'void update(int)':
swap.cpp:63:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |         for(int i = 0; i < adj[u].size(); ++i){
      |                        ~~^~~~~~~~~~~~~~~
swap.cpp:70:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |             for(int i = 0; i < adj[u * 2].size(); ++i) L[adj[u * 2][i]] = i;
      |                            ~~^~~~~~~~~~~~~~~~~~~
swap.cpp:71:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |             for(int j = 0; j < adj[u].size(); ++j){
      |                            ~~^~~~~~~~~~~~~~~
swap.cpp:82:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |             for(int i = 0; i < adj[u * 2].size(); ++i) L[adj[u * 2][i]] = i;
      |                            ~~^~~~~~~~~~~~~~~~~~~
swap.cpp:83:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |             for(int i = 0; i < adj[u * 2 + 1].size(); ++i) R[adj[u * 2 + 1][i]] = i;
      |                            ~~^~~~~~~~~~~~~~~~~~~~~~~
swap.cpp:84:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |             for(int j = 0; j < adj[u].size(); ++j){
      |                            ~~^~~~~~~~~~~~~~~
swap.cpp: At global scope:
swap.cpp:107:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  107 | main(){
      | ^~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 11100 KB Output is correct
2 Correct 4 ms 11096 KB Output is correct
3 Correct 4 ms 11100 KB Output is correct
4 Correct 4 ms 11100 KB Output is correct
5 Correct 5 ms 11096 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 11100 KB Output is correct
2 Correct 4 ms 11096 KB Output is correct
3 Correct 4 ms 11100 KB Output is correct
4 Correct 4 ms 11100 KB Output is correct
5 Correct 5 ms 11096 KB Output is correct
6 Correct 5 ms 11096 KB Output is correct
7 Correct 5 ms 11096 KB Output is correct
8 Correct 4 ms 11096 KB Output is correct
9 Correct 4 ms 11096 KB Output is correct
10 Correct 5 ms 11096 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 11100 KB Output is correct
2 Correct 4 ms 11096 KB Output is correct
3 Correct 4 ms 11100 KB Output is correct
4 Correct 4 ms 11100 KB Output is correct
5 Correct 5 ms 11096 KB Output is correct
6 Correct 5 ms 11096 KB Output is correct
7 Correct 5 ms 11096 KB Output is correct
8 Correct 4 ms 11096 KB Output is correct
9 Correct 4 ms 11096 KB Output is correct
10 Correct 5 ms 11096 KB Output is correct
11 Correct 6 ms 11864 KB Output is correct
12 Correct 7 ms 11864 KB Output is correct
13 Correct 6 ms 11848 KB Output is correct
14 Correct 6 ms 11864 KB Output is correct
15 Correct 6 ms 11872 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 11100 KB Output is correct
2 Correct 4 ms 11096 KB Output is correct
3 Correct 4 ms 11100 KB Output is correct
4 Correct 4 ms 11100 KB Output is correct
5 Correct 5 ms 11096 KB Output is correct
6 Correct 5 ms 11096 KB Output is correct
7 Correct 5 ms 11096 KB Output is correct
8 Correct 4 ms 11096 KB Output is correct
9 Correct 4 ms 11096 KB Output is correct
10 Correct 5 ms 11096 KB Output is correct
11 Correct 6 ms 11864 KB Output is correct
12 Correct 7 ms 11864 KB Output is correct
13 Correct 6 ms 11848 KB Output is correct
14 Correct 6 ms 11864 KB Output is correct
15 Correct 6 ms 11872 KB Output is correct
16 Correct 295 ms 55096 KB Output is correct
17 Correct 297 ms 54864 KB Output is correct
18 Correct 299 ms 55036 KB Output is correct
19 Correct 322 ms 54952 KB Output is correct
20 Correct 270 ms 55052 KB Output is correct

Subtask #5
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 11100 KB Output is correct
2 Correct 4 ms 11096 KB Output is correct
3 Correct 4 ms 11100 KB Output is correct
4 Correct 4 ms 11100 KB Output is correct
5 Correct 5 ms 11096 KB Output is correct
6 Correct 5 ms 11096 KB Output is correct
7 Correct 5 ms 11096 KB Output is correct
8 Correct 4 ms 11096 KB Output is correct
9 Correct 4 ms 11096 KB Output is correct
10 Correct 5 ms 11096 KB Output is correct
11 Correct 6 ms 11864 KB Output is correct
12 Correct 7 ms 11864 KB Output is correct
13 Correct 6 ms 11848 KB Output is correct
14 Correct 6 ms 11864 KB Output is correct
15 Correct 6 ms 11872 KB Output is correct
16 Correct 295 ms 55096 KB Output is correct
17 Correct 297 ms 54864 KB Output is correct
18 Correct 299 ms 55036 KB Output is correct
19 Correct 322 ms 54952 KB Output is correct
20 Correct 270 ms 55052 KB Output is correct
21 Execution timed out 1043 ms 190324 KB Time limit exceeded
22 Halted 0 ms 0 KB -