oj.uz

Submission #402145

# Submission time Handle Problem Language Result Execution time Memory
402145 2021-05-11T11:25:35 Z cpp219 Building 4 (JOI20_building4) C++14
100 / 100
 374 ms 122552 KB 
#pragma GCC optimization "O2"
#pragma GCC optimization "unroll-loop"
#pragma GCC target ("avx2")

#include <bits/stdc++.h>
#define ll int
#define ld long double
#define fs first
#define sc second
using namespace std;
const ll N = 1e6 + 6;
const ll Log2 = 19;
const ll inf = 1e9 + 7;
typedef pair<ll,ll> LL;
///Road to EF/M
LL dp[N][2];
ll n,a[N][2];

LL f(ll i,ll j){
    if (i == n) return {0,0};
    if (dp[i][j].fs != -1) return dp[i][j];
    LL ans = {inf,-inf};
    if (a[i][j] <= a[i + 1][0]){
        ans.fs = min(ans.fs,f(i + 1,0).fs);
        ans.sc = max(ans.sc,f(i + 1,0).sc);
    }
    if (a[i][j] <= a[i + 1][1]){
        ans.fs = min(ans.fs,f(i + 1,1).fs + 1);
        ans.sc = max(ans.sc,f(i + 1,1).sc + 1);
    }
    return dp[i][j] = ans;
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    #define task "tst"
    if (fopen(task".inp", "r")){
        freopen(task".inp", "r", stdin);
        //freopen(task".out", "w", stdout);
    }
    cin>>n; n *= 2;
    for (ll i = 0;i <= n;i++) dp[i][0] = dp[i][1] = {-1,-1};
    for (ll i = 1;i <= n;i++) cin>>a[i][0];
    for (ll i = 1;i <= n;i++) cin>>a[i][1];
    //cout<<f(0,0).fs<<" "<<f(0,0).sc; return 0;
    if (f(0,0).fs > n/2 || f(0,0).sc < n/2) return cout<<-1,0;
    ll prv = 0,rm = n/2;
    for (ll i = 1;i <= n;i++){
        if (a[i][0] >= a[i - 1][prv]&&f(i,0).fs <= rm&&f(i,0).sc >= rm)
            prv = 0,cout<<"A";
        else{
            prv = 1; cout<<"B"; rm--;
        }
    }
}

Compilation message

building4.cpp:1: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    1 | #pragma GCC optimization "O2"
      | 
building4.cpp:2: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    2 | #pragma GCC optimization "unroll-loop"
      | 
building4.cpp: In function 'int main()':
building4.cpp:39:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   39 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 2 ms 724 KB Output is correct
7 Correct 3 ms 804 KB Output is correct
8 Correct 2 ms 720 KB Output is correct
9 Correct 3 ms 716 KB Output is correct
10 Correct 2 ms 716 KB Output is correct
11 Correct 2 ms 716 KB Output is correct
12 Correct 2 ms 716 KB Output is correct
13 Correct 2 ms 728 KB Output is correct
14 Correct 2 ms 716 KB Output is correct
15 Correct 2 ms 716 KB Output is correct
16 Correct 2 ms 716 KB Output is correct
17 Correct 2 ms 716 KB Output is correct
18 Correct 2 ms 716 KB Output is correct
19 Correct 2 ms 716 KB Output is correct
20 Correct 2 ms 716 KB Output is correct
21 Correct 2 ms 716 KB Output is correct
22 Correct 2 ms 716 KB Output is correct
23 Correct 2 ms 716 KB Output is correct
24 Correct 2 ms 716 KB Output is correct
25 Correct 2 ms 716 KB Output is correct
26 Correct 2 ms 720 KB Output is correct
27 Correct 2 ms 716 KB Output is correct
28 Correct 2 ms 716 KB Output is correct
29 Correct 2 ms 716 KB Output is correct
30 Correct 2 ms 716 KB Output is correct
31 Correct 2 ms 716 KB Output is correct
32 Correct 2 ms 588 KB Output is correct
33 Correct 2 ms 716 KB Output is correct
34 Correct 255 ms 42604 KB Output is correct
35 Correct 352 ms 113368 KB Output is correct
36 Correct 345 ms 111640 KB Output is correct
37 Correct 346 ms 113960 KB Output is correct
38 Correct 343 ms 113860 KB Output is correct
39 Correct 338 ms 113476 KB Output is correct
40 Correct 367 ms 121528 KB Output is correct
41 Correct 374 ms 115652 KB Output is correct
42 Correct 353 ms 118468 KB Output is correct
43 Correct 360 ms 122308 KB Output is correct
44 Correct 371 ms 122312 KB Output is correct
45 Correct 368 ms 122312 KB Output is correct
46 Correct 355 ms 122404 KB Output is correct
47 Correct 361 ms 121424 KB Output is correct
48 Correct 356 ms 121248 KB Output is correct
49 Correct 366 ms 122108 KB Output is correct
50 Correct 369 ms 121488 KB Output is correct
51 Correct 362 ms 121608 KB Output is correct
52 Correct 289 ms 110724 KB Output is correct
53 Correct 292 ms 110804 KB Output is correct
54 Correct 281 ms 110616 KB Output is correct
55 Correct 282 ms 110396 KB Output is correct
56 Correct 374 ms 122552 KB Output is correct
57 Correct 334 ms 117060 KB Output is correct
58 Correct 331 ms 117604 KB Output is correct
59 Correct 317 ms 117516 KB Output is correct
60 Correct 313 ms 110848 KB Output is correct
61 Correct 336 ms 118100 KB Output is correct
62 Correct 324 ms 116372 KB Output is correct
63 Correct 329 ms 118096 KB Output is correct
64 Correct 323 ms 114116 KB Output is correct
65 Correct 334 ms 118088 KB Output is correct