oj.uz

Submission #25613

# Submission time Handle Problem Language Result Execution time Memory
25613 2017-06-23T08:15:59 Z Extazy Board (CEOI13_board) C++14
40 / 100
 3 ms 2276 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 1<<17;

struct node {
    int level;
    long long number;

    node() {
        level=0;
        number=1;
    }

    void move(char a) {
        if(a=='1') {
            ++level;
            number=number*2;
        }
        else if(a=='2') {
            ++level;
            number=number*2+1;
        }
        else if(a=='L') {
            --number;
        }
        else if(a=='R') {
            ++number;
        }
        else { //a=='U'
            --level;
            number=number/2;
        }
    }
};

char a[N],b[N];
int n,m;
node node1,node2;
long long ans,curr;

int main() {
    int i;

    scanf("%s", a+1);
    n=strlen(a+1);
    scanf("%s", b+1);
    m=strlen(b+1);
    
    for(i=1;i<=n;i++) {
        node1.move(a[i]);
    }
    
    for(i=1;i<=m;i++) {
        node2.move(b[i]);
    }

    //ans=node1.level+node2.level;
    //if(node1.level>=1 && node2.level>=1) ans=min(ans,node1.level+node2.level-1ll);

    curr=0;
    while(node1.level!=node2.level) {
        if(node1.level>node2.level) ++curr,node1.move('U');
        else ++curr,node2.move('U');
    }
    ans=curr+max(node1.number,node2.number)-min(node1.number,node2.number);

    while(node1.level>0) {
        curr+=2;
        node1.move('U');
        node2.move('U');
        ans=min(ans,curr+max(node1.number,node2.number)-min(node1.number,node2.number));
    }

    printf("%lld\n", ans);

    return 0;
}

Compilation message

board.cpp: In function 'int main()':
board.cpp:46:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%s", a+1);
                     ^
board.cpp:48:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%s", b+1);
                     ^

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 2276 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 2276 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 2276 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 2276 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 2276 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 2276 KB Output isn't correct
2 Halted 0 ms 0 KB -