oj.uz

Submission #810655

# Submission time Handle Problem Language Result Execution time Memory
810655 2023-08-06T13:46:35 Z QwertyPi DEL13 (info1cup18_del13) C++14
100 / 100
 22 ms 2264 KB 
#include <bits/stdc++.h>
#define se second
#define fi first
 
using namespace std;
 
bool u[200011];
 
vector<int> ans;
 
bool query(vector<int> a){
    if(a.size() % 2 != 0) return false;
    deque<pair<int, int>> b;
    map<int, int> mp;
    int c = 0;
    int pa = 0;
    for(auto v : a){
        if(b.empty()) b.push_back({v, ++c}), mp[c]++;
        else if(b.back().second != -1 && b.back().fi + 1 == v){
            b.push_back({v, c}); mp[c]++;
        }else{
            b.push_back({v - 1, -1});
            b.push_back({v, ++c});
            mp[c]++;
        }
    }
    int from = b.size();
    while(b.size() >= 3 && b[b.size() - 3].se == b[b.size() - 2].se && b[b.size() - 2].se == b[b.size() - 1].se){
        ans.push_back(b[b.size() - 2].fi); pair<int, int> p = b[b.size() - 2];
        b.pop_back(); b.pop_back(); b.pop_back(); b.push_back(p); mp[b[b.size() - 1].se] -= 2;
    }
 
    while(b.size() >= 1){
        // for(auto [x, y] : b) printf("(%d %d) ", x, y); printf("\n");
        if(b.front().se == -1){
            b.pop_front(); continue;
        }
        if(b.size() >= 3 && b[0].se == b[1].se && b[1].se == b[2].se) {
            ans.push_back(b[1].fi); pair<int, int> p = b[1]; mp[b[0].se]--; mp[b[2].se]--;
            b.pop_front(); b.pop_front(); b.pop_front(); b.push_front(p);
            continue;
        }
        if(b.size() >= 5 && b[1].se == -1 && b[2].se == b[3].se && b[3].se == b[4].se){
            set<int> groups;
            if(mp[b[2].se] > 3) goto nxt;
            for(int i = 5; i < b.size(); i++) {
                if(b[i].se == -1) continue;
                if(mp[b[i].se] % 2 == 0) groups.insert(b[i].se);
                else break;
            }
            nxt:;
            if(mp[b[2].se] > 3 || groups.size() % 2 == 0){
                ans.push_back(b[3].fi); pair<int, int> p0 = b[0], p1 = b[1], p2 = b[3]; mp[b[2].se]--; mp[b[4].se]--;
                b.pop_front(); b.pop_front(); b.pop_front(); b.pop_front(); b.pop_front(); b.push_front(p2); b.push_front(p1); b.push_front(p0);
            }else{
                ans.push_back(b[1].fi); pair<int, int> p = b[1]; mp[b[0].se]--; mp[b[2].se]--;
                b.pop_front(); b.pop_front(); b.pop_front(); b.push_front(p);
            }
            continue;
        }
        if(b.size() >= 3 && b[1].se == -1){
            ans.push_back(b[1].fi); pair<int, int> p = b[1]; mp[b[0].se]--; mp[b[2].se]--;
            b.pop_front(); b.pop_front(); b.pop_front(); b.push_front(p);
            continue;
        }
        if(b.size() >= 5 && b[0].se == b[1].se && b[0].se != -1 && b[2].se == -1 && b[3].se == b[4].se && b[3].se != -1){
            ans.push_back(b[2].fi); pair<int, int> p1 = b[0], p2 = b[2]; mp[b[1].se]--; mp[b[3].se]--;
            b.pop_front(); b.pop_front(); b.pop_front(); b.pop_front(); b.push_front(p2); b.push_front(p1);
            continue;
        }
        if(from == b.size()) return false; from = b.size();
    }
    return true;
}
 
int n, k; 
vector<int> p2;
bool solve(){
    cin >> n >> k;
    fill(u, u + n + 1, false);
    vector<int> p;
    for(int i = 0; i < k; i++){
        int v; cin >> v; p.push_back(v); u[v] = true;
    }
    p2 = p;
    vector<int> st; int gap = 2;
    for(int i = 1; i <= n; i++){
        if(!u[i]){
            if(gap >= 2) st.push_back(i), gap = 0;
            else gap = 0;
        }else{
            gap++;
        }
    }
    st.push_back(n + 1);
    int id = 1;
    bool ok = true;
    ans.clear();
    for(int i = 1; i < st.size(); i++){
        vector<int> a;
        for(id; id < st[i]; id++){
            if(!u[id]) a.push_back(id);
        }
        ok &= query(a);
    }
 
    if(!ok){
        cout << -1 << endl;
        return false;
    }
    cout << ans.size() << endl;
    for(auto i : ans) cout << i << ' '; cout << endl;
    return true;
}
 
int32_t main(){
    int t; cin >> t;
    while(t--){
        bool b1 = solve();
    }
}

Compilation message

del13.cpp: In function 'bool query(std::vector<int>)':
del13.cpp:46:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |             for(int i = 5; i < b.size(); i++) {
      |                            ~~^~~~~~~~~~
del13.cpp:71:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |         if(from == b.size()) return false; from = b.size();
      |            ~~~~~^~~~~~~~~~~
del13.cpp:71:9: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   71 |         if(from == b.size()) return false; from = b.size();
      |         ^~
del13.cpp:71:44: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   71 |         if(from == b.size()) return false; from = b.size();
      |                                            ^~~~
del13.cpp:16:9: warning: unused variable 'pa' [-Wunused-variable]
   16 |     int pa = 0;
      |         ^~
del13.cpp: In function 'bool solve()':
del13.cpp:99:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   99 |     for(int i = 1; i < st.size(); i++){
      |                    ~~^~~~~~~~~~~
del13.cpp:101:13: warning: statement has no effect [-Wunused-value]
  101 |         for(id; id < st[i]; id++){
      |             ^~
del13.cpp:112:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  112 |     for(auto i : ans) cout << i << ' '; cout << endl;
      |     ^~~
del13.cpp:112:41: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  112 |     for(auto i : ans) cout << i << ' '; cout << endl;
      |                                         ^~~~
del13.cpp: In function 'int32_t main()':
del13.cpp:119:14: warning: unused variable 'b1' [-Wunused-variable]
  119 |         bool b1 = solve();
      |              ^~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 212 KB Output is correct
2 Correct 2 ms 292 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 212 KB Output is correct
2 Correct 2 ms 292 KB Output is correct
3 Correct 12 ms 336 KB Output is correct
4 Correct 12 ms 316 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 576 KB Output is correct
2 Correct 4 ms 1252 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 212 KB Output is correct
2 Correct 2 ms 292 KB Output is correct
3 Correct 12 ms 336 KB Output is correct
4 Correct 12 ms 316 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 2 ms 212 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 212 KB Output is correct
2 Correct 2 ms 292 KB Output is correct
3 Correct 12 ms 336 KB Output is correct
4 Correct 12 ms 316 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 2 ms 212 KB Output is correct
8 Correct 16 ms 1484 KB Output is correct
9 Correct 19 ms 1588 KB Output is correct
10 Correct 16 ms 1228 KB Output is correct
11 Correct 22 ms 2264 KB Output is correct