답안 #751046

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
751046	2023-05-30T23:00:35 Z	ToniB	Monochrome Points (JOI20_monochrome)	C++17	0 / 100	1 ms	256 KB

monochrome

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 4e5 + 2;

int n;
string s;
vector<int> white, black;

bool cross(int x1, int y1, int x2, int y2){
    if(x1 > y1) swap(x1, y1);
    if(x2 > y2) swap(x2, y2);
    if(x1 < x2 && y2 < y1) return false;
    if(x2 < x1 && y1 < y2) return false;
    if(x1 > y2 || x2 > y1) return false;
    return true;
}

int calc(int delta){
    int ret = 0;
    for(int i = 0; i < n; ++i){
        for(int j = i + 1; j < n; ++j){
            if(cross(white[i], black[(i + delta + 2*n) % n], white[j], black[(j + delta + 2*n) % n])) ++ret;
        }
    }
    return ret;
}

int main(){
    cin >> n >> s;

    for(int i = 0; i < 2*n; ++i){
        if(s[i] == 'W') white.push_back(i);
        else black.push_back(i);
    }

    int ans = 0;
    for(int i = -(int)sqrt(n); i <= (int)sqrt(n); ++i){
        ans = max(ans, calc(n/2 + i));
    }

    cout << ans;
	return 0;
}

Subtask #1

0.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	220 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Incorrect	0 ms	212 KB	Output isn't correct
12	Halted	0 ms	0 KB	-

Subtask #2

0.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	220 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Incorrect	0 ms	212 KB	Output isn't correct
12	Halted	0 ms	0 KB	-

Subtask #3

0.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	220 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Incorrect	0 ms	212 KB	Output isn't correct
12	Halted	0 ms	0 KB	-

Subtask #4

0.0 / 65.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	220 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Incorrect	0 ms	212 KB	Output isn't correct
12	Halted	0 ms	0 KB	-