oj.uz

Submission #293590

# Submission time Handle Problem Language Result Execution time Memory
293590 2020-09-08T08:23:43 Z errorgorn Monochrome Points (JOI20_monochrome) C++14
35 / 100
 2000 ms 14792 KB 
//雪花飄飄北風嘯嘯
//天地一片蒼茫

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define int long long
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << " is " << x << endl

#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()

#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
//change less to less_equal for non distinct pbds, but erase will bug

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

int fen[400005];

void upd(int i){
	while (i<400005){
		fen[i]++;
		i+=i&-i;
	}
}

int query(int i){
	int res=0;
	while (i){
		res+=fen[i];
		i-=i&-i;
	}
	return res;
}

int query(int i,int j){
	return query(j)-query(i);
}

ii mp(int i,int j){
	if (i<j) return ii(i,j);
	else return ii(j,i);
}

int n;
string s;
vector<int> b,w;

int eval(int x){
	memset(fen,0,sizeof(fen));
	vector<ii> edge;
		
	rep(y,0,n) edge.push_back(mp(b[y],w[(x+y)%n]));
	
	sort(all(edge));
	
	ll curr=0;
	for (auto &it:edge){
		curr+=query(it.fi,it.se);
		upd(it.se);
	}
	
	return curr;
}

int solve(int l,int r){
	int m1,m2;
	
	while (r-l>3){
		m1=(r+l)>>1;
		m2=m1+1;
		
		if (eval(m1)>eval(m2)) r=m1;
		else l=m2;
	}
	
	int ans=0;
	rep(x,l,r+1) ans=max(ans,eval(x));
	return ans;
}

main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin.exceptions(ios::badbit | ios::failbit);
	
	cin>>n;
	cin>>s;
	
	rep(x,0,2*n){ //so im gonna 1 index because fenwick
		if (s[x]=='B') b.push_back(x+1);
		else w.push_back(x+1);
	}
	
	if (n==1) cout<<0<<endl;
	else{
		int ans=0;
		
		int curr=0;
		int inc=max(n/2+5,1LL);
		while (curr<n){
			ans=max(ans,solve(curr,min(curr+inc-1,n-1)));
			curr+=inc;
		}
		
		cout<<ans<<endl;
	}
}

Compilation message

