oj.uz

Submission #264799

# Submission time Handle Problem Language Result Execution time Memory
264799 2020-08-14T09:53:45 Z Goolakh Building 4 (JOI20_building4) C++17
100 / 100
 448 ms 45744 KB 
// FUCKED UP FUCKED UP FUCKED UP FUCKED UP FUCKED UP
#include <bits/stdc++.h>
using namespace std;

#pragma GCC optimize("O2")

#define F first
#define S second
#define pb push_back
#define SZ(x) (ll)(x.size())
#define all(x) x.begin(),x.end()
#define MP make_pair

typedef int ll;
typedef long double ld;
typedef pair<ll,ll> pll;

//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const ll maxn=1e6+10, maxm=1e6+10, lg=10, mod=1e9+7, inf=1e18;

ll n,a[2][maxn],mn[maxn][2],mx[maxn][2];

int main(){
	//ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	
	for(int i=0;i<maxn;i++) mn[i][0]=mn[i][1]=mod, mx[i][0]=mx[i][1]=-mod;
	scanf("%d",&n); n*=2;
	for(int b=0;b<2;b++)for(int i=1;i<=n;i++) scanf("%d",&a[b][i]);
	mn[1][0]=mx[1][0]=0;
	mn[1][1]=mx[1][1]=1;
	for(int i=2;i<=n;i++)for(int b=0;b<2;b++)for(int bb=0;bb<2;bb++)if(a[b][i]>=a[bb][i-1]){
		mn[i][b]=min(mn[i][b],mn[i-1][bb]+b);
		mx[i][b]=max(mx[i][b],mx[i-1][bb]+b);
	}
	ll bb=n/2,gg=mod;
	string ans="";
	for(int i=n;i>=1;i--){
		bool F=0;
		for(int b=0;b<2;b++){
			if(a[b][i]<=gg && mn[i][b]<=bb && bb<=mx[i][b]){
				bb-=b;
				ans+=(b ? 'B':'A');
				gg=a[b][i];
				F=1;
				break;
			}
		}
		if(!F) return cout<<-1,0;
	}
	reverse(all(ans));
	cout<<ans;
	
	return 0;
}
// a denial a denial a denial a denial a denial a denial

Compilation message

building4.cpp:20:58: warning: overflow in conversion from 'double' to 'll' {aka 'int'} changes value from '1.0e+18' to '2147483647' [-Woverflow]
   20 | const ll maxn=1e6+10, maxm=1e6+10, lg=10, mod=1e9+7, inf=1e18;
      |                                                          ^~~~
building4.cpp: In function 'int main()':
building4.cpp:28:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   28 |  scanf("%d",&n); n*=2;
      |  ~~~~~^~~~~~~~~
building4.cpp:29:49: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   29 |  for(int b=0;b<2;b++)for(int i=1;i<=n;i++) scanf("%d",&a[b][i]);
      |                                            ~~~~~^~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 16000 KB Output is correct
