| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 363853 |
2021-02-07T11:27:10 Z |
ACmachine |
Board (CEOI13_board) |
C++17 |
|
4 ms |
1532 KB |
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<str> vstr;
#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define rsz resize
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)
const double EPS = 1e-9;
const int MOD = 1e9+7; // 998244353;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};
#ifdef DEBUG
#define DBG if(1)
#else
#define DBG if(0)
#endif
#define dbg(x) cout << "(" << #x << " : " << x << ")" << endl;
// ostreams
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "["; REP(i, v.size()) out << v[i] << ", "; out << "]"; return out;}
// istreams
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
template<class T, class U>
istream& operator>>(istream& in, pair<T, U> &p){ in >> p.ff >> p.ss; return in; }
//searches
template<typename T, typename U>
T bsl(T lo, T hi, U f){ hi++; T mid; while(lo < hi){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; }
template<typename U>
double bsld(double lo, double hi, U f, double p = 1e-9){ int r = 3 + (int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid; } return (lo + hi)/2; }
template<typename T, typename U>
T bsh(T lo, T hi, U f){ lo--; T mid; while(lo < hi){ mid = (lo + hi + 1)/2; f(mid) ? lo = mid : hi = mid-1; } return lo; }
template<typename U>
double bshd(double lo, double hi, U f, double p = 1e-9){ int r = 3+(int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? lo = mid : hi = mid; } return (lo + hi)/2; }
// some more utility functions
template<typename T>
pair<T, int> get_min(vector<T> &v){ typename vector<T> :: iterator it = min_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T>
pair<T, int> get_max(vector<T> &v){ typename vector<T> :: iterator it = max_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T> bool ckmin(T& a, const T& b){return b < a ? a = b , true : false;}
template<typename T> bool ckmax(T& a, const T& b){return b > a ? a = b, true : false;}
struct bigint{
vector<int> a;
bigint(){a.pb(1);}
void push(int i){
a[(int)a.size() - 1 - i - 1] += a[(int)a.size() - 1 - i] / 2;
if(a[(int)a.size() - 1- i] < 0 && a[(int)a.size() - 1 - i] % 2 == -1){
a[(int)a.size() - 1 - i - 1]--;
}
a[(int)a.size() - 1 - i] = abs(a[(int)a.size() - 1 - i] % 2);
}
void mul(){
a.pb(0);
}
void add(){
a.back()++;
}
void sub(){
a.back()--;
}
void div(){
push(0);
a.pop_back();
}
};
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
string a, b;
cin >> a >> b;
auto transform = [&](string s){
bigint re;
REP(i, s.length()){
if(s[i] == '1'){
re.mul();
}
else if(s[i] == '2'){
re.mul(); re.add();
}
else if(s[i] == 'L'){
re.sub();
}
else if(s[i] == 'R'){
re.add();
}
else if(s[i] == 'U'){
re.div();
}
}
REP(i, (int)re.a.size() - 1){
re.push(i);
}
return re;
};
bigint f = transform(a);
bigint s = transform(b);
ll base_shift = 0;
if(f.a.size() < s.a.size()) swap(f, s);
while(f.a.size() > s.a.size()){
base_shift++;
f.div();
}
ll ans = INFF;
ll curr_diff = 0;
REP(i, f.a.size()){
ll temp_ans = base_shift + 2 * (f.a.size() - (i + 1));
curr_diff *= 2ll;
if(f.a[i] != s.a[i]) curr_diff++;
ans = min(ans, temp_ans + curr_diff);
if(curr_diff > (int)2e6) break;
}
cout << ans << "\n";
return 0;
}
Compilation message
board.cpp: In lambda function:
board.cpp:26:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
26 | #define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
| ^
board.cpp:28:18: note: in expansion of macro 'FOR'
28 | #define REP(i,b) FOR(i,0,b,1)
| ^~~
board.cpp:115:9: note: in expansion of macro 'REP'
115 | REP(i, s.length()){
| ^~~
board.cpp: In function 'int main()':
board.cpp:26:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
26 | #define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
| ^
board.cpp:28:18: note: in expansion of macro 'FOR'
28 | #define REP(i,b) FOR(i,0,b,1)
| ^~~
board.cpp:147:5: note: in expansion of macro 'REP'
147 | REP(i, f.a.size()){
| ^~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Correct |
1 ms |
364 KB |
Output is correct |
| 3 |
Correct |
1 ms |
364 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
748 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
492 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
492 KB |
Output is correct |
| 2 |
Incorrect |
4 ms |
876 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
492 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
1532 KB |
Output is correct |
| 2 |
Incorrect |
3 ms |
1384 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
1384 KB |
Output is correct |
| 2 |
Incorrect |
3 ms |
1512 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
3 ms |
1384 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
