oj.uz

Submission #796123

# Submission time Handle Problem Language Result Execution time Memory
796123 2023-07-28T06:40:27 Z amirhoseinfar1385 Abracadabra (CEOI22_abracadabra) C++17
0 / 100
 153 ms 8512 KB 
#include<bits/stdc++.h>
using namespace std;
const int maxn=1000+10;
int n,q;
int all[maxn][maxn];
 
void solve(int ind){
	int i=1,j=n/2+1;
	int z=1;
	while(i<=(n/2)&&j<=n){
		if(all[ind-1][i]<all[ind-1][j]){
			all[ind][z]=all[ind-1][i];
			z++;
			i++;
		}
		else{
			all[ind][z]=all[ind-1][j];
			j++;
			z++;
		}
	}
	while(i<=(n/2)){
		all[ind][z]=all[ind-1][i];
		i++;
		z++;
	}
	while(j<=n){
		all[ind][z]=all[ind-1][j];
		j++;
		z++;
	}
	return ;
}
 
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>q;
	for(int i=1;i<=n;i++){
		cin>>all[0][i];
	}
	for(int j=1;j<=n/2+2;j++){
		solve(j);
	}
	/*for(int i=0;i<=n;i++){
		for(int j=1;j<=n;j++){
			cout<<all[i][j]<<" ";
		}
		cout<<"\n";
	}
	cout<<"\n";*/
	for(int i=0;i<q;i++){
		int u,v;
		cin>>u>>v;
		u=min(u,n/2+2);
		cout<<all[u][v]<<"\n";
	}
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 153 ms 6160 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Runtime error 130 ms 8512 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 73 ms 8480 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 153 ms 6160 KB Output isn't correct
2 Halted 0 ms 0 KB -