2 Correct 11 ms 16000 KB Output is correct
3 Correct 10 ms 16000 KB Output is correct
4 Correct 10 ms 16000 KB Output is correct
5 Correct 12 ms 16000 KB Output is correct
6 Correct 12 ms 16256 KB Output is correct
7 Correct 12 ms 16000 KB Output is correct
8 Correct 12 ms 16000 KB Output is correct
9 Correct 12 ms 16000 KB Output is correct
10 Correct 11 ms 16000 KB Output is correct
11 Correct 12 ms 16000 KB Output is correct
12 Correct 12 ms 16000 KB Output is correct
13 Correct 12 ms 16000 KB Output is correct
14 Correct 12 ms 16000 KB Output is correct
15 Correct 12 ms 16000 KB Output is correct
16 Correct 11 ms 16000 KB Output is correct
17 Correct 12 ms 16000 KB Output is correct
18 Correct 12 ms 16000 KB Output is correct
19 Correct 12 ms 16000 KB Output is correct
20 Correct 11 ms 16000 KB Output is correct
21 Correct 11 ms 16000 KB Output is correct
22 Correct 11 ms 16000 KB Output is correct
23 Correct 11 ms 16000 KB Output is correct
24 Correct 12 ms 16000 KB Output is correct
25 Correct 12 ms 16000 KB Output is correct
26 Correct 11 ms 16000 KB Output is correct
27 Correct 12 ms 16000 KB Output is correct
28 Correct 12 ms 16000 KB Output is correct
29 Correct 11 ms 16000 KB Output is correct
30 Correct 11 ms 16000 KB Output is correct
31 Correct 11 ms 16000 KB Output is correct
32 Correct 12 ms 16000 KB Output is correct
33 Correct 12 ms 16000 KB Output is correct

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 16000 KB Output is correct
2 Correct 11 ms 16000 KB Output is correct
3 Correct 10 ms 16000 KB Output is correct
4 Correct 10 ms 16000 KB Output is correct
5 Correct 12 ms 16000 KB Output is correct
6 Correct 12 ms 16256 KB Output is correct
7 Correct 12 ms 16000 KB Output is correct
8 Correct 12 ms 16000 KB Output is correct
9 Correct 12 ms 16000 KB Output is correct
10 Correct 11 ms 16000 KB Output is correct
11 Correct 12 ms 16000 KB Output is correct
12 Correct 12 ms 16000 KB Output is correct
13 Correct 12 ms 16000 KB Output is correct
14 Correct 12 ms 16000 KB Output is correct
15 Correct 12 ms 16000 KB Output is correct
16 Correct 11 ms 16000 KB Output is correct
17 Correct 12 ms 16000 KB Output is correct
18 Correct 12 ms 16000 KB Output is correct
19 Correct 12 ms 16000 KB Output is correct
20 Correct 11 ms 16000 KB Output is correct
21 Correct 11 ms 16000 KB Output is correct
22 Correct 11 ms 16000 KB Output is correct
23 Correct 11 ms 16000 KB Output is correct
24 Correct 12 ms 16000 KB Output is correct
25 Correct 12 ms 16000 KB Output is correct
26 Correct 11 ms 16000 KB Output is correct
27 Correct 12 ms 16000 KB Output is correct
28 Correct 12 ms 16000 KB Output is correct
29 Correct 11 ms 16000 KB Output is correct
30 Correct 11 ms 16000 KB Output is correct
31 Correct 11 ms 16000 KB Output is correct
32 Correct 12 ms 16000 KB Output is correct
33 Correct 12 ms 16000 KB Output is correct
34 Correct 431 ms 23800 KB Output is correct
35 Correct 391 ms 25300 KB Output is correct
36 Correct 416 ms 42808 KB Output is correct
37 Correct 399 ms 43312 KB Output is correct
38 Correct 359 ms 43264 KB Output is correct
39 Correct 362 ms 42464 KB Output is correct
40 Correct 374 ms 44896 KB Output is correct
41 Correct 332 ms 43184 KB Output is correct
42 Correct 398 ms 44444 KB Output is correct
43 Correct 436 ms 45316 KB Output is correct
44 Correct 448 ms 45420 KB Output is correct
45 Correct 443 ms 45420 KB Output is correct
46 Correct 423 ms 45296 KB Output is correct
47 Correct 379 ms 44524 KB Output is correct
48 Correct 373 ms 44420 KB Output is correct
49 Correct 380 ms 45036 KB Output is correct
50 Correct 407 ms 44400 KB Output is correct
51 Correct 415 ms 44520 KB Output is correct
52 Correct 307 ms 33660 KB Output is correct
53 Correct 327 ms 33584 KB Output is correct
54 Correct 288 ms 33504 KB Output is correct
55 Correct 271 ms 33260 KB Output is correct
56 Correct 442 ms 45744 KB Output is correct
57 Correct 328 ms 40428 KB Output is correct
58 Correct 335 ms 40684 KB Output is correct
59 Correct 340 ms 40428 KB Output is correct
60 Correct 368 ms 39344 KB Output is correct
61 Correct 397 ms 41068 KB Output is correct
62 Correct 340 ms 40556 KB Output is correct
63 Correct 347 ms 40972 KB Output is correct
64 Correct 342 ms 40112 KB Output is correct
65 Correct 401 ms 40940 KB Output is correct