oj.uz

Submission #938823

# Submission time Handle Problem Language Result Execution time Memory
938823 2024-03-05T15:37:01 Z pcc Building 4 (JOI20_building4) C++14
100 / 100
 224 ms 40392 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;

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-1]]>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){
	if(s>e)return;
	//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(){
	bool flag = false;
	vector<int> cut = {0};
	for(int i = 1;i<=N*2;i++){
		if(arr[i][ch[i]]>arr[i][ch[i]^1])cut.push_back(i);
	}
	cut.push_back(N*2+1);
	for(int i = 1;i<cut.size();i++){
		calc(cut[i-1]+1,cut[i]-1);
	}
}

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;
}

Compilation message

building4.cpp: In function 'void check()':
building4.cpp:57:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |  for(int i = 1;i<cut.size();i++){
      |                ~^~~~~~~~~~~
building4.cpp:51:7: warning: unused variable 'flag' [-Wunused-variable]
   51 |  bool flag = false;
      |       ^~~~

Subtask #1
11.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 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 2 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 2 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2552 KB Output is correct
11 Correct 2 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 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 2 ms 2508 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 2 ms 2392 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2392 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct

Subtask #2
89.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 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 2 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 2 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2552 KB Output is correct
11 Correct 2 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 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 2 ms 2508 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 2 ms 2392 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2392 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 189 ms 9812 KB Output is correct
35 Correct 167 ms 13772 KB Output is correct
36 Correct 170 ms 13644 KB Output is correct
37 Correct 174 ms 31824 KB Output is correct
38 Correct 171 ms 30488 KB Output is correct
39 Correct 166 ms 29788 KB Output is correct
40 Correct 183 ms 32152 KB Output is correct
41 Correct 160 ms 30288 KB Output is correct
42 Correct 175 ms 31360 KB Output is correct
43 Correct 203 ms 33788 KB Output is correct
44 Correct 185 ms 33484 KB Output is correct
45 Correct 224 ms 33668 KB Output is correct
46 Correct 212 ms 40392 KB Output is correct
47 Correct 189 ms 31720 KB Output is correct
48 Correct 178 ms 31444 KB Output is correct
49 Correct 182 ms 32324 KB Output is correct
50 Correct 194 ms 32840 KB Output is correct
51 Correct 195 ms 33712 KB Output is correct
52 Correct 130 ms 21928 KB Output is correct
53 Correct 145 ms 21964 KB Output is correct
54 Correct 126 ms 20832 KB Output is correct
55 Correct 122 ms 20448 KB Output is correct
56 Correct 215 ms 32208 KB Output is correct
57 Correct 147 ms 27460 KB Output is correct
58 Correct 148 ms 27480 KB Output is correct
59 Correct 151 ms 25684 KB Output is correct
60 Correct 145 ms 25716 KB Output is correct
61 Correct 154 ms 27984 KB Output is correct
62 Correct 152 ms 27104 KB Output is correct
63 Correct 153 ms 27984 KB Output is correct
64 Correct 160 ms 26452 KB Output is correct
65 Correct 157 ms 28092 KB Output is correct