monochrome.cpp:93:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   93 | main(){
      |      ^

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 3 ms 3488 KB Output is correct
3 Correct 3 ms 3456 KB Output is correct
4 Correct 3 ms 3456 KB Output is correct
5 Correct 4 ms 3456 KB Output is correct
6 Correct 3 ms 3456 KB Output is correct
7 Correct 3 ms 3456 KB Output is correct
8 Correct 3 ms 3456 KB Output is correct
9 Correct 3 ms 3456 KB Output is correct
10 Correct 3 ms 3456 KB Output is correct
11 Correct 3 ms 3456 KB Output is correct
12 Correct 3 ms 3456 KB Output is correct
13 Correct 4 ms 3456 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 3 ms 3488 KB Output is correct
3 Correct 3 ms 3456 KB Output is correct
4 Correct 3 ms 3456 KB Output is correct
5 Correct 4 ms 3456 KB Output is correct
6 Correct 3 ms 3456 KB Output is correct
7 Correct 3 ms 3456 KB Output is correct
8 Correct 3 ms 3456 KB Output is correct
9 Correct 3 ms 3456 KB Output is correct
10 Correct 3 ms 3456 KB Output is correct
11 Correct 3 ms 3456 KB Output is correct
12 Correct 3 ms 3456 KB Output is correct
13 Correct 4 ms 3456 KB Output is correct
14 Correct 9 ms 3456 KB Output is correct
15 Correct 7 ms 3456 KB Output is correct
16 Correct 8 ms 3456 KB Output is correct
17 Correct 7 ms 3456 KB Output is correct
18 Correct 7 ms 3456 KB Output is correct
19 Correct 9 ms 3488 KB Output is correct
20 Correct 7 ms 3456 KB Output is correct
21 Correct 7 ms 3456 KB Output is correct
22 Correct 6 ms 3456 KB Output is correct
23 Correct 6 ms 3456 KB Output is correct
24 Correct 6 ms 3456 KB Output is correct
25 Correct 7 ms 3456 KB Output is correct
26 Correct 7 ms 3456 KB Output is correct
27 Correct 7 ms 3456 KB Output is correct
28 Correct 7 ms 3456 KB Output is correct
29 Correct 7 ms 3456 KB Output is correct
30 Correct 6 ms 3456 KB Output is correct
31 Correct 7 ms 3456 KB Output is correct
32 Correct 7 ms 3456 KB Output is correct
33 Correct 7 ms 3456 KB Output is correct
34 Correct 16 ms 3628 KB Output is correct
35 Correct 17 ms 3584 KB Output is correct
36 Correct 15 ms 3584 KB Output is correct
37 Correct 15 ms 3584 KB Output is correct
38 Correct 15 ms 3584 KB Output is correct
39 Correct 14 ms 3584 KB Output is correct
40 Correct 14 ms 3704 KB Output is correct
41 Correct 14 ms 3584 KB Output is correct
42 Correct 21 ms 3584 KB Output is correct
43 Correct 16 ms 3584 KB Output is correct
44 Correct 16 ms 3584 KB Output is correct
45 Correct 14 ms 3584 KB Output is correct
46 Correct 13 ms 3584 KB Output is correct
47 Correct 16 ms 3584 KB Output is correct
48 Correct 15 ms 3584 KB Output is correct
49 Correct 13 ms 3584 KB Output is correct
50 Correct 13 ms 3584 KB Output is correct
51 Correct 16 ms 3584 KB Output is correct
52 Correct 16 ms 3584 KB Output is correct

Subtask #4
0.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 3 ms 3488 KB Output is correct
3 Correct 3 ms 3456 KB Output is correct
4 Correct 3 ms 3456 KB Output is correct
5 Correct 4 ms 3456 KB Output is correct
6 Correct 3 ms 3456 KB Output is correct
7 Correct 3 ms 3456 KB Output is correct
8 Correct 3 ms 3456 KB Output is correct
9 Correct 3 ms 3456 KB Output is correct
10 Correct 3 ms 3456 KB Output is correct
11 Correct 3 ms 3456 KB Output is correct
12 Correct 3 ms 3456 KB Output is correct
13 Correct 4 ms 3456 KB Output is correct
14 Correct 9 ms 3456 KB Output is correct
15 Correct 7 ms 3456 KB Output is correct
16 Correct 8 ms 3456 KB Output is correct
17 Correct 7 ms 3456 KB Output is correct
18 Correct 7 ms 3456 KB Output is correct
19 Correct 9 ms 3488 KB Output is correct
20 Correct 7 ms 3456 KB Output is correct
21 Correct 7 ms 3456 KB Output is correct
22 Correct 6 ms 3456 KB Output is correct
23 Correct 6 ms 3456 KB Output is correct
24 Correct 6 ms 3456 KB Output is correct
25 Correct 7 ms 3456 KB Output is correct
26 Correct 7 ms 3456 KB Output is correct
27 Correct 7 ms 3456 KB Output is correct
28 Correct 7 ms 3456 KB Output is correct
29 Correct 7 ms 3456 KB Output is correct
30 Correct 6 ms 3456 KB Output is correct
31 Correct 7 ms 3456 KB Output is correct
32 Correct 7 ms 3456 KB Output is correct
33 Correct 7 ms 3456 KB Output is correct
34 Correct 16 ms 3628 KB Output is correct
35 Correct 17 ms 3584 KB Output is correct
36 Correct 15 ms 3584 KB Output is correct
37 Correct 15 ms 3584 KB Output is correct
38 Correct 15 ms 3584 KB Output is correct
39 Correct 14 ms 3584 KB Output is correct
40 Correct 14 ms 3704 KB Output is correct
41 Correct 14 ms 3584 KB Output is correct
42 Correct 21 ms 3584 KB Output is correct
43 Correct 16 ms 3584 KB Output is correct
44 Correct 16 ms 3584 KB Output is correct
45 Correct 14 ms 3584 KB Output is correct
46 Correct 13 ms 3584 KB Output is correct
47 Correct 16 ms 3584 KB Output is correct
48 Correct 15 ms 3584 KB Output is correct
49 Correct 13 ms 3584 KB Output is correct
50 Correct 13 ms 3584 KB Output is correct
51 Correct 16 ms 3584 KB Output is correct
52 Correct 16 ms 3584 KB Output is correct
53 Execution timed out 2076 ms 14792 KB Time limit exceeded
54 Halted 0 ms 0 KB -