Submission #516576

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
516576	2022-01-21T13:42:02 Z	leinad2	Monochrome Points (JOI20_monochrome)	C++17	35 / 100	2000 ms	12248 KB

monochrome

#include<bits/stdc++.h>
using namespace std;
int n, i, j, k, a, b;
long long ans=0;
char S[400010];
vector<int>A, B;
int seg[1600010];
void init(){for(int i=0;i<8*n;i++)seg[i]=0;}
void update(int id, int s, int e, int x, int v)
{
    if(e<x||x<s)return;
    if(s==e)
    {
        seg[id]+=v;
        return;
    }
    int m=s+e>>1;
    update(id*2, s, m, x, v);update(id*2+1, m+1, e, x, v);
    seg[id]=seg[id*2]+seg[id*2+1];
}
int get(int id, int s, int e, int l, int r)
{
    if(e<l||r<s)return 0;
    if(l<=s&&e<=r)return seg[id];
    int m=s+e>>1;
    return get(id*2, s, m, l, r)+get(id*2+1, m+1, e, l, r);
}
long long f(int i)
{
    init();
    vector<pair<int, int> >V;
    for(int j=i;j<n;j++)V.push_back({A[j-i], B[j]});
    for(int j=0;j<i;j++)V.push_back({A[j+n-i], B[j]});
    for(auto &p:V)if(p.first>p.second)swap(p.first, p.second);
    sort(V.begin(), V.end());
    long long res=0;
    for(auto p:V)
    {
        int a=p.second;
        update(1, 1, 2*n, a, 1);
        res+=get(1, 1, 2*n, p.first, a-1);
    }
    ans=max(ans, res);
    return res;
}
main()
{
    scanf("%d", &n);
    scanf("%s", &S);
    for(i=0;i<2*n;i++)
    {
        if(S[i]=='B')A.push_back(i+1);
        else B.push_back(i+1);
    }
  int a=0, b=n-1;
  while(a+3<=b)
  {
    int m1=(a+a+b)/3, m2=(a+b+b)/3;
    if(f(m1)>f(m2))b=m2;
    else a=m1;
  }
  for(i=a;i<=b;i++)f(i);
    cout<<ans;
}

Compilation message

monochrome.cpp: In function 'void update(int, int, int, int, int)':
monochrome.cpp:17:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   17 |     int m=s+e>>1;
      |           ~^~
monochrome.cpp: In function 'int get(int, int, int, int, int)':
monochrome.cpp:25:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   25 |     int m=s+e>>1;
      |           ~^~
monochrome.cpp: At global scope:
monochrome.cpp:46:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   46 | main()
      | ^~~~
monochrome.cpp: In function 'int main()':
monochrome.cpp:49:13: warning: format '%s' expects argument of type 'char*', but argument 2 has type 'char (*)[400010]' [-Wformat=]
   49 |     scanf("%s", &S);
      |            ~^   ~~
      |             |   |
      |             |   char (*)[400010]
      |             char*
monochrome.cpp:48:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
monochrome.cpp:49:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   49 |     scanf("%s", &S);
      |     ~~~~~^~~~~~~~~~

Subtask #1
4.0 / 4.0

#	Verdict	Memory	Grader output
1	Correct	204 KB	Output is correct
2	Correct	204 KB	Output is correct
3	Correct	204 KB	Output is correct
4	Correct	204 KB	Output is correct
5	Correct	204 KB	Output is correct
6	Correct	204 KB	Output is correct
7	Correct	204 KB	Output is correct
8	Correct	204 KB	Output is correct
9	Correct	204 KB	Output is correct
10	Correct	204 KB	Output is correct
11	Correct	204 KB	Output is correct
12	Correct	204 KB	Output is correct
13	Correct	204 KB	Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
0.0 / 65.0

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

Submission #516576

Compilation message

Subtask #1 4.0 / 4.0

Subtask #2 21.0 / 21.0

Subtask #3 10.0 / 10.0

Subtask #4 0.0 / 65.0

Subtask #1
4.0 / 4.0

Subtask #2
21.0 / 21.0

Subtask #3
10.0 / 10.0

Subtask #4
0.0 / 65.0