oj.uz

답안 #936461

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
936461 2024-03-01T21:53:56 Z Edu175 Abracadabra (CEOI22_abracadabra) C++17
0 / 100
 837 ms 524288 KB 
#include <bits/stdc++.h>
#define pb push_back
#define fst first
#define snd second
#define fore(i,a,b) for(ll i=a,ceoi=b;i<ceoi;i++)
#define SZ(x) ((int)x.size())
#define ALL(x) x.begin(),x.end()
#define mset(a,v) memset((a),(v),sizeof(a))
#define imp(v) for(auto kdjfhg:v)cout<<kdjfhg<<" ";cout<<"\n"
#define FIN ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
using namespace std;
typedef long long ll;
typedef pair<ll,ll> ii;

vector<ll> f(vector<ll>a){
	vector<ll>l,r;
	ll n=SZ(a);
	fore(i,0,n/2)l.pb(a[i]);
	fore(i,n/2,n)r.pb(a[i]);
	vector<ll>b;
	reverse(ALL(l)); reverse(ALL(r));
	while(SZ(l)+SZ(r)){
		if(!SZ(r)||(SZ(l)&&l.back()<r.back()))b.pb(l.back()),l.pop_back();
		else b.pb(r.back()),r.pop_back();
	}
	return b;
}

int main(){FIN;
	ll n,q; cin>>n>>q;
	vector<ll>a(n);
	fore(i,0,n)cin>>a[i],a[i]--;
	vector<vector<ll>>b={a};
	while(1){
		auto a_=f(a);
		if(a_==a)break;
		a=a_;
		b.pb(a);
	}
	assert(SZ(b)<=n/2+5);
	while(q--){
		ll t,i; cin>>t>>i; i--;
		t=min(t,(ll)SZ(b)-1);
		cout<<b[t][i]+1<<"\n";
	}
	return 0;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 15 ms 16724 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 837 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 801 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 15 ms 16724 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -