oj.uz

Submission #543260

# Submission time Handle Problem Language Result Execution time Memory
543260 2022-03-30T02:10:07 Z i_am_noob Building 4 (JOI20_building4) C++17
100 / 100
 260 ms 51908 KB 
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast,unroll-loops")

#define ll long long
#define int ll
#define ull unsigned ll
#define ld long double
#define rep(a) rep1(i,a)
#define rep1(i,a) rep2(i,0,a)
#define rep2(i,b,a) for(int i=(b); i<((int)(a)); i++)
#define rep3(i,b,a) for(int i=(b); i>=((int)(a)); i--)
#define chkmin(a,b) (a=min(a,b))
#define chkmax(a,b) (a=max(a,b))
#define all(a) a.begin(),a.end()
#define pii pair<int,int>
#define pb push_back
//#define inf 1010000000
#define inf 4000000000000000000
#define eps 1e-9
#define sz(a) ((int)a.size())
#define pow2(x) (1ll<<(x))
#define ceiling(a,b) (((a)+(b)-1)/(b))
#define print0(a) cout << (a) << ' '
#define ykh mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#ifdef i_am_noob
#define bug(...) cerr << "#" << __LINE__ << ' ' << #__VA_ARGS__ << "- ", _do(__VA_ARGS__)
template<typename T> void _do(T && x) {cerr << x << endl;}
template<typename T, typename ...S> void _do(T && x, S&&...y) {cerr << x << ", "; _do(y...);}
#else
#define bug(...) 777771449
#endif

const int mod=1000000007;
const int maxn=1000005,maxm=18,maxk=7777714;

//i_am_noob
int n,a[maxn],b[maxn],dp[maxn][2][2];
bool res[maxn];

void orzck(){
    cin >> n;
    n*=2;
    rep(n) cin >> a[i];
    rep(n) cin >> b[i];
    rep(2) rep1(j,2) dp[0][i][j]=i^1;
    rep2(i,1,n){
        rep1(j,2) dp[i][j][0]=inf,dp[i][j][1]=-inf;
        if(a[i]>=a[i-1]) chkmin(dp[i][0][0],dp[i-1][0][0]+1),chkmax(dp[i][0][1],dp[i-1][0][1]+1);
        if(a[i]>=b[i-1]) chkmin(dp[i][0][0],dp[i-1][1][0]+1),chkmax(dp[i][0][1],dp[i-1][1][1]+1);
        if(b[i]>=a[i-1]) chkmin(dp[i][1][0],dp[i-1][0][0]),chkmax(dp[i][1][1],dp[i-1][0][1]);
        if(b[i]>=b[i-1]) chkmin(dp[i][1][0],dp[i-1][1][0]),chkmax(dp[i][1][1],dp[i-1][1][1]);
    }
    rep(2) rep1(j,2) bug(i,j,dp[n-1][i][j]);
    int de,tar=n/2,val=inf;
    rep3(i,n-1,0){
        de=-1;
        rep1(_,2){
            if(dp[i][_][0]<=tar&&dp[i][_][1]>=tar&&(_?b[i]:a[i])<=val){
                de=_,val=(_?b[i]:a[i]);
                break;
            }
        }
        bug(de);
        if(de==-1){
            cout << "-1\n";
            return;
        }
        res[i]=de;
        tar-=de^1;
    }
    rep(n) cout << (res[i]?'B':'A');
    cout << "\n";
}

signed main(){
    ios_base::sync_with_stdio(0),cin.tie(0);
    orzck();
    return 0;
}

Compilation message

building4.cpp: In function 'void orzck()':
building4.cpp:31:18: warning: statement has no effect [-Wunused-value]
   31 | #define bug(...) 777771449
      |                  ^~~~~~~~~
building4.cpp:54:22: note: in expansion of macro 'bug'
   54 |     rep(2) rep1(j,2) bug(i,j,dp[n-1][i][j]);
      |                      ^~~
building4.cpp:31:18: warning: statement has no effect [-Wunused-value]
   31 | #define bug(...) 777771449
      |                  ^~~~~~~~~
building4.cpp:64:9: note: in expansion of macro 'bug'
   64 |         bug(de);
      |         ^~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 264 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 472 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Correct 2 ms 596 KB Output is correct
14 Correct 2 ms 600 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 2 ms 596 KB Output is correct
17 Correct 2 ms 596 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 2 ms 596 KB Output is correct
20 Correct 2 ms 464 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 508 KB Output is correct
24 Correct 2 ms 596 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 516 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 512 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 460 KB Output is correct
33 Correct 1 ms 468 KB Output is correct

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 264 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 472 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Correct 2 ms 596 KB Output is correct
14 Correct 2 ms 600 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 2 ms 596 KB Output is correct
17 Correct 2 ms 596 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 2 ms 596 KB Output is correct
20 Correct 2 ms 464 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 508 KB Output is correct
24 Correct 2 ms 596 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 516 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 512 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 460 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 219 ms 47808 KB Output is correct
35 Correct 240 ms 46828 KB Output is correct
36 Correct 231 ms 46160 KB Output is correct
37 Correct 238 ms 47080 KB Output is correct
38 Correct 230 ms 47180 KB Output is correct
39 Correct 221 ms 48836 KB Output is correct
40 Correct 241 ms 50432 KB Output is correct
41 Correct 209 ms 48064 KB Output is correct
42 Correct 249 ms 48976 KB Output is correct
43 Correct 246 ms 50568 KB Output is correct
44 Correct 251 ms 50612 KB Output is correct
45 Correct 260 ms 50568 KB Output is correct
46 Correct 231 ms 50572 KB Output is correct
47 Correct 230 ms 50804 KB Output is correct
48 Correct 233 ms 50424 KB Output is correct
49 Correct 235 ms 50764 KB Output is correct
50 Correct 249 ms 50948 KB Output is correct
51 Correct 239 ms 50508 KB Output is correct
52 Correct 178 ms 51448 KB Output is correct
53 Correct 179 ms 51324 KB Output is correct
54 Correct 160 ms 51292 KB Output is correct
55 Correct 158 ms 51404 KB Output is correct
56 Correct 230 ms 50608 KB Output is correct
57 Correct 201 ms 51624 KB Output is correct
58 Correct 209 ms 51748 KB Output is correct
59 Correct 202 ms 51788 KB Output is correct
60 Correct 199 ms 48840 KB Output is correct
61 Correct 199 ms 51884 KB Output is correct
62 Correct 199 ms 51140 KB Output is correct
63 Correct 203 ms 51908 KB Output is correct
64 Correct 190 ms 50236 KB Output is correct
65 Correct 205 ms 51784 KB Output is correct