oj.uz

Submission #938813

# Submission time Handle Problem Language Result Execution time Memory
938813 2024-03-05T15:22:32 Z pcc Building 4 (JOI20_building4) C++14
0 / 100
 2 ms 2652 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pll pair<ll,ll>
#define pii pair<int,int>
#define fs first
#define sc second
#define tlll tuple<ll,ll,ll>


const int mxn = 1e6+10;
int N;
int arr[mxn][2];
int ch[mxn];
int need,cnt;
bitset<mxn> done;

void chain(int s,int e){
	if(!cnt)return;
	//cout<<"CHAIN:"<<s<<' '<<e<<endl;
	pii big = make_pair(0,e+1);
	int sum = 0;
	for(int i = e;i>=s;i--){
		if(i != 1&&arr[i-1][ch[i]]>=arr[i][ch[i]^1])break;
		if(i != N*2&&max(arr[i+1][0],arr[i+1][1])<arr[i][ch[i]^1])break;
		sum += (ch[i] == need?-1:1);
		if(sum == cnt)big = make_pair(mxn,i);
		else big = max(big,make_pair(sum,i));
	}
	for(int i = e;i>=big.sc;i--){
		ch[i] ^= 1;
	}
	cnt = max(0,cnt-big.fs);
	return;
}

void calc(int s,int e){
	//cout<<"calc:"<<s<<' '<<e<<endl;
	if(!cnt)return;
	vector<pii> v = {{s,s}};
	for(int i = s+1;i<=e;i++){
		//cout<<i<<":"<<arr[i-1][ch[i]^1]<<','<<arr[i][ch[i]]<<endl;
		if(arr[i-1][ch[i-1]^1]<=arr[i][ch[i]])v.push_back({i,i});
		else v.back().sc = i;
	}
	for(auto &i:v)chain(i.fs,i.sc);
}

void check(){
	vector<pii> v;
	bool flag = false;
	for(int i = 1;i<=N*2;i++){
		if(arr[i][ch[i]]>arr[i][ch[i]^1])flag = false;
		else{
			if(flag)v.back().sc = i;
			else v.push_back({i,i});
			flag = true;
		}
	}
	for(auto &i:v)calc(i.fs,i.sc);
}

int main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>N;
	for(int i = 0;i<2;i++){
		for(int j = 1;j<=N*2;j++)cin>>arr[j][i];
	}
	if(arr[1][0]>arr[1][1])ch[1] = 1;
	for(int i = 2;i<=N*2;i++){
		if(arr[i][1]<arr[i][0])ch[i] = 1;
		if(arr[i][ch[i]]<arr[i-1][ch[i-1]])ch[i]^=1;
		if(arr[i][ch[i]]<arr[i-1][ch[i-1]]){
			cout<<"-1\n";
			return 0;
		}
	}
	int sum = 0;
	for(int i = 1;i<=N*2;i++)sum += ch[i];
	if(sum<N)need = 1,cnt = N-sum;
	else need = 0,cnt = sum-N;
	///for(int i = 1;i<=N*2;i++)cout<<ch[i];cout<<endl;
	//cout<<need<<','<<cnt<<endl;
	check();
	if(cnt){
		cout<<"-1";
		return 0;
	}
	for(int i = 1;i<=N*2;i++){
		cout<<"AB"[ch[i]];
	}
	return 0;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2648 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 2 ms 2652 KB Output is correct
15 Correct 2 ms 2564 KB Output is correct
16 Correct 1 ms 2564 KB Output is correct
17 Correct 1 ms 2596 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Incorrect 1 ms 2396 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #2
0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2648 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 2 ms 2652 KB Output is correct
15 Correct 2 ms 2564 KB Output is correct
16 Correct 1 ms 2564 KB Output is correct
17 Correct 1 ms 2596 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Incorrect 1 ms 2396 KB Output isn't correct
23 Halted 0 ms 0 KB -