oj.uz

Submission #55636

# Submission time Handle Problem Language Result Execution time Memory
55636 2018-07-08T10:13:45 Z leehosu01 Board (CEOI13_board) C++17
50 / 100
 200 ms 868 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
class IB{
public:
    bitset<101111>NB;
    int DE;
    IB(){DE=0;NB.reset();}
    void operator<<(int n){for(;n--;DE++)NB.reset(DE);}
    void operator>>(int n){for(;n--;DE--)NB.reset(DE);}
    void operator++()
    {
        int i;
        for(i=DE-1;i>=0;i--)
            if(NB.test(i))
                NB.reset(i);
            else break;
        if(i==-1)NB.set(0),DE++;
        else NB.set(i);
    }
    void operator--()
    {
        int i;
        for(i=DE-1;i>=0;i--)
            if(!NB.test(i))
                NB.set(i);
            else break;
        if(i==-1)NB.set(DE),DE++;
        else NB.reset(i);
    }
    bool operator< (const IB&X)const
    {
        for(int i=0;i<DE-X.DE;i++)
            if(NB.test(i))return 0;
        for(int i=0;i<X.DE;i++)
            if(NB.test(DE-X.DE+i)!=X.NB.test(i))
                return X.NB.test(i);
        return 0;
    }
}tr[2];
ll mi=1<<30;
ll pro(int l)
{
    static ll T=0; static int i=0;
    for(;i<l&&T<mi;i++)
    {
        T<<=1;
        T+=(ll)tr[1].NB.test(i)-tr[0].NB.test(i);
    }
    return T;
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    string S;
    for(int i=0;i<=1;i++)
    {
        cin>>S;
        for(auto&I:S)
        {
            if(I=='1')tr[i]<<1;
            else if(I=='2')tr[i]<<1,++tr[i];
            else if(I=='U')tr[i]>>1;
            else if(I=='L')--tr[i];
            else if(I=='R')++tr[i];
        }
    }
    int i;
    if(tr[1].DE<tr[0].DE)swap(tr[0],tr[1]);
    if(tr[1]<tr[0])swap(tr[0],tr[1]);
    for(i=0;i<=tr[0].DE;i++)
    {
        mi=min(mi,tr[0].DE+tr[1].DE-i*2+pro(i));
    }
    cout<<mi;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 10.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 736 KB Output is correct
2 Correct 7 ms 824 KB Output is correct
3 Correct 4 ms 824 KB Output is correct
4 Correct 2 ms 824 KB Output is correct
5 Correct 3 ms 824 KB Output is correct

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

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

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 824 KB Output is correct
2 Correct 6 ms 824 KB Output is correct
3 Correct 6 ms 868 KB Output is correct
4 Correct 3 ms 868 KB Output is correct
5 Correct 2 ms 868 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1061 ms 868 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 1066 ms 868 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 1084 ms 868 KB Time limit exceeded
2 Halted 0 ms 0 KB -