oj.uz

답안 #211514

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
211514 2020-03-20T16:31:45 Z Benq 건물 4 (JOI20_building4) C++14
100 / 100
 370 ms 29164 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 = 1e6+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}; 

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 bit(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 

// 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
template<class A, class B> str ts(pair<A,B> p);
template<class A> str ts(complex<A> c) { return ts(mp(c.real(),c.imag())); }
str ts(bool b) { return b ? "true" : "false"; }
str ts(char c) { str s = ""; s += c; return s; }
str ts(str s) { return s; }
str ts(const char* s) { return (str)s; }
str ts(vector<bool> v) { 
	bool fst = 1; str res = "{";
	F0R(i,sz(v)) {
		if (!fst) res += ", ";
		fst = 0; res += ts(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 T> str ts(T v) {
	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 << to_string(h); if (sizeof...(t)) cerr << ", ";
	DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 42
#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
}

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

int N, A[MX], B[MX];
char ans[MX];
pi dp[MX][2];

void comb(pi& a, pi b) {
	ckmin(a.f,b.f), ckmax(a.s,b.s);
}

bool con(pi a, int b) { return a.f <= b && b <= a.s; }

int main() {
	setIO(); re(N);
	FOR(i,1,2*N+1) re(A[i]);
	FOR(i,1,2*N+1) re(B[i]);
	dp[1][0] = {1,1}; dp[1][1] = {0,0};
	FOR(i,2,2*N+1) {
		dp[i][0] = dp[i][1] = {MOD,-MOD};
		if (A[i] >= A[i-1]) comb(dp[i][0],dp[i-1][0]);
		if (A[i] >= B[i-1]) comb(dp[i][0],dp[i-1][1]);
		if (B[i] >= A[i-1]) comb(dp[i][1],dp[i-1][0]);
		if (B[i] >= B[i-1]) comb(dp[i][1],dp[i-1][1]);
		if (dp[i][0].f != MOD) dp[i][0].f ++, dp[i][0].s ++;
	}
	pi cur = {-1,-1};
	F0R(i,2) if (con(dp[2*N][i],N)) cur = {i,N};
	if (cur.f == -1) { ps(-1); exit(0); }
	for (int ind = 2*N; ; --ind) {
		if (cur.f == 0) {
			ans[ind] = 'A';
			cur.s --;
			if (ind == 1) break;
			if (A[ind] >= A[ind-1] && con(dp[ind-1][0],cur.s)) {
				cur.f = 0;
			} else {
				assert(con(dp[ind-1][1],cur.s));
				cur.f = 1;
			}
		} else {
			ans[ind] = 'B';
			if (ind == 1) break;
			if (B[ind] >= A[ind-1] && con(dp[ind-1][0],cur.s)) {
				cur.f = 0;
			} else {
				assert(con(dp[ind-1][1],cur.s));
				cur.f = 1;
			}
		}
	}
	str res; FOR(i,1,2*N+1) res += ans[i];
	ps(res);
	// ps(dp[2*N][0],dp[2*N][1]);
	// 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:123: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:124: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

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Correct 6 ms 512 KB Output is correct
7 Correct 5 ms 384 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 6 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 7 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 6 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 560 KB Output is correct
28 Correct 5 ms 512 KB Output is correct
29 Correct 6 ms 512 KB Output is correct
30 Correct 5 ms 512 KB Output is correct
31 Correct 5 ms 512 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 5 ms 512 KB Output is correct

Subtask #2
89.0 / 89.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Correct 6 ms 512 KB Output is correct
7 Correct 5 ms 384 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 6 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 7 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 6 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 560 KB Output is correct
28 Correct 5 ms 512 KB Output is correct
29 Correct 6 ms 512 KB Output is correct
30 Correct 5 ms 512 KB Output is correct
31 Correct 5 ms 512 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 5 ms 512 KB Output is correct
34 Correct 339 ms 23392 KB Output is correct
35 Correct 308 ms 26800 KB Output is correct
36 Correct 298 ms 26416 KB Output is correct
37 Correct 307 ms 26928 KB Output is correct
38 Correct 304 ms 26928 KB Output is correct
39 Correct 301 ms 27124 KB Output is correct
40 Correct 314 ms 28780 KB Output is correct
41 Correct 310 ms 27568 KB Output is correct
42 Correct 317 ms 28080 KB Output is correct
43 Correct 350 ms 28940 KB Output is correct
44 Correct 342 ms 28908 KB Output is correct
45 Correct 370 ms 28908 KB Output is correct
46 Correct 337 ms 29148 KB Output is correct
47 Correct 349 ms 28908 KB Output is correct
48 Correct 326 ms 28864 KB Output is correct
49 Correct 335 ms 28920 KB Output is correct
50 Correct 359 ms 28908 KB Output is correct
51 Correct 333 ms 28908 KB Output is correct
52 Correct 207 ms 29036 KB Output is correct
53 Correct 235 ms 28908 KB Output is correct
54 Correct 181 ms 28908 KB Output is correct
55 Correct 192 ms 28908 KB Output is correct
56 Correct 321 ms 28940 KB Output is correct
57 Correct 275 ms 28780 KB Output is correct
58 Correct 272 ms 28908 KB Output is correct
59 Correct 279 ms 29036 KB Output is correct
60 Correct 271 ms 27308 KB Output is correct
61 Correct 306 ms 29164 KB Output is correct
62 Correct 289 ms 28524 KB Output is correct
63 Correct 307 ms 28916 KB Output is correct
64 Correct 284 ms 27952 KB Output is correct
65 Correct 285 ms 28908 KB Output is correct