# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
63691 | bazsi700 | Board (CEOI13_board) | C++14 | 1078 ms | 1320 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define ll long long int
#define vi vector<int>
#define vii vector< vector<int> >
#define PI 3.1415926535897932384626433832795
#define INF 9223372036854775807LL
//15:20
bool node1[100005];
bool node2[100005];
int lev1,lev2;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
string a;
string b;
cin >> a >> b;
//cout << a << " " << b << endl;
node1[0] = node2[0] = 1;
lev1 = lev2 = 0;
for(int i = 0; i < a.length(); i++) {
if(a.at(i) == '1') {
lev1++;
} else if(a.at(i) == '2') {
lev1++;
node1[lev1] = true;
} else if(a.at(i) == 'L') {
for(int j = lev1; j >= 0; j--) {
if(node1[j]) {
node1[j] = false;
break;
} else {
node1[j] = true;
}
}
} else if(a.at(i) == 'R') {
for(int j = lev1; j >= 0; j--) {
if(!node1[j]) {
node1[j] = true;
break;
} else {
node1[j] = false;
}
}
} else {
node1[lev1] = false;
lev1--;
}
}
for(int i = 0; i < b.length(); i++) {
//cout <<"a" << node2 << " ";
if(b.at(i) == '1') {
lev2++;
} else if(b.at(i) == '2') {
lev2++;
node2[lev2] = true;
} else if(b.at(i) == 'L') {
for(int j = lev2; j >= 0; j--) {
if(node2[j]) {
node2[j] = false;
break;
} else {
node2[j] = true;
}
}
} else if(b.at(i) == 'R') {
for(int j = lev2; j >= 0; j--) {
if(!node2[j]) {
node2[j] = true;
break;
} else {
node2[j] = false;
}
}
} else {
node2[lev2] = false;
lev2--;
}
}
if(lev1 > lev2) {
swap(lev1,lev2);
swap(node1,node2);
}
int wasdif = lev2-lev1;
for(int i = 0; i < lev2-lev1; i++) {
lev2--;
}
ll ans = INF;
ll nod1 = 0;
ll nod2 = 0;
int waslev = lev1;
for(int goesupmore = 0; goesupmore < waslev; goesupmore++) {
if(lev1-goesupmore <= 20) {
if(nod1 == 0) {
for(int i = 0; i <= lev1; i++) {
nod1*=2;
if(node1[i]) {
nod1++;
}
nod2*=2;
if(node2[i]) {
nod2++;
}
}
}
ans = min(ans,wasdif+goesupmore*2+abs(nod1-nod2));
nod1/=2;
nod2/=2;
} else {
//cout << node1 << " " << node2 << " " << lev1-lev2<< " " << goesupmore*2<< " " << abs(node1-node2) << endl;
lev1--;
lev2--;
}
}
ans = min(ans,wasdif+waslev*2+abs(nod1-nod2));
//cout << node2 << endl;
cout << ans;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |