답안 #341439

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
341439 2020-12-29T17:33:00 Z ryansee Monochrome Points (JOI20_monochrome) C++14
35 / 100
2000 ms 3328 KB
#include "bits/stdc++.h"
using namespace std;

#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr<<"hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (x).begin(), (x).end()
#define lbd(x,y) (lower_bound(all(x),y)-x.begin())
#define ubd(x,y) (upper_bound(all(x),y)-x.begin())
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());    //can be used by calling rng() or shuffle(A, A+n, rng)
inline long long rand(long long x, long long y) { return rng() % (y+1-x) + x; } //inclusivesss
string inline to_string(char c) {string s(1,c);return s;} template<typename T> inline T gcd(T a,T b){ return a==0?llabs(b):gcd(b%a,a); }

using ll=long long; 
using ld=long double;
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
using pi=pair<ll,ll>; using spi=pair<ll,pi>; using dpi=pair<pi,pi>; 

long long LLINF = 1e18;
int INF = 1e9+1e6;
#define MAXN (400006)
ll n, ans;
string A, tmp;
deque<ll> B, W;
ll lol() {
	ll ans = 0;
	FOR(i,0,n-1) if(i < n / 2) {
		if(A[i]=='B') B.eb(i); else W.eb(i);
	} else {
		if(A[i] == 'W') {
			ll minus = lbd(W, B[0]);
			B.pop_front();
			ans += siz(B) + siz(W) - minus;
		} else {
			ll minus = lbd(B, W[0]);
			W.pop_front();
			ans += siz(B) + siz(W) - minus;
		}
	}
	assert(B.empty() && W.empty());
	return ans;
}
int main() {
	FAST
	cin>>n>>A; n *= 2;
	tmp.resize(n);
	FOR(i,0,n-1) {
		ans = max(ans, lol());
		FOR(i,0,n-1) tmp[i] = A[(i-1+n)%n];
		A = tmp;
	}
	cout<<ans<<'\n';
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 10 ms 364 KB Output is correct
15 Correct 10 ms 384 KB Output is correct
16 Correct 11 ms 364 KB Output is correct
17 Correct 12 ms 364 KB Output is correct
18 Correct 6 ms 384 KB Output is correct
19 Correct 7 ms 364 KB Output is correct
20 Correct 7 ms 364 KB Output is correct
21 Correct 7 ms 364 KB Output is correct
22 Correct 7 ms 364 KB Output is correct
23 Correct 4 ms 364 KB Output is correct
24 Correct 6 ms 364 KB Output is correct
25 Correct 6 ms 384 KB Output is correct
26 Correct 7 ms 364 KB Output is correct
27 Correct 7 ms 364 KB Output is correct
28 Correct 7 ms 364 KB Output is correct
29 Correct 5 ms 364 KB Output is correct
30 Correct 5 ms 364 KB Output is correct
31 Correct 6 ms 364 KB Output is correct
32 Correct 6 ms 364 KB Output is correct
33 Correct 7 ms 364 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 10 ms 364 KB Output is correct
15 Correct 10 ms 384 KB Output is correct
16 Correct 11 ms 364 KB Output is correct
17 Correct 12 ms 364 KB Output is correct
18 Correct 6 ms 384 KB Output is correct
19 Correct 7 ms 364 KB Output is correct
20 Correct 7 ms 364 KB Output is correct
21 Correct 7 ms 364 KB Output is correct
22 Correct 7 ms 364 KB Output is correct
23 Correct 4 ms 364 KB Output is correct
24 Correct 6 ms 364 KB Output is correct
25 Correct 6 ms 384 KB Output is correct
26 Correct 7 ms 364 KB Output is correct
27 Correct 7 ms 364 KB Output is correct
28 Correct 7 ms 364 KB Output is correct
29 Correct 5 ms 364 KB Output is correct
30 Correct 5 ms 364 KB Output is correct
31 Correct 6 ms 364 KB Output is correct
32 Correct 6 ms 364 KB Output is correct
33 Correct 7 ms 364 KB Output is correct
34 Correct 525 ms 440 KB Output is correct
35 Correct 535 ms 492 KB Output is correct
36 Correct 505 ms 492 KB Output is correct
37 Correct 501 ms 364 KB Output is correct
38 Correct 278 ms 364 KB Output is correct
39 Correct 340 ms 364 KB Output is correct
40 Correct 318 ms 492 KB Output is correct
41 Correct 323 ms 492 KB Output is correct
42 Correct 504 ms 492 KB Output is correct
43 Correct 395 ms 492 KB Output is correct
44 Correct 375 ms 436 KB Output is correct
45 Correct 308 ms 492 KB Output is correct
46 Correct 325 ms 492 KB Output is correct
47 Correct 337 ms 364 KB Output is correct
48 Correct 355 ms 440 KB Output is correct
49 Correct 291 ms 364 KB Output is correct
50 Correct 273 ms 492 KB Output is correct
51 Correct 272 ms 492 KB Output is correct
52 Correct 354 ms 492 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 10 ms 364 KB Output is correct
15 Correct 10 ms 384 KB Output is correct
16 Correct 11 ms 364 KB Output is correct
17 Correct 12 ms 364 KB Output is correct
18 Correct 6 ms 384 KB Output is correct
19 Correct 7 ms 364 KB Output is correct
20 Correct 7 ms 364 KB Output is correct
21 Correct 7 ms 364 KB Output is correct
22 Correct 7 ms 364 KB Output is correct
23 Correct 4 ms 364 KB Output is correct
24 Correct 6 ms 364 KB Output is correct
25 Correct 6 ms 384 KB Output is correct
26 Correct 7 ms 364 KB Output is correct
27 Correct 7 ms 364 KB Output is correct
28 Correct 7 ms 364 KB Output is correct
29 Correct 5 ms 364 KB Output is correct
30 Correct 5 ms 364 KB Output is correct
31 Correct 6 ms 364 KB Output is correct
32 Correct 6 ms 364 KB Output is correct
33 Correct 7 ms 364 KB Output is correct
34 Correct 525 ms 440 KB Output is correct
35 Correct 535 ms 492 KB Output is correct
36 Correct 505 ms 492 KB Output is correct
37 Correct 501 ms 364 KB Output is correct
38 Correct 278 ms 364 KB Output is correct
39 Correct 340 ms 364 KB Output is correct
40 Correct 318 ms 492 KB Output is correct
41 Correct 323 ms 492 KB Output is correct
42 Correct 504 ms 492 KB Output is correct
43 Correct 395 ms 492 KB Output is correct
44 Correct 375 ms 436 KB Output is correct
45 Correct 308 ms 492 KB Output is correct
46 Correct 325 ms 492 KB Output is correct
47 Correct 337 ms 364 KB Output is correct
48 Correct 355 ms 440 KB Output is correct
49 Correct 291 ms 364 KB Output is correct
50 Correct 273 ms 492 KB Output is correct
51 Correct 272 ms 492 KB Output is correct
52 Correct 354 ms 492 KB Output is correct
53 Execution timed out 2069 ms 3328 KB Time limit exceeded
54 Halted 0 ms 0 KB -