oj.uz

Submission #25633

# Submission time Handle Problem Language Result Execution time Memory
25633 2017-06-23T09:42:48 Z Extazy Board (CEOI13_board) C++14
70 / 100
 200 ms 8316 KB 
#include <bits/stdc++.h>
#define string vector < long long >

using namespace std;

const int N = 1<<20;
const long long BASE = 1e18;
const int BASE_LENGTH = 18;
const vector < long long > V0 = { 0 };
const vector < long long > V1 = { 1 };
const vector < long long > V2 = { 2 };

string add(string a, string b) {
    string c,d;
    int i;
    long long p=0,t;

    reverse(a.begin(),a.end());
    reverse(b.begin(),b.end());
    
    //while(a.size()<b.size()) a.push_back(0);
    while(a.size()>b.size()) b.push_back(0);

    for(i=0;i<(int)(a.size());i++) {
        t=p+a[i]+b[i];
        p=t/BASE;
        t%=BASE;
        c.push_back(t);
    }
    if(p>0) c.push_back(p);

    reverse(c.begin(),c.end());
    for(i=0;i<(int)(c.size());i++) if(c[i]!=0) break;
    for(;i<(int)(c.size());i++) d.push_back(c[i]);
    if(d.empty()) d.push_back(0);
    
    return d;
}

void add1(string &a) {
    int i;
    for(i=(int)(a.size())-1;i>=0;i--) {
        if(++a[i]==BASE) {
            a[i]=0;
        }
        else break;
    }
    if(i<0) {
        reverse(a.begin(),a.end());
        a.push_back(1);
        reverse(a.begin(),a.end());
    }
}

void subtract1(string &a) {
    int i;
    if(a[a.size()-1]>0) {
        --a[a.size()-1];
        return;
    }
    a[a.size()-1]+=BASE-1;
    for(i=(int)(a.size())-2;i>=0;i--) {
        if(a[i]>0) --a[i];
        else a[i]=BASE-1;
    }
}

bool cmp(string a, string b) {
    if(a.size()<b.size()) return true;
    if(a.size()>b.size()) return false;
    for(int i=0;i<(int)(a.size());i++) {
        if(a[i]<b[i]) return true;
        if(a[i]>b[i]) return false;
    }
    return false;
}

string get_min(string a, string b) {
    return ((cmp(a,b)==true) ? a : b);
}

string get_max(string a, string b) {
    return ((cmp(a,b)==true) ? b : a);
}

string subtract(string a, string b) {
    string c,d;
    int i,j;

    reverse(a.begin(),a.end());
    reverse(b.begin(),b.end());
    
    while(a.size()>b.size()) b.push_back(0);

    for(i=0;i<(int)(a.size());i++) {
        if(a[i]>=b[i]) {
            c.push_back(a[i]-b[i]);
            continue;
        }
        for(j=i+1;j<(int)(a.size());j++) {
            if(a[j]>0) {
                --a[j];
                break;
            }
            else {
                a[j]=BASE-1;
            }
        }
        c.push_back(a[i]+BASE-b[i]);
    }

    reverse(c.begin(),c.end());
    for(i=0;i<(int)(c.size());i++) if(c[i]!=0) break;
    for(;i<(int)(c.size());i++) d.push_back(c[i]);
    if(d.empty()) d.push_back(0);

    return d;
}

string div2(string a) {
    int i;
    long long p=0;
    string b,c;
    for(i=0;i<(int)(a.size());i++) {
        p*=BASE;
        p+=a[i];
        b.push_back(p/2);
        p%=2;
    }
    for(i=0;i<(int)(b.size());i++) if(b[i]!=0) break;
    for(;i<(int)(b.size());i++) c.push_back(b[i]);
    if(c.empty()) c.push_back(0);

    return c;
}

struct node {
    int level;
    string number;

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

    void move(char a) {
        if(a=='1') {
            ++level;
            number=add(number,number);
        }
        else if(a=='2') {
            ++level;
            number=add(number,number);
            add1(number);
        }
        else if(a=='L') {
            subtract1(number);
        }
        else if(a=='R') {
            add1(number);
        }
        else { //a=='U'
            --level;
            number=div2(number);
        }
    }
};

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

int get_digcnt(long long a) {
    if(a<(1<<20)) return digcnt[a];
    else if((a>>20)<(1<<20)) return 20+digcnt[a>>20];
    else return 40+digcnt[a>>40];
}

void print(vector < long long > a) {
    printf("%lld", a[0]);
    for(int i=1;i<(int)(a.size());i++) {
        int j=BASE_LENGTH-get_digcnt(a[i]);
        while(j--) printf("0");
        printf("%lld", a[i]);
    }
    printf("\n");
}

int main() {
    int i;

    for(i=0;i<10;i++) digcnt[i]=1;
    for(i=10;i<N;i++) digcnt[i]=digcnt[i/10]+1;

    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=V0;
    while(node1.level!=node2.level) {
        if(node1.level>node2.level) add1(curr),node1.move('U');
        else add1(curr),node2.move('U');
    }
    ans=add(curr,subtract(get_max(node1.number,node2.number),get_min(node1.number,node2.number)));

    while(node1.level>0) {
        add1(curr);
        add1(curr);
        node1.move('U');
        node2.move('U');
        ans=get_min(ans,add(curr,subtract(get_max(node1.number,node2.number),get_min(node1.number,node2.number))));
    }

    print(ans);

    return 0;
}

Compilation message

board.cpp: In function 'int main()':
board.cpp:197:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%s", a+1);
                     ^
board.cpp:199: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 8180 KB Output is correct
2 Correct 3 ms 8180 KB Output is correct
3 Correct 3 ms 8180 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8180 KB Output is correct
2 Correct 16 ms 8180 KB Output is correct
3 Correct 13 ms 8180 KB Output is correct
4 Correct 3 ms 8180 KB Output is correct
5 Correct 3 ms 8180 KB Output is correct

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 8180 KB Output is correct
2 Correct 9 ms 8180 KB Output is correct
3 Correct 3 ms 8180 KB Output is correct
4 Correct 0 ms 8180 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 8180 KB Output is correct
2 Correct 99 ms 8180 KB Output is correct
3 Correct 56 ms 8180 KB Output is correct
4 Correct 3 ms 8180 KB Output is correct
5 Correct 3 ms 8180 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 200 ms 8312 KB Execution timed out
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 200 ms 8316 KB Execution timed out
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 200 ms 8316 KB Execution timed out
2 Halted 0 ms 0 KB -