oj.uz

Submission #1032379

# Submission time Handle Problem Language Result Execution time Memory
1032379 2024-07-23T16:26:21 Z Andrey Monochrome Points (JOI20_monochrome) C++14
35 / 100
 2000 ms 6088 KB 
#include<bits/stdc++.h>
using namespace std;

int sb = 0;

vector<int> calc(vector<int> haha, int br) {
    if(br == 0) {
        return haha;
    }
    sb+=br*(br-1)/2;
    int p1 = haha.size(),p2 = -1,z = 0;
    vector<int> ans(0);
    for(int i = 0; i < haha.size(); i++) {
        if(haha[i] == 1) {
            sb-=i;
            z++;
            haha[i] = 2;
            if(z == br) {
                p1 = i;
                break;
            }
        }
    }
    z = 0;
    for(int i = (int)haha.size()-1; i >= 0; i--) {
        if(haha[i] == 0) {
            z++;
            sb+=i-1-(br-z)*2;
            haha[i] = 2;
            if(z == br) {
                p2 = i;
                break;
            }
        }
    }
    if(p1 < p2) {
        for(int i = 0; i < haha.size(); i++) {
            if(haha[i] != 2) {
                ans.push_back(haha[i]);
            }
        }
        return ans;
    }
    else {
        sb = -1;
        return ans;
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int ans = 0;
    int n;
    cin >> n;
    vector<int> haha(2*n);
    char a;
    for(int i = 0; i < 2*n; i++) {
        cin >> a;
        if(a == 'W') {
            haha[i] = 0;
        }
        else {
            haha[i] = 1;
        }
    }
    if(haha[0] == 1) {
        for(int i = 0; i < 2*n; i++) {
            haha[i] = 1-haha[i];
        }
    }
    for(int i = 1; i < 2*n; i++) {
        if(haha[i]) {
            sb = 0;
            vector<int> a(0);
            vector<int> b(0);
            for(int j = 1; j < i; j++) {
                a.push_back(haha[j]);
            }
            for(int j = i+1; j < 2*n; j++) {
                b.push_back(haha[j]);
            }
            int c = abs((int)a.size()-(int)b.size())/2;
            sb+=min(a.size(),b.size());
            if(a.size() > b.size()) {
                a = calc(a,c);
            }
            else {
                for(int j = 0; j < b.size(); j++) {
                    b[j] = 1-b[j];
                }
                b = calc(b,c);
                for(int j = 0; j < b.size(); j++) {
                    b[j] = 1-b[j];
                }
            }
            if(sb == -1) {
                continue;
            }
            int y = 0;
            vector<int> p(a.size());
            for(int j = 0; j < a.size(); j++) {
                if(a[j]) {
                    while(b[y] == true) {
                        y++;
                    }
                    p[j] = y;
                    y++;
                }
            }
            y = 0;
            for(int j = 0; j < a.size(); j++) {
                if(!a[j]) {
                    while(b[y] == false) {
                        y++;
                    }
                    p[j] = y;
                    y++;
                }
            }
            for(int j = 0; j < a.size(); j++) {
                for(int k = j+1; k < a.size(); k++) {
                    if(p[k] > p[j]) {
                        sb++;
                    }
                }
            }
            ans = max(ans,sb);
        }
    }
    cout << ans;
    return 0;
}

Compilation message

monochrome.cpp: In function 'std::vector<int> calc(std::vector<int>, int)':
monochrome.cpp:13:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |     for(int i = 0; i < haha.size(); i++) {
      |                    ~~^~~~~~~~~~~~~
monochrome.cpp:37:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |         for(int i = 0; i < haha.size(); i++) {
      |                        ~~^~~~~~~~~~~~~
monochrome.cpp: In function 'int main()':
monochrome.cpp:91:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |                 for(int j = 0; j < b.size(); j++) {
      |                                ~~^~~~~~~~~~
monochrome.cpp:95:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   95 |                 for(int j = 0; j < b.size(); j++) {
      |                                ~~^~~~~~~~~~
monochrome.cpp:104:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  104 |             for(int j = 0; j < a.size(); j++) {
      |                            ~~^~~~~~~~~~
monochrome.cpp:114:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  114 |             for(int j = 0; j < a.size(); j++) {
      |                            ~~^~~~~~~~~~
monochrome.cpp:123:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  123 |             for(int j = 0; j < a.size(); j++) {
      |                            ~~^~~~~~~~~~
monochrome.cpp:124:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  124 |                 for(int k = j+1; k < a.size(); k++) {
      |                                  ~~^~~~~~~~~~

Subtask #1
4.0 / 4.0

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

Subtask #2
21.0 / 21.0

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

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 456 KB Output is correct
10 Correct 0 ms 456 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 4 ms 348 KB Output is correct
15 Correct 4 ms 348 KB Output is correct
16 Correct 4 ms 388 KB Output is correct
17 Correct 7 ms 344 KB Output is correct
18 Correct 2 ms 348 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 4 ms 348 KB Output is correct
21 Correct 5 ms 348 KB Output is correct
22 Correct 3 ms 476 KB Output is correct
23 Correct 1 ms 484 KB Output is correct
24 Correct 2 ms 348 KB Output is correct
25 Correct 2 ms 348 KB Output is correct
26 Correct 1 ms 472 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 460 KB Output is correct
33 Correct 4 ms 484 KB Output is correct
34 Correct 909 ms 508 KB Output is correct
35 Correct 919 ms 348 KB Output is correct
36 Correct 830 ms 504 KB Output is correct
37 Correct 699 ms 504 KB Output is correct
38 Correct 606 ms 344 KB Output is correct
39 Correct 629 ms 348 KB Output is correct
40 Correct 490 ms 348 KB Output is correct
41 Correct 427 ms 496 KB Output is correct
42 Correct 716 ms 504 KB Output is correct
43 Correct 399 ms 348 KB Output is correct
44 Correct 499 ms 344 KB Output is correct
45 Correct 153 ms 348 KB Output is correct
46 Correct 166 ms 344 KB Output is correct
47 Correct 191 ms 348 KB Output is correct
48 Correct 852 ms 344 KB Output is correct
49 Correct 391 ms 344 KB Output is correct
50 Correct 31 ms 348 KB Output is correct
51 Correct 30 ms 508 KB Output is correct
52 Correct 643 ms 348 KB Output is correct

Subtask #4
0.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 456 KB Output is correct
10 Correct 0 ms 456 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 4 ms 348 KB Output is correct
15 Correct 4 ms 348 KB Output is correct
16 Correct 4 ms 388 KB Output is correct
17 Correct 7 ms 344 KB Output is correct
18 Correct 2 ms 348 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 4 ms 348 KB Output is correct
21 Correct 5 ms 348 KB Output is correct
22 Correct 3 ms 476 KB Output is correct
23 Correct 1 ms 484 KB Output is correct
24 Correct 2 ms 348 KB Output is correct
25 Correct 2 ms 348 KB Output is correct
26 Correct 1 ms 472 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 460 KB Output is correct
33 Correct 4 ms 484 KB Output is correct
34 Correct 909 ms 508 KB Output is correct
35 Correct 919 ms 348 KB Output is correct
36 Correct 830 ms 504 KB Output is correct
37 Correct 699 ms 504 KB Output is correct
38 Correct 606 ms 344 KB Output is correct
39 Correct 629 ms 348 KB Output is correct
40 Correct 490 ms 348 KB Output is correct
41 Correct 427 ms 496 KB Output is correct
42 Correct 716 ms 504 KB Output is correct
43 Correct 399 ms 348 KB Output is correct
44 Correct 499 ms 344 KB Output is correct
45 Correct 153 ms 348 KB Output is correct
46 Correct 166 ms 344 KB Output is correct
47 Correct 191 ms 348 KB Output is correct
48 Correct 852 ms 344 KB Output is correct
49 Correct 391 ms 344 KB Output is correct
50 Correct 31 ms 348 KB Output is correct
51 Correct 30 ms 508 KB Output is correct
52 Correct 643 ms 348 KB Output is correct
53 Execution timed out 2061 ms 6088 KB Time limit exceeded
54 Halted 0 ms 0 KB -