oj.uz

답안 #919368

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
919368 2024-01-31T16:43:50 Z phong Swap (BOI16_swap) C++17
68 / 100
 1000 ms 205216 KB 
#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;
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){
    int i = 1, j = 1;
    for(int i = 1, j = 1, l = 1; i <= b.size() || j <= c.size(); i += l, j += l, l <<= 1){
        for(int pos = i; pos <= b.size() && pos <= i + l - 1; ++pos) a.push_back(b[pos - 1]);
        for(int pos = j; pos <= c.size() && pos <= j + l - 1; ++pos) a.push_back(c[pos - 1]);

    }
}
void calc(int x,  vector<int> &b, vector<int> &c){
    tmp ={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 << 1][i]] = i;
            for(int j = 0; j < adj[u].size(); ++j){
                int x = adj[u][j];
                int rs = min(d[x], d[u << 1]);
                if(rs == d[x]){
                    calc(x, dp[u << 1][L[u << 1]], gg);
                    ckmin(dp[u][j], tmp);
                }
                else {
                    calc(u << 1,dp[u << 1][L[x]], gg);
                    ckmin(dp[u][j], tmp);
                }
            }
            dp[u << 1].clear();
            adj[u << 1].clear();
        }
        else{
            for(int i = 0; i < adj[u << 1].size(); ++i) L[adj[u << 1][i]] = i;
            for(int i = 0; i < adj[u << 1 | 1].size(); ++i) R[adj[u << 1 | 1][i]] = i;
            for(int j = 0; j < adj[u].size(); ++j){
                int x = adj[u][j];
                int rs = min({d[x], d[u << 1], d[u << 1 | 1]});
                if(rs == d[x]){
                    calc(x, dp[u << 1][L[u * 2]], dp[u << 1 | 1][R[u << 1 | 1]]);
                    ckmin(dp[u][j], tmp);
                }
                else if(rs == d[u << 1]){
                    calc(u << 1, dp[u << 1][L[x]], dp[u << 1 | 1][R[u << 1 | 1]]);
                    ckmin(dp[u][j], tmp);
                }
                else{
                    calc(u << 1 | 1, dp[u << 1][L[x]], dp[u << 1 | 1][R[u * 2]]);
                    ckmin(dp[u][j], tmp);
                    calc(u << 1 | 1, dp[u << 1][L[u * 2]], dp[u << 1 | 1][R[x]]);
                    ckmin(dp[u][j], tmp);
                }
//                cout << u << ' ' << x << " # ";
//                for(auto p : dp[u][j]) cout << p << ' ';
//                cout << "\n";
            }
            dp[u << 1].clear();  adj[u << 1].clear();
            dp[u << 1 | 1].clear();  adj[u << 1 | 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:22:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |     for(int i = 1, j = 1, l = 1; i <= b.size() || j <= c.size(); i += l, j += l, l <<= 1){
      |                                  ~~^~~~~~~~~~~
swap.cpp:22:53: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |     for(int i = 1, j = 1, l = 1; i <= b.size() || j <= c.size(); i += l, j += l, l <<= 1){
      |                                                   ~~^~~~~~~~~~~
swap.cpp:23:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |         for(int pos = i; pos <= b.size() && pos <= i + l - 1; ++pos) a.push_back(b[pos - 1]);
      |                          ~~~~^~~~~~~~~~~
swap.cpp:24:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |         for(int pos = j; pos <= c.size() && pos <= j + l - 1; ++pos) a.push_back(c[pos - 1]);
      |                          ~~~~^~~~~~~~~~~
swap.cpp:21:9: warning: unused variable 'i' [-Wunused-variable]
   21 |     int i = 1, j = 1;
      |         ^
swap.cpp:21:16: warning: unused variable 'j' [-Wunused-variable]
   21 |     int i = 1, j = 1;
      |                ^
swap.cpp: In function 'void ckmin(std::vector<int>&, std::vector<int>&)':
swap.cpp:35:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |         for(int i = 0; i < a.size(); ++i){
      |                        ~~^~~~~~~~~~
swap.cpp: In function 'void update(int)':
swap.cpp:52:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |         for(int i = 0; i < adj[u].size(); ++i){
      |                        ~~^~~~~~~~~~~~~~~
swap.cpp:59:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |             for(int i = 0; i < adj[u * 2].size(); ++i) L[adj[u << 1][i]] = i;
      |                            ~~^~~~~~~~~~~~~~~~~~~
swap.cpp:60:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |             for(int j = 0; j < adj[u].size(); ++j){
      |                            ~~^~~~~~~~~~~~~~~
swap.cpp:76:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   76 |             for(int i = 0; i < adj[u << 1].size(); ++i) L[adj[u << 1][i]] = i;
      |                            ~~^~~~~~~~~~~~~~~~~~~~
swap.cpp:77:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |             for(int i = 0; i < adj[u << 1 | 1].size(); ++i) R[adj[u << 1 | 1][i]] = i;
      |                            ~~^~~~~~~~~~~~~~~~~~~~~~~~
swap.cpp:78:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |             for(int j = 0; j < adj[u].size(); ++j){
      |                            ~~^~~~~~~~~~~~~~~
swap.cpp: At global scope:
swap.cpp:105:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  105 | main(){
      | ^~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 11096 KB Output is correct
2 Correct 4 ms 11096 KB Output is correct
3 Correct 4 ms 11096 KB Output is correct
4 Correct 5 ms 11096 KB Output is correct
5 Correct 5 ms 11096 KB Output is correct
6 Correct 4 ms 11096 KB Output is correct
7 Correct 5 ms 11096 KB Output is correct
8 Correct 5 ms 11100 KB Output is correct
9 Correct 5 ms 11096 KB Output is correct
10 Correct 4 ms 11096 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 11096 KB Output is correct
2 Correct 4 ms 11096 KB Output is correct
3 Correct 4 ms 11096 KB Output is correct
4 Correct 5 ms 11096 KB Output is correct
5 Correct 5 ms 11096 KB Output is correct
6 Correct 4 ms 11096 KB Output is correct
7 Correct 5 ms 11096 KB Output is correct
8 Correct 5 ms 11100 KB Output is correct
9 Correct 5 ms 11096 KB Output is correct
10 Correct 4 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 5 ms 11864 KB Output is correct
14 Correct 6 ms 12020 KB Output is correct
15 Correct 6 ms 11864 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 11096 KB Output is correct
2 Correct 4 ms 11096 KB Output is correct
3 Correct 4 ms 11096 KB Output is correct
4 Correct 5 ms 11096 KB Output is correct
5 Correct 5 ms 11096 KB Output is correct
6 Correct 4 ms 11096 KB Output is correct
7 Correct 5 ms 11096 KB Output is correct
8 Correct 5 ms 11100 KB Output is correct
9 Correct 5 ms 11096 KB Output is correct
10 Correct 4 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 5 ms 11864 KB Output is correct
14 Correct 6 ms 12020 KB Output is correct
15 Correct 6 ms 11864 KB Output is correct
16 Correct 204 ms 54968 KB Output is correct
17 Correct 198 ms 55140 KB Output is correct
18 Correct 179 ms 55220 KB Output is correct
19 Correct 202 ms 54984 KB Output is correct
20 Correct 196 ms 54984 KB Output is correct

Subtask #5
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 11096 KB Output is correct
2 Correct 4 ms 11096 KB Output is correct
3 Correct 4 ms 11096 KB Output is correct
4 Correct 5 ms 11096 KB Output is correct
5 Correct 5 ms 11096 KB Output is correct
6 Correct 4 ms 11096 KB Output is correct
7 Correct 5 ms 11096 KB Output is correct
8 Correct 5 ms 11100 KB Output is correct
9 Correct 5 ms 11096 KB Output is correct
10 Correct 4 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 5 ms 11864 KB Output is correct
14 Correct 6 ms 12020 KB Output is correct
15 Correct 6 ms 11864 KB Output is correct
16 Correct 204 ms 54968 KB Output is correct
17 Correct 198 ms 55140 KB Output is correct
18 Correct 179 ms 55220 KB Output is correct
19 Correct 202 ms 54984 KB Output is correct
20 Correct 196 ms 54984 KB Output is correct
21 Correct 953 ms 205084 KB Output is correct
22 Execution timed out 1036 ms 205216 KB Time limit exceeded
23 Halted 0 ms 0 KB -