oj.uz

Submission #263427

# Submission time Handle Problem Language Result Execution time Memory
263427 2020-08-13T16:55:20 Z Sorting Board (CEOI13_board) C++17
70 / 100
 200 ms 896 KB 
#include <bits/stdc++.h>

using namespace std;

string a, b;

string get_path(const string &s){
    string ans = "";
    int n = s.size();
    for(int i = 0; i < n; ++i){
        if(s[i] == '1' || s[i] == '2')
            ans.push_back(s[i]);
        else{
            if(s[i] == 'U')
                ans.pop_back();
            else{
                if(s[i] == 'L'){
                    for(int j = (int)ans.size() - 1; j >= 0; --j){
                        if(ans[j] == '2'){
                            ans[j] = '1';
                            for(int k = j + 1; k < (int)ans.size(); ++k)
                                ans[k] = '2';
                            break;
                        }
                    }
                }
                else if(s[i] == 'R'){
                    for(int j = (int)ans.size() - 1; j >= 0; --j){
                        if(ans[j] == '1'){
                            ans[j] = '2';
                            for(int k = j + 1; k < (int)ans.size(); ++k)
                                ans[k] = '1';
                            break;
                        }
                    }
                }
            }
        }
    }
    return ans;
}

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

    cin >> a >> b;

    a = get_path(a);
    b = get_path(b);

    int cnt = (int)min(a.size(), b.size()) - 1;
    for(int i = 0; i < min(a.size(), b.size()); ++i){
        if(a[i] != b[i]){
            cnt = i - 1;
            break;
        }
    }

    //cout << "cnt: " << cnt << endl;

    if(min(a.size(), b.size()) == cnt + 1){
        cout << a.size() + b.size() - 2 * (cnt + 1) << "\n";
        return 0;
    }

    if(a[cnt + 1] == '2')
        swap(a, b);

    int x = a.size() + b.size() - 2 * (cnt + 1);
    int dist = 0, ans = x;
    for(int i = cnt + 1; i < min(a.size(), b.size()); ++i){
        dist = 2 * dist - 1;
        if(a[i] == '1') dist++;
        if(b[i] == '2') dist++;

        if(dist >= 5) break;
        ans = min(ans, dist + x - 2 * (i - cnt));
    }

    cout << ans << "\n";
}

Compilation message

board.cpp: In function 'int main()':
board.cpp:53:22: warning: comparison of integer expressions of different signedness: 'int' and 'const long unsigned int' [-Wsign-compare]
   53 |     for(int i = 0; i < min(a.size(), b.size()); ++i){
      |                    ~~^~~~~~~~~~~~~~~~~~~~~~~~~
board.cpp:62:32: warning: comparison of integer expressions of different signedness: 'const long unsigned int' and 'int' [-Wsign-compare]
   62 |     if(min(a.size(), b.size()) == cnt + 1){
      |        ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
board.cpp:72:28: warning: comparison of integer expressions of different signedness: 'int' and 'const long unsigned int' [-Wsign-compare]
   72 |     for(int i = cnt + 1; i < min(a.size(), b.size()); ++i){
      |                          ~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory 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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 512 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 3 ms 640 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 5 ms 896 KB Output is correct
3 Correct 2 ms 640 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 5 ms 768 KB Output is correct
3 Correct 3 ms 672 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1087 ms 768 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1090 ms 768 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1065 ms 640 KB Time limit exceeded
2 Halted 0 ms 0 KB -