oj.uz

답안 #366289

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
366289 2021-02-13T19:30:14 Z farhan132 Monochrome Points (JOI20_monochrome) C++17
35 / 100
 2000 ms 28604 KB 
/***Farhan132***/

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<ll> vll;
typedef pair<ll , ll> ii;
typedef vector< ii > vi;
typedef pair < pair < ll , ll > , pair < ll , ll > > cm; 
 
#define ff first
#define ss second
#define pb push_back
#define in insert
#define f0(b) for(int i=0;i<(b);i++)
#define f00(b) for(int j=0;j<(b);j++)
#define f1(b) for(int i=1;i<=(b);i++)
#define f11(b) for(int j=1;j<=(b);j++)
#define f2(a,b) for(int i=(a);i<=(b);i++)
#define f22(a,b) for(int j=(a);j<=(b);j++)
#define sf(a) scanf("%lld",&a)
#define sff(a,b) scanf("%lld %lld", &a , &b)
#define pf(a) printf("%lld\n",a)
#define pff(a,b) printf("%lld %lld\n", a , b)
#define PI 3.14159265359
#define bug printf("**!\n")
#define mem(a , b) memset(a, b ,sizeof(a))
#define front_zero(n) __builtin_clzll(n)
#define back_zero(n) __builtin_ctzll(n)
#define total_one(n) __builtin_popcountll(n)
#define clean fflush(stdout)

const ll mod =  (ll)1e9 + 7;
const ll maxn = (ll)4e5 + 5;
const int nnn = 1048590;
const int inf = numeric_limits<int>::max()-1;
//const ll INF = numeric_limits<ll>::max()-1;
//const ll INF = 1e18;
 
ll dx[]={0,1,0,-1};
ll dy[]={1,0,-1,0};
ll dxx[]={0,1,0,-1,1,1,-1,-1};
ll dyy[]={1,0,-1,0,1,-1,1,-1};

/**
===========
Lost + something = something
Same + Same = Lost
i + j = i ^ j
===========
**/

#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace __gnu_pbds; 

typedef tree< ll , null_type, less<ll>, rb_tree_tag, 
             tree_order_statistics_node_update> 
     ordered_set;

ll n;
vector < ll > v[3];
ll a[maxn] , b[2*maxn];

ll f(ll x){
    ll ans = 0;
    vector < ii > seg;
    for(ll i = 0; i < n; i++){
        ll X = v[0][i];
        ll Y = v[1][(i+x)%n];
        if(Y < X) swap(X,Y);
        seg.pb({X,Y});
        seg.pb({Y,X});
    }
    sort(seg.begin(), seg.end());
    ll cnt = 0;
    ordered_set  s;
    for(ll i = 1; i <= 2*n; i++) b[i] = 0;
    for(ll i = 1; i <= 2*n; i++){
        ll X = seg[i-1].ff;
        ll Y = seg[i-1].ss;
        if(b[X]){
            s.erase(X);
            continue;
        }
        b[Y] = 1;
        ll k = s.order_of_key(Y);
        ans += k;
        s.in(Y);
    }
    return ans;
}

void solve(){

    cin >> n;
    for(ll i = 1; i <= 2*n; i++){
        char c;
        cin >> c;
        if(c == 'B') a[i] = 1;
        else a[i] = 0;
        v[a[i]].pb(i);
    }
    ll ans = 0;
    ll lo = 0, hg = n-1;
    while(lo <= hg){
        ll mid = (lo + hg)/2;
        if(f(mid) < f(mid+1)) ans = max(ans , f(mid+1)) , lo = mid+1;
        else ans = max(ans , f(mid)) , hg = mid-1; 
    }
    cout << ans;

    return;    
}

 
int main() {
    
    
    #ifdef LOCAL
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
    #else 
     //   freopen("cbarn2.in", "r", stdin);
     //   freopen("cbarn2.out", "w", stdout);
     ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    #endif
    //cout << fixed << setprecision(10);
   // work(maxn);
    //  mem(b,0);
    ll T;
    T=1;
    //cin >> T; 
    //scanf("%lld",&T);
   // ll CT = 0;
    //work();
    while(T--){
        //cout << "Case " << ++CT <<": " ;
        //printf("Case %lld: ",++CT);
        solve();
    }
 
    return 0;
}

Compilation message

monochrome.cpp: In function 'll f(ll)':
monochrome.cpp:80:8: warning: unused variable 'cnt' [-Wunused-variable]
   80 |     ll cnt = 0;
      |        ^~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 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 0 ms 364 KB Output is correct
5 Correct 0 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 0 ms 364 KB Output is correct
12 Correct 0 ms 364 KB Output is correct
13 Correct 0 ms 364 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 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 0 ms 364 KB Output is correct
5 Correct 0 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 0 ms 364 KB Output is correct
12 Correct 0 ms 364 KB Output is correct
13 Correct 0 ms 364 KB Output is correct
14 Correct 3 ms 364 KB Output is correct
15 Correct 3 ms 364 KB Output is correct
16 Correct 3 ms 364 KB Output is correct
17 Correct 3 ms 364 KB Output is correct
18 Correct 3 ms 364 KB Output is correct
19 Correct 3 ms 364 KB Output is correct
20 Correct 3 ms 364 KB Output is correct
21 Correct 3 ms 364 KB Output is correct
22 Correct 3 ms 372 KB Output is correct
23 Correct 2 ms 364 KB Output is correct
24 Correct 4 ms 364 KB Output is correct
25 Correct 2 ms 364 KB Output is correct
26 Correct 3 ms 364 KB Output is correct
27 Correct 3 ms 364 KB Output is correct
28 Correct 3 ms 364 KB Output is correct
29 Correct 2 ms 364 KB Output is correct
30 Correct 2 ms 364 KB Output is correct
31 Correct 3 ms 364 KB Output is correct
32 Correct 3 ms 364 KB Output is correct
33 Correct 4 ms 364 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 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 0 ms 364 KB Output is correct
5 Correct 0 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 0 ms 364 KB Output is correct
12 Correct 0 ms 364 KB Output is correct
13 Correct 0 ms 364 KB Output is correct
14 Correct 3 ms 364 KB Output is correct
15 Correct 3 ms 364 KB Output is correct
16 Correct 3 ms 364 KB Output is correct
17 Correct 3 ms 364 KB Output is correct
18 Correct 3 ms 364 KB Output is correct
19 Correct 3 ms 364 KB Output is correct
20 Correct 3 ms 364 KB Output is correct
21 Correct 3 ms 364 KB Output is correct
22 Correct 3 ms 372 KB Output is correct
23 Correct 2 ms 364 KB Output is correct
24 Correct 4 ms 364 KB Output is correct
25 Correct 2 ms 364 KB Output is correct
26 Correct 3 ms 364 KB Output is correct
27 Correct 3 ms 364 KB Output is correct
28 Correct 3 ms 364 KB Output is correct
29 Correct 2 ms 364 KB Output is correct
30 Correct 2 ms 364 KB Output is correct
31 Correct 3 ms 364 KB Output is correct
32 Correct 3 ms 364 KB Output is correct
33 Correct 4 ms 364 KB Output is correct
34 Correct 27 ms 668 KB Output is correct
35 Correct 29 ms 652 KB Output is correct
36 Correct 26 ms 668 KB Output is correct
37 Correct 25 ms 652 KB Output is correct
38 Correct 26 ms 692 KB Output is correct
39 Correct 26 ms 660 KB Output is correct
40 Correct 24 ms 664 KB Output is correct
41 Correct 26 ms 640 KB Output is correct
42 Correct 26 ms 760 KB Output is correct
43 Correct 26 ms 620 KB Output is correct
44 Correct 25 ms 652 KB Output is correct
45 Correct 26 ms 620 KB Output is correct
46 Correct 27 ms 620 KB Output is correct
47 Correct 27 ms 680 KB Output is correct
48 Correct 28 ms 684 KB Output is correct
49 Correct 23 ms 620 KB Output is correct
50 Correct 26 ms 748 KB Output is correct
51 Correct 26 ms 620 KB Output is correct
52 Correct 24 ms 708 KB Output is correct

Subtask #4
0.0 / 65.0

# 결과 실행 시간 메모리 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 0 ms 364 KB Output is correct
5 Correct 0 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 0 ms 364 KB Output is correct
12 Correct 0 ms 364 KB Output is correct
13 Correct 0 ms 364 KB Output is correct
14 Correct 3 ms 364 KB Output is correct
15 Correct 3 ms 364 KB Output is correct
16 Correct 3 ms 364 KB Output is correct
17 Correct 3 ms 364 KB Output is correct
18 Correct 3 ms 364 KB Output is correct
19 Correct 3 ms 364 KB Output is correct
20 Correct 3 ms 364 KB Output is correct
21 Correct 3 ms 364 KB Output is correct
22 Correct 3 ms 372 KB Output is correct
23 Correct 2 ms 364 KB Output is correct
24 Correct 4 ms 364 KB Output is correct
25 Correct 2 ms 364 KB Output is correct
26 Correct 3 ms 364 KB Output is correct
27 Correct 3 ms 364 KB Output is correct
28 Correct 3 ms 364 KB Output is correct
29 Correct 2 ms 364 KB Output is correct
30 Correct 2 ms 364 KB Output is correct
31 Correct 3 ms 364 KB Output is correct
32 Correct 3 ms 364 KB Output is correct
33 Correct 4 ms 364 KB Output is correct
34 Correct 27 ms 668 KB Output is correct
35 Correct 29 ms 652 KB Output is correct
36 Correct 26 ms 668 KB Output is correct
37 Correct 25 ms 652 KB Output is correct
38 Correct 26 ms 692 KB Output is correct
39 Correct 26 ms 660 KB Output is correct
40 Correct 24 ms 664 KB Output is correct
41 Correct 26 ms 640 KB Output is correct
42 Correct 26 ms 760 KB Output is correct
43 Correct 26 ms 620 KB Output is correct
44 Correct 25 ms 652 KB Output is correct
45 Correct 26 ms 620 KB Output is correct
46 Correct 27 ms 620 KB Output is correct
47 Correct 27 ms 680 KB Output is correct
48 Correct 28 ms 684 KB Output is correct
49 Correct 23 ms 620 KB Output is correct
50 Correct 26 ms 748 KB Output is correct
51 Correct 26 ms 620 KB Output is correct
52 Correct 24 ms 708 KB Output is correct
53 Execution timed out 2066 ms 28604 KB Time limit exceeded
54 Halted 0 ms 0 KB -