oj.uz

Submission #238941

# Submission time Handle Problem Language Result Execution time Memory
238941 2020-06-13T16:26:18 Z rqi Building 4 (JOI20_building4) C++14
100 / 100
 350 ms 40852 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef double db; 
typedef string str; 

typedef pair<int,int> pi;
typedef pair<ll,ll> pl; 
typedef pair<db,db> pd; 

typedef vector<int> vi; 
typedef vector<ll> vl; 
typedef vector<db> vd; 
typedef vector<str> vs; 
typedef vector<pi> vpi;
typedef vector<pl> vpl; 
typedef vector<pd> vpd; 

#define mp make_pair
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend() 
#define rsz resize
#define ins insert 
#define ft front() 
#define bk back()
#define pf push_front 
#define pb push_back
#define eb emplace_back 
#define lb lower_bound 
#define ub upper_bound 

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5; 
const ll INF = 1e18; 
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; 
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 

template<class T> bool ckmin(T& a, const T& b) { 
    return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { 
    return a < b ? a = b, 1 : 0; } 
int pct(int x) { return __builtin_popcount(x); } 
int bits(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) 
int cdiv(int a, int b) { return a/b+!(a<0||a%b == 0); } // division of a by b rounded up, assumes b > 0 
int fstTrue(function<bool(int)> f, int lo, int hi) {
    hi ++; assert(lo <= hi); // assuming f is increasing
    while (lo < hi) { // find first index such that f is true 
        int mid = (lo+hi)/2; 
        f(mid) ? hi = mid : lo = mid+1; 
    } 
    return lo;
}

// INPUT
template<class A> void re(complex<A>& c);
template<class A, class B> void re(pair<A,B>& p);
template<class A> void re(vector<A>& v);
template<class A, size_t SZ> void re(array<A,SZ>& a);

template<class T> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); }

template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; }
template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); }
template<class A> void re(vector<A>& x) { trav(a,x) re(a); }
template<class A, size_t SZ> void re(array<A,SZ>& x) { trav(a,x) re(a); }

// TO_STRING
#define ts to_string
str ts(char c) { return str(1,c); }
str ts(bool b) { return b ? "true" : "false"; }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
template<class A> str ts(complex<A> c) { 
    stringstream ss; ss << c; return ss.str(); }
str ts(vector<bool> v) { 
    str res = "{"; F0R(i,sz(v)) res += char('0'+v[i]);
    res += "}"; return res; }
template<size_t SZ> str ts(bitset<SZ> b) {
    str res = ""; F0R(i,SZ) res += char('0'+b[i]);
    return res; }
template<class A, class B> str ts(pair<A,B> p);
template<class T> str ts(T v) { // containers with begin(), end()
    bool fst = 1; str res = "{";
    for (const auto& x: v) {
        if (!fst) res += ", ";
        fst = 0; res += ts(x);
    }
    res += "}"; return res;
}
template<class A, class B> str ts(pair<A,B> p) {
    return "("+ts(p.f)+", "+ts(p.s)+")"; }

// OUTPUT
template<class A> void pr(A x) { cout << ts(x); }
template<class H, class... T> void pr(const H& h, const T&... t) { 
    pr(h); pr(t...); }
void ps() { pr("\n"); } // print w/ spaces
template<class H, class... T> void ps(const H& h, const T&... t) { 
    pr(h); if (sizeof...(t)) pr(" "); ps(t...); }

// DEBUG
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
    cerr << ts(h); if (sizeof...(t)) cerr << ", ";
    DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif

// FILE I/O
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { ios_base::sync_with_stdio(0); cin.tie(0); }
void setIO(string s = "") {
    unsyncIO();
    // cin.exceptions(cin.failbit); 
    // throws exception when do smth illegal
    // ex. try to read letter into int
    if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}

const int mx = 1000005;
const pi ID = mp(-MOD, -MOD);
int N;
int A[mx];
int B[mx];
pi a[mx];
pi b[mx];
bool ans[mx];

pi comb(pi a, pi b){
    if(a.f < 0) return b;
    if(b.f < 0) return a;

    if(a.f > b.f) swap(a, b);
    assert(a.s+1 >= b.f);
    return mp(a.f, max(a.s, b.s));
}

bool inrange(pi a, int b){
    if(a.f < 0) return false;
    if(a.f <= b && b <= a.s) return true;
    return false;
}



int main() {
    setIO();
    
    cin >> N;
    for(int i = 1; i <= 2*N; i++) cin >> A[i];
    for(int i = 1; i <= 2*N; i++) cin >> B[i];
    for(int i = 1; i <= 2*N; i++) a[i] = b[i] = ID;
    a[1] = mp(1, 1);
    b[1] = mp(0, 0);
    for(int i = 1; i <= 2*N-1; i++){
        if(A[i] <= A[i+1]){
            pi rang = a[i];
            rang.f++;
            rang.s++;
            a[i+1] = comb(a[i+1], rang);
        }
        if(A[i] <= B[i+1]){
            pi rang = a[i];
            b[i+1] = comb(b[i+1], rang);
        }
        if(B[i] <= A[i+1]){
            pi rang = b[i];
            rang.f++;
            rang.s++;
            a[i+1] = comb(a[i+1], rang);
        }
        if(B[i] <= B[i+1]){
            pi rang = b[i];
            b[i+1] = comb(b[i+1], rang);
        }
    }

    int cur = N;
    if(inrange(a[2*N], cur)){
        ans[2*N] = 1;
    }
    else if(inrange(b[2*N], cur)){
        ans[2*N] = 0;
    }
    else{
        ps(-1);
        return 0;
    }
    cur-=ans[2*N];

    for(int i = 2*N-1; i >= 1; i--){
        if(ans[i+1] == 1){
            if(A[i] <= A[i+1] && inrange(a[i], cur)){
                ans[i] = 1;
            }
            else{
                ans[i] = 0;
            }
        }
        else{
            if(A[i] <= B[i+1] && inrange(a[i], cur)){
                ans[i] = 1;
            }
            else{
                ans[i] = 0;
            }
        }
        cur-=ans[i];
    }

    for(int i = 1; i <= 2*N; i++){
        if(ans[i] == 1){
            cout << 'A';
        }
        else cout << 'B';
    }
    cout << "\n";

    // you should actually read the stuff at the bottom
}

/* stuff you should look for
    * int overflow, array bounds
    * special cases (n=1?)
    * do smth instead of nothing and stay organized
    * WRITE STUFF DOWN
*/

Compilation message

building4.cpp: In function 'void setIn(std::__cxx11::string)':
building4.cpp:128:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
building4.cpp: In function 'void setOut(std::__cxx11::string)':
building4.cpp:129:32: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 416 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 6 ms 512 KB Output is correct
6 Correct 6 ms 512 KB Output is correct
7 Correct 6 ms 512 KB Output is correct
8 Correct 6 ms 512 KB Output is correct
9 Correct 6 ms 512 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Correct 7 ms 512 KB Output is correct
12 Correct 6 ms 512 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 6 ms 512 KB Output is correct
15 Correct 6 ms 512 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 6 ms 512 KB Output is correct
18 Correct 6 ms 512 KB Output is correct
19 Correct 6 ms 512 KB Output is correct
20 Correct 5 ms 512 KB Output is correct
21 Correct 5 ms 512 KB Output is correct
22 Correct 5 ms 512 KB Output is correct
23 Correct 5 ms 512 KB Output is correct
24 Correct 7 ms 512 KB Output is correct
25 Correct 5 ms 512 KB Output is correct
26 Correct 5 ms 512 KB Output is correct
27 Correct 5 ms 512 KB Output is correct
28 Correct 5 ms 512 KB Output is correct
29 Correct 5 ms 512 KB Output is correct
30 Correct 5 ms 512 KB Output is correct
31 Correct 6 ms 512 KB Output is correct
32 Correct 5 ms 512 KB Output is correct
33 Correct 6 ms 512 KB Output is correct
34 Correct 300 ms 24088 KB Output is correct
35 Correct 307 ms 24548 KB Output is correct
36 Correct 302 ms 24184 KB Output is correct
37 Correct 317 ms 24696 KB Output is correct
38 Correct 297 ms 24824 KB Output is correct
39 Correct 301 ms 24824 KB Output is correct
40 Correct 315 ms 26360 KB Output is correct
41 Correct 301 ms 25208 KB Output is correct
42 Correct 333 ms 25848 KB Output is correct
43 Correct 337 ms 26488 KB Output is correct
44 Correct 342 ms 26408 KB Output is correct
45 Correct 350 ms 26616 KB Output is correct
46 Correct 323 ms 26464 KB Output is correct
47 Correct 316 ms 26488 KB Output is correct
48 Correct 316 ms 26616 KB Output is correct
49 Correct 321 ms 26488 KB Output is correct
50 Correct 333 ms 26440 KB Output is correct
51 Correct 320 ms 26488 KB Output is correct
52 Correct 220 ms 33404 KB Output is correct
53 Correct 213 ms 33400 KB Output is correct
54 Correct 196 ms 33372 KB Output is correct
55 Correct 204 ms 33144 KB Output is correct
56 Correct 326 ms 26556 KB Output is correct
57 Correct 293 ms 40252 KB Output is correct
58 Correct 284 ms 40440 KB Output is correct
59 Correct 300 ms 40388 KB Output is correct
60 Correct 288 ms 38524 KB Output is correct
61 Correct 309 ms 40824 KB Output is correct
62 Correct 300 ms 40184 KB Output is correct
63 Correct 296 ms 40824 KB Output is correct
64 Correct 277 ms 39544 KB Output is correct
65 Correct 315 ms 40852 KB Output is correct