oj.uz

답안 #306840

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
306840 2020-09-26T10:46:05 Z MrDomino Monochrome Points (JOI20_monochrome) C++14
35 / 100
 2000 ms 8168 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;

const int N = (int) 2e5 + 7;
int n;
string s;
vector<int> a;
vector<int> b;
int t[2 * N];

void clr()
{
    for (int i = 1; i <= 2 * n; i++)
    {
        t[i] = 0;
    }
}

void add(int i, int x)
{
    i++;
    while (i <= 2 * n)
    {
        t[i] += x;
        i += i & (-i);
    }
}

int sum(int i)
{
    i++;
    int sol = 0;
    while (i)
    {
        sol += t[i];
        i -= i & (-i);
    }
    return sol;
}

int sum(int i, int j)
{
    return sum(j) - sum(i - 1);
}

ll get(int k)
{
    vector<pair<int, int>> p;
    for (int i = 0; i < n; i++)
    {
        p.push_back({a[i], b[(i + k) % n]});
    }
    for (auto &it : p)
    {
        if (it.second < it.first)
        {
            swap(it.first, it.second);
        }
    }
    sort(p.begin(), p.end());
    ll sol = 0;
    clr();
    for (int i = 0; i < (int) p.size(); i++)
    {
        sol += sum(p[i].first, p[i].second);
        add(p[i].second, +1);
    }
    return sol;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);

    cin >> n >> s;
    for (int i = 0; i < 2 * n; i++)
    {
        if (s[i] == 'W')
        {
            a.push_back(i);
        }
        else
        {
            b.push_back(i);
        }
    }
    ll sol = 0;
    for (int k = 0; k < n; k++)
    {
        sol = max(sol, get(k));
    }
    cout << sol << "\n";
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 6 ms 384 KB Output is correct
15 Correct 7 ms 384 KB Output is correct
16 Correct 6 ms 384 KB Output is correct
17 Correct 6 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 6 ms 384 KB Output is correct
22 Correct 6 ms 384 KB Output is correct
23 Correct 3 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 6 ms 384 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 6 ms 384 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 6 ms 384 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 6 ms 384 KB Output is correct
15 Correct 7 ms 384 KB Output is correct
16 Correct 6 ms 384 KB Output is correct
17 Correct 6 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 6 ms 384 KB Output is correct
22 Correct 6 ms 384 KB Output is correct
23 Correct 3 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 6 ms 384 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 6 ms 384 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 6 ms 384 KB Output is correct
34 Correct 304 ms 384 KB Output is correct
35 Correct 310 ms 384 KB Output is correct
36 Correct 297 ms 384 KB Output is correct
37 Correct 281 ms 504 KB Output is correct
38 Correct 230 ms 384 KB Output is correct
39 Correct 253 ms 460 KB Output is correct
40 Correct 222 ms 504 KB Output is correct
41 Correct 212 ms 460 KB Output is correct
42 Correct 292 ms 504 KB Output is correct
43 Correct 252 ms 384 KB Output is correct
44 Correct 257 ms 384 KB Output is correct
45 Correct 267 ms 508 KB Output is correct
46 Correct 289 ms 384 KB Output is correct
47 Correct 243 ms 504 KB Output is correct
48 Correct 242 ms 384 KB Output is correct
49 Correct 202 ms 384 KB Output is correct
50 Correct 260 ms 504 KB Output is correct
51 Correct 206 ms 384 KB Output is correct
52 Correct 305 ms 384 KB Output is correct

Subtask #4
0.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 6 ms 384 KB Output is correct
15 Correct 7 ms 384 KB Output is correct
16 Correct 6 ms 384 KB Output is correct
17 Correct 6 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 6 ms 384 KB Output is correct
22 Correct 6 ms 384 KB Output is correct
23 Correct 3 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 6 ms 384 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 6 ms 384 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 6 ms 384 KB Output is correct
34 Correct 304 ms 384 KB Output is correct
35 Correct 310 ms 384 KB Output is correct
36 Correct 297 ms 384 KB Output is correct
37 Correct 281 ms 504 KB Output is correct
38 Correct 230 ms 384 KB Output is correct
39 Correct 253 ms 460 KB Output is correct
40 Correct 222 ms 504 KB Output is correct
41 Correct 212 ms 460 KB Output is correct
42 Correct 292 ms 504 KB Output is correct
43 Correct 252 ms 384 KB Output is correct
44 Correct 257 ms 384 KB Output is correct
45 Correct 267 ms 508 KB Output is correct
46 Correct 289 ms 384 KB Output is correct
47 Correct 243 ms 504 KB Output is correct
48 Correct 242 ms 384 KB Output is correct
49 Correct 202 ms 384 KB Output is correct
50 Correct 260 ms 504 KB Output is correct
51 Correct 206 ms 384 KB Output is correct
52 Correct 305 ms 384 KB Output is correct
53 Execution timed out 2064 ms 8168 KB Time limit exceeded
54 Halted 0 ms 0 KB -