oj.uz

Submission #55665

# Submission time Handle Problem Language Result Execution time Memory
55665 2018-07-08T12:15:03 Z leehosu01 Board (CEOI13_board) C++17
70 / 100
 200 ms 800 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-1);}
    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),NB.reset(DE),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.reset(DE-1),DE--;
        else NB.reset(i);
    }
    bool operator< (const IB&X)const
    {
        for(int i=0;i<max(DE,X.DE);i++)
            if(NB.test(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;
   // cout<<T<<i<<'\n';
    for(;i<l;i++)
    {
        T<<=1;
        T+=tr[1].NB.test(i);
        T-=tr[0].NB.test(i);
    }
    return T;
}
void rand(string &SS)
{
    SS.clear();int TT,DWC=0;
    for(int i=0;i<100000;i++)
    {
        do TT=rand()%3;while(TT==2&&!DWC);
        if(TT<2)DWC++;
        if(TT==2)DWC--;
        SS+="12ULR"[TT];
    }
}
int main()
{
    srand(time(NULL)*124124ll^24553);
    ios::sync_with_stdio(0);
    cin.tie(0);
    string S;
    for(int i=0;i<=1;i++)
    {
        //ra0nd(S);
        cin>>S;
        for(int j=1;j<S.size();j++)
        {
            if(S[j]=='R'&&S[j-1]=='L'||S[j-1]=='R'&&S[j]=='L')
            {
                S[j]=S[j-1]=0;
                j+=2;
            }
        }
        {
            int W=0;
            for(int j=0;j<S.size();j++)
                if(S[j])S[W++]=S[j];
            S.resize(W);
        }
        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[1].DE;i++)
    {
  	    ll TP=pro(i);
        mi=min(mi,abs(i-tr[0].DE)+abs(i-tr[1].DE)+TP);
      	if(TP>mi)break;
    }
    cout<<mi;
}

Compilation message

board.cpp: In function 'int main()':
board.cpp:74:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j=1;j<S.size();j++)
                     ~^~~~~~~~~
board.cpp:76:25: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
             if(S[j]=='R'&&S[j-1]=='L'||S[j-1]=='R'&&S[j]=='L')
board.cpp:84:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int j=0;j<S.size();j++)
                         ~^~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 600 KB Output is correct
2 Correct 3 ms 600 KB Output is correct
3 Correct 5 ms 732 KB Output is correct

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

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

Subtask #7
10.0 / 10.0

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

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1077 ms 800 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 1075 ms 800 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 1071 ms 800 KB Time limit exceeded
2 Halted 0 ms 0 KB -