oj.uz

Submission #899971

# Submission time Handle Problem Language Result Execution time Memory
899971 2024-01-07T11:50:34 Z I_am_Polish_Girl Abracadabra (CEOI22_abracadabra) C++14
10 / 100
 3000 ms 42160 KB 
/*
* powered by ANDRIY POPYK
* in honor of  SEGMENT DECOMPOSITION and N ^ (log(N)) and hate_club_Dasha_Lobas
* I hate GeZhiyuan
* fuck you
*/


#pragma GCC optimize("O3")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2,sse3,sse4,popcnt")


#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <vector>

using namespace std;
typedef long long ll;

#define int long long

int mod = 1000000007;
int inf = 1000000000000000000;

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int times_ = 1;

    //cin >> times_;

    while (times_--)
    {
        int n , k;
        cin >> n >> k;

        vector <int> a(n);


        for (int i = 0; i < n; i++)
            cin >> a[i];

        vector <vector <pair <int, int>>> q(n+1);

        int col = n;

        vector <int> ans(k , -1);
        for (int i = 0; i < k; i++)
        {
            int t, ind;

            cin >> t >> ind;

            q[min(t , col)].push_back({ ind , i });
        }

        for (int i = 0; i <= n; i++)
        {
            vector <int> b;


            int ind1 = 0;
            int ind2 = n / 2;

            for (int j = 0; j < n; j++)
            {
                if (ind1 == n / 2)
                {
                    b.push_back(a[ind2]);
                    ind2++;
                    continue;
                }

                if (ind2 == n)
                {
                    b.push_back(a[ind1]);
                    ind1++;
                    continue;
                }

                if (a[ind1] < a[ind2])
                {
                    b.push_back(a[ind1]);
                    ind1++;
                    continue;
                }
                else
                {
                    b.push_back(a[ind2]);
                    ind2++;
                    continue;
                }
            }

            for (int j = 0; j < q[i].size(); j++)
            {
                ans[q[i][j].second] = a[q[i][j].first - 1];
            }

            a = b;
            /*
            for (int i = 0; i < n; i++)
                cout << a[i] << " ";
            cout << "\n**\n";

            */
        }


        for (int i = 0; i < k; i++)
            cout << ans[i] << "\n";

        
    }
}

Compilation message

Main.cpp:11: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
   11 | #pragma GCC optimization("unroll-loops")
      | 
Main.cpp: In function 'int main()':
Main.cpp:109:31: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  109 |             for (int j = 0; j < q[i].size(); j++)
      |                             ~~^~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 175 ms 32072 KB Output is correct
2 Correct 180 ms 37512 KB Output is correct
3 Correct 169 ms 36560 KB Output is correct
4 Correct 166 ms 33632 KB Output is correct
5 Correct 170 ms 40016 KB Output is correct
6 Correct 157 ms 37592 KB Output is correct
7 Correct 202 ms 42160 KB Output is correct
8 Correct 162 ms 35684 KB Output is correct
9 Correct 162 ms 34944 KB Output is correct
10 Correct 156 ms 34896 KB Output is correct
11 Correct 193 ms 35092 KB Output is correct
12 Correct 148 ms 32456 KB Output is correct
13 Correct 158 ms 33544 KB Output is correct
14 Correct 163 ms 37200 KB Output is correct
15 Correct 161 ms 34928 KB Output is correct
16 Correct 2 ms 344 KB Output is correct
17 Correct 139 ms 32984 KB Output is correct
18 Correct 146 ms 32428 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3047 ms 34424 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3031 ms 9200 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 175 ms 32072 KB Output is correct
2 Correct 180 ms 37512 KB Output is correct
3 Correct 169 ms 36560 KB Output is correct
4 Correct 166 ms 33632 KB Output is correct
5 Correct 170 ms 40016 KB Output is correct
6 Correct 157 ms 37592 KB Output is correct
7 Correct 202 ms 42160 KB Output is correct
8 Correct 162 ms 35684 KB Output is correct
9 Correct 162 ms 34944 KB Output is correct
10 Correct 156 ms 34896 KB Output is correct
11 Correct 193 ms 35092 KB Output is correct
12 Correct 148 ms 32456 KB Output is correct
13 Correct 158 ms 33544 KB Output is correct
14 Correct 163 ms 37200 KB Output is correct
15 Correct 161 ms 34928 KB Output is correct
16 Correct 2 ms 344 KB Output is correct
17 Correct 139 ms 32984 KB Output is correct
18 Correct 146 ms 32428 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Execution timed out 3047 ms 34424 KB Time limit exceeded
22 Halted 0 ms 0 KB -