제출 #1005258

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1005258		YassineBenYounes	Abracadabra (CEOI22_abracadabra)	C++17	0 / 100	2555 ms	524296 KiB

Main

#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 = 2e5+5;
const int sqmx = sqrt(2e5+5)+5;
const int LOG = 25;
const int inf = 1e9;
const ll mod = 998244353;

ll ans[sqmx][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 = -1;
    for(int i = 1; i*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;
    }
    assert(last != -1);
    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)
*/

컴파일 시 표준 에러 (stderr) 메시지

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: 0 / 10
• Subtask 2: 0 / 40
• Subtask 3: 0 / 25
• Subtask 4: 0 / 25