oj.uz

Submission #1005248

# Submission time Handle Problem Language Result Execution time Memory
1005248 2024-06-22T09:18:48 Z YassineBenYounes Abracadabra (CEOI22_abracadabra) C++17
10 / 100
 973 ms 23168 KB 
#include<bits/stdc++.h>
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef double db;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pbds tree<int, null_type, less<int>,rb_tree_tag, tree_order_statistics_node_update>
using namespace __gnu_pbds;
ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;} // greatest common divisor (PGCD)
ll lcm(ll a , ll b) {return (a * b) / gcd(a , b);} // least common multiple (PPCM)
int dx[8] = {1, 0, 0, -1, 1, 1, -1, -1};
int dy[8] = {0, 1, -1, 0, 1, -1, -1, 1};
#define endl "\n"
#define ss second
#define ff first
#define all(x) (x).begin() , (x).end()
#define pb push_back
#define vi vector<int>
#define vii vector<pair<int,int>>
#define vl vector<ll>
#define vll vector<pair<ll,ll>>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pdd  pair<double,double>
#define vdd  vector<pdd>
#define speed ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
////////////////////Only Clear Code//////////////////////////

void usaco_problem(){
    freopen("milkvisits.in", "r", stdin);
    freopen("milkvisits.out", "w", stdout);
}

void init(){
    #ifndef ONLINE_JUDGE
 
freopen("input.txt", "r", stdin);
 
freopen("output.txt", "w", stdout);
 
#endif // ONLINE_JUDGE
}
//#define int ll
const int mx = 1005;
const int LOG = 25;
const int inf = 1e9;
const ll mod = 998244353;

ll ans[mx][mx];
ll arr[mx];
void run_case(){
    int n, q;cin >> n >> q;
    vi v;
    for(int i = 0;i < n;i++){
        cin >> arr[i];
        v.pb(arr[i]);
        ans[0][i+1] = arr[i];
    }
    int last = n+1;
    for(int i = 1; i <= n+1;i++){
        vi nw;
        int l = 0, r = n/2;
        while(l < n/2 && r < n){
            if(v[l] < v[r]){
                nw.pb(v[l]);
                l++;
            }
            else{
                nw.pb(v[r]);
                r++;
            }
        }
        while(l < n/2){
            nw.pb(v[l]);
            l++;
        }
        while(r < n){
            nw.pb(v[r]);
            r++;
        }
        for(int j = 0;j < n;j++){
            ans[i][j+1] = nw[j];
        }
        if(v == nw){
            last = i;
            break;
        }
        v = nw;
    }
    while(q--){
        int t, ind;cin >> t >> ind;
        t = min(t, last);
        cout << ans[t][ind] << endl;
    }
}

int main(){
    //init();
    speed;
    int t = 1;
    //cin >> t;
    while(t--){
        run_case();
    }
}

/*
    NEVER GIVE UP!
    DOING SMTHNG IS BETTER THAN DOING NTHNG!!!
    Your Guide when stuck:
    - Continue keyword only after reading the whole input
    - Don't use memset with testcases
    - Check for corner cases(n=1, n=0)
    - Check where you declare n(Be careful of declaring it globally and in main)
*/

Compilation message

Main.cpp: In function 'void usaco_problem()':
Main.cpp:33:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |     freopen("milkvisits.in", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:34:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 |     freopen("milkvisits.out", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp: In function 'void init()':
Main.cpp:40:8: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 | freopen("input.txt", "r", stdin);
      | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:42:8: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 | freopen("output.txt", "w", stdout);
      | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 154 ms 19792 KB Output is correct
2 Correct 134 ms 13880 KB Output is correct
3 Correct 138 ms 15696 KB Output is correct
4 Correct 120 ms 12432 KB Output is correct
5 Correct 135 ms 13648 KB Output is correct
6 Correct 161 ms 12636 KB Output is correct
7 Correct 150 ms 13600 KB Output is correct
8 Correct 125 ms 12844 KB Output is correct
9 Correct 120 ms 12628 KB Output is correct
10 Correct 126 ms 12904 KB Output is correct
11 Correct 136 ms 12884 KB Output is correct
12 Correct 112 ms 9588 KB Output is correct
13 Correct 121 ms 10472 KB Output is correct
14 Correct 134 ms 13140 KB Output is correct
15 Correct 131 ms 12884 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 122 ms 10076 KB Output is correct
18 Correct 124 ms 9652 KB Output is correct
19 Correct 0 ms 344 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 Runtime error 973 ms 23168 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Runtime error 561 ms 20080 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 154 ms 19792 KB Output is correct
2 Correct 134 ms 13880 KB Output is correct
3 Correct 138 ms 15696 KB Output is correct
4 Correct 120 ms 12432 KB Output is correct
5 Correct 135 ms 13648 KB Output is correct
6 Correct 161 ms 12636 KB Output is correct
7 Correct 150 ms 13600 KB Output is correct
8 Correct 125 ms 12844 KB Output is correct
9 Correct 120 ms 12628 KB Output is correct
10 Correct 126 ms 12904 KB Output is correct
11 Correct 136 ms 12884 KB Output is correct
12 Correct 112 ms 9588 KB Output is correct
13 Correct 121 ms 10472 KB Output is correct
14 Correct 134 ms 13140 KB Output is correct
15 Correct 131 ms 12884 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 122 ms 10076 KB Output is correct
18 Correct 124 ms 9652 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Runtime error 973 ms 23168 KB Execution killed with signal 11
22 Halted 0 ms 0 KB -