# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
63680 | bazsi700 | Board (CEOI13_board) | C++14 | 1071 ms | 2252 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#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
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
string a;
string b;
cin >> a >> b;
//cout << a << " " << b << endl;
ll node1 = 1;
ll node2 = 1;
for(int i = 0; i < a.length(); i++) {
if(a.at(i) == '1') {
node1*=2;
} else if(a.at(i) == '2') {
node1= node1*2+1;
} else if(a.at(i) == 'L') {
node1--;
} else if(a.at(i) == 'R') {
node1++;
} else {
node1/=2;
}
}
for(int i = 0; i < b.length(); i++) {
//cout <<"a" << node2 << " ";
if(b.at(i) == '1') {
node2*=2;
} else if(b.at(i) == '2') {
node2= node2*2+1;
} else if(b.at(i) == 'L') {
node2--;
} else if(b.at(i) == 'R') {
node2++;
} else {
node2/=2;
}
// cout << node2 << endl;
}
int lev1 = 0;
int lev2 = 0;
ll num = 1;
while(num <= node1) {
lev1++;
num*=2;
}
num = 1;
while(num <= node2) {
lev2++;
num*=2;
}
// cout << node1 << " " << node2 << endl;
// cout << lev1 << " " << lev2 << endl;
lev1--;
lev2--;
if(lev1 > lev2) {
swap(lev1,lev2);
swap(node1,node2);
}
for(int i = 0; i < lev2-lev1; i++) {
node2/=2;
}
ll ans = INF;
for(int goesupmore = 0; goesupmore < lev1; goesupmore++) {
ans = min(ans,lev2-lev1+goesupmore*2+abs(node1-node2));
//cout << node1 << " " << node2 << " " << lev1-lev2<< " " << goesupmore*2<< " " << abs(node1-node2) << endl;
node1/=2;
node2/=2;
}
ans = min(ans,lev2-lev1+lev1*2+abs(node1-node2));
//cout << node2 << endl;
cout << ans;
return 0;
}
컴파일 시 표준 에러 (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... |