Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- #define fixed(n) fixed << setprecision(n)
- #define ceil(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
- #define add_mod(a, b, m) (((a % m) + (b % m)) % m)
- #define sub_mod(a, b, m) (((a % m) - (b % m) + m) % m)
- #define mul_mod(a, b, m) (((a % m) * (b % m)) % m)
- #define all(vec) vec.begin(), vec.end()
- #define rall(vec) vec.rbegin(), vec.rend()
- #define sz(x) int(x.size())
- #define debug(x) cout << #x << ": " << (x) << "\n";
- #define fi first
- #define se second
- #define ll long long
- #define ull unsigned long long
- #define Mod 1'000'000'007
- #define EPS 1e-9
- constexpr int INF = 1 << 30;
- constexpr ll LINF = 1LL << 62;
- #define PI acos(-1)
- template < typename T = int > using Pair = pair < T, T >;
- vector < string > RET = {"NO", "YES"};
- template < typename T = int > istream& operator >> (istream &in, vector < T > &v) {
- for (auto &x : v) in >> x;
- return in;
- }
- template < typename T = int > ostream& operator << (ostream &out, const vector < T > &v) {
- for (const T &x : v) out << x << ' ';
- return out;
- }
- void Solve(){
- int n;
- cin >> n;
- vector < queue < int > > players(2);
- for(int i = 0, sz; i < 2 && cin >> sz; i++){
- for(int j = 0, x; j < sz && cin >> x; j++)
- players[i].push(x);
- }
- map < vector < queue < int > >, bool > vis;
- int games = 0;
- while(!players[0].empty() && !players[1].empty()){
- int x = players[0].front();
- int y = players[1].front();
- players[0].pop(), players[1].pop();
- if(x > y)
- players[0].push(y), players[0].push(x);
- else
- players[1].push(x), players[1].push(y);
- games++;
- if(vis[players])
- return cout << -1 << '\n', void();
- vis[players] = true;
- }
- cout << games << " " << (players[0].empty() ? 2 : 1) << "\n";
- }
- int main(){
- ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
- int test_cases = 1;
- // cin >> test_cases;
- for(int tc = 1; tc <= test_cases; tc++){
- // cout << "Case #" << tc << ": ";
- Solve();
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement