제출 #1198830

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1198830		ElayV13	Abracadabra (CEOI22_abracadabra)	C++20	0 / 100	3094 ms	6156 KiB

Main

#include <bits/stdc++.h>
using namespace std;

vector < int > shuffle(vector < int > v)
{
        int sz = v.size();
        vector < int > f , s;
        for(int i = sz / 2 - 1;i >= 0;i--)
        {
                f.push_back(v[i]);
        }
        for(int i = v.size() - 1;i >= sz / 2;i--)
        {
                s.push_back(v[i]);
        }
        vector < int > res;
        while(res.size() < v.size())
        {
                if(!f.size())
                {
                        res.push_back(s[s.size() - 1]);
                        s.pop_back();
                }
                else if(!s.size())
                {
                        res.push_back(f[f.size() - 1]);
                        f.pop_back();
                }
                else
                {
                        if(f[f.size() - 1] > s[s.size() - 1])
                        {
                                res.push_back(s[s.size() - 1]);
                                s.pop_back();
                        }
                        else
                        {
                                res.push_back(f[f.size() - 1]);
                                f.pop_back();
                        }
                }
        }
        return res;
}

const int N = 1001;
const int LOG = 20;

//int res[N * LOG][N];

signed main()
{
      ios_base::sync_with_stdio(0);cin.tie(0);
      int n , q;
      cin >> n >> q;
      vector < int > a(n);
      for(int &i : a) cin >> i;
      vector < int > A = a;
      while(q--)
      {
              int t , idx;
              cin >> t >> idx;
              vector < int > last;
              while(t--)
              {
                      a = shuffle(a);
                      if(a == last) break;
                      last = a;
              }
              cout << a[idx - 1] << "\n";
              a = A;
      }
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 40
• Subtask 3: 0 / 25
• Subtask 4: 0 / 25