oj.uz

Submission #859025

# Submission time Handle Problem Language Result Execution time Memory
859025 2023-10-09T14:34:09 Z efedmrlr Building 4 (JOI20_building4) C++17
100 / 100
 272 ms 108100 KB 
#include <bits/stdc++.h>

using namespace std;

#define n_l '\n'
#define dbg(...) cout << "[" << #__VA_ARGS__ << "]: "; cout << to_string(__VA_ARGS__) << endl
template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)),  __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); } 
#define dbgm(...) cout << "[" << #__VA_ARGS__ << "]: "; dbgm(__VA_ARGS__); cout << endl


#define int long long int
#define MP make_pair
#define pb push_back
#define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
}


const double EPS = 0.00001;
const int INF = 1e9+500;
const int N = 1e6+5;
const int M = 1e6+5;
const int ALPH = 26;
const int LGN = 25;
const int MOD = 1e9+7;
int n,m,q;
vector<int> a,b;
vector<array<int,2> > dp[N];

array<int,2> mergex(array<int,2> x, array<int,2> y) {
    if(x[0] == -1 && x[1] == -1) return y;
    if(y[0] == -1 && y[1] == -1) return x;
    return {min(x[0], y[0]) , max(x[1], y[1])};
}
array<int,2> inc1(array<int,2> x) {
    if(x[0] == -1 && x[1] == -1) return x;
    return {x[0] + 1, x[1] + 1};
}
bool checkint(array<int,2> x, int y) {
    if(x[0] == -1 && x[1] == -1) return 0;
    return (x[0] <= y) && (y <= x[1]);
}

inline void solve() {
    cin>>n;
    m = n;
    n = 2*n;
    a.resize(n+1); b.resize(n+1);
    for(int i = 1; i<=n; i++) {
        cin>>a[i];
    }
    for(int i = 1; i<= n; i++) {
        cin>>b[i];
    }
    
    dp[0].assign(2, {-1, -1});
    
    dp[0][0] = {0, 0};
    a[0] = 0;
    b[0] = INF;
    for(int i = 1; i<=n; i++) {
        dp[i].assign(2, {-1,-1});
        if(a[i-1] <= a[i]) {
            dp[i][0] = dp[i-1][0];
        }
        if(b[i-1] <= a[i]) {
            dp[i][0] = mergex(dp[i][0], dp[i-1][1]);
        }
        if(a[i-1] <= b[i]) {
            dp[i][1] = inc1(dp[i-1][0]);
        }
        if(b[i-1] <= b[i]) {
            dp[i][1] = mergex(dp[i][1] , inc1(dp[i-1][1]));
        }
    }
    int last, lastval = m;
    if(checkint(dp[n][0], m)) {
        last = 0;
    }
    else if(checkint(dp[n][1], m)) {
        last = 1;
    }
    else {
        cout<<"-1\n";
        return;
    }
    string res;
    for(int i = n - 1; i > 0; i--) {
        res.pb('A' + last);
        if(last) {
            if(a[i] <= b[i+1] && checkint(dp[i][0], lastval - 1)) {
                last = 0;
                lastval = lastval - 1;
            }
            else {
                last = 1;
                lastval = lastval - 1;
            }
        }
        else {
            if(a[i] <= a[i+1] && checkint(dp[i][0], lastval)) {
                last = 0;
            }
            else {
                last = 1;
            }
        }
    }
    res.pb('A' + last);
    for(int i = res.size() - 1; i>=0; i--) {
        cout<<res[i];
    }

    cout<<"\n";
}
 
signed main() {

    fastio();
    int test = 1;
    //cin>>test;
    while(test--) {
        solve();
    }
    
}

Compilation message

building4.cpp: In function 'std::string to_string(std::string, int, int)':
building4.cpp:7:208: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)),  __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); }
      |                                                                                                                                                                                                             ~~~^~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 23940 KB Output is correct
2 Correct 5 ms 23900 KB Output is correct
3 Correct 5 ms 23900 KB Output is correct
4 Correct 5 ms 23924 KB Output is correct
5 Correct 6 ms 24156 KB Output is correct
6 Correct 6 ms 24156 KB Output is correct
7 Correct 6 ms 24056 KB Output is correct
8 Correct 6 ms 24152 KB Output is correct
9 Correct 8 ms 24412 KB Output is correct
10 Correct 6 ms 24212 KB Output is correct
11 Correct 6 ms 24156 KB Output is correct
12 Correct 6 ms 24156 KB Output is correct
13 Correct 6 ms 24152 KB Output is correct
14 Correct 6 ms 24156 KB Output is correct
15 Correct 7 ms 24156 KB Output is correct
16 Correct 6 ms 24156 KB Output is correct
17 Correct 6 ms 24204 KB Output is correct
18 Correct 6 ms 24156 KB Output is correct
19 Correct 7 ms 24156 KB Output is correct
20 Correct 6 ms 24152 KB Output is correct
21 Correct 6 ms 24156 KB Output is correct
22 Correct 6 ms 24144 KB Output is correct
23 Correct 6 ms 24152 KB Output is correct
24 Correct 6 ms 24200 KB Output is correct
25 Correct 6 ms 24156 KB Output is correct
26 Correct 5 ms 24156 KB Output is correct
27 Correct 6 ms 24152 KB Output is correct
28 Correct 6 ms 24156 KB Output is correct
29 Correct 6 ms 24052 KB Output is correct
30 Correct 6 ms 24156 KB Output is correct
31 Correct 6 ms 24156 KB Output is correct
32 Correct 6 ms 24156 KB Output is correct
33 Correct 6 ms 24156 KB Output is correct

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 23940 KB Output is correct
2 Correct 5 ms 23900 KB Output is correct
3 Correct 5 ms 23900 KB Output is correct
4 Correct 5 ms 23924 KB Output is correct
5 Correct 6 ms 24156 KB Output is correct
6 Correct 6 ms 24156 KB Output is correct
7 Correct 6 ms 24056 KB Output is correct
8 Correct 6 ms 24152 KB Output is correct
9 Correct 8 ms 24412 KB Output is correct
10 Correct 6 ms 24212 KB Output is correct
11 Correct 6 ms 24156 KB Output is correct
12 Correct 6 ms 24156 KB Output is correct
13 Correct 6 ms 24152 KB Output is correct
14 Correct 6 ms 24156 KB Output is correct
15 Correct 7 ms 24156 KB Output is correct
16 Correct 6 ms 24156 KB Output is correct
17 Correct 6 ms 24204 KB Output is correct
18 Correct 6 ms 24156 KB Output is correct
19 Correct 7 ms 24156 KB Output is correct
20 Correct 6 ms 24152 KB Output is correct
21 Correct 6 ms 24156 KB Output is correct
22 Correct 6 ms 24144 KB Output is correct
23 Correct 6 ms 24152 KB Output is correct
24 Correct 6 ms 24200 KB Output is correct
25 Correct 6 ms 24156 KB Output is correct
26 Correct 5 ms 24156 KB Output is correct
27 Correct 6 ms 24152 KB Output is correct
28 Correct 6 ms 24156 KB Output is correct
29 Correct 6 ms 24052 KB Output is correct
30 Correct 6 ms 24156 KB Output is correct
31 Correct 6 ms 24156 KB Output is correct
32 Correct 6 ms 24156 KB Output is correct
33 Correct 6 ms 24156 KB Output is correct
34 Correct 213 ms 104584 KB Output is correct
35 Correct 224 ms 101872 KB Output is correct
36 Correct 221 ms 100628 KB Output is correct
37 Correct 224 ms 102160 KB Output is correct
38 Correct 213 ms 102168 KB Output is correct
39 Correct 214 ms 101500 KB Output is correct
40 Correct 241 ms 107076 KB Output is correct
41 Correct 215 ms 103292 KB Output is correct
42 Correct 226 ms 105072 KB Output is correct
43 Correct 239 ms 108012 KB Output is correct
44 Correct 243 ms 107844 KB Output is correct
45 Correct 248 ms 108100 KB Output is correct
46 Correct 271 ms 107796 KB Output is correct
47 Correct 272 ms 106944 KB Output is correct
48 Correct 233 ms 106924 KB Output is correct
49 Correct 226 ms 107588 KB Output is correct
50 Correct 237 ms 107080 KB Output is correct
51 Correct 257 ms 107192 KB Output is correct
52 Correct 182 ms 96072 KB Output is correct
53 Correct 185 ms 96224 KB Output is correct
54 Correct 171 ms 96068 KB Output is correct
55 Correct 174 ms 95904 KB Output is correct
56 Correct 226 ms 108100 KB Output is correct
57 Correct 199 ms 102728 KB Output is correct
58 Correct 206 ms 103080 KB Output is correct
59 Correct 198 ms 103240 KB Output is correct
60 Correct 191 ms 98828 KB Output is correct
61 Correct 203 ms 103492 KB Output is correct
62 Correct 205 ms 102460 KB Output is correct
63 Correct 214 ms 103644 KB Output is correct
64 Correct 195 ms 100932 KB Output is correct
65 Correct 212 ms 103716 KB Output is correct