239272026-01-31 21:50:06ubormaciBal-jobb játékcpp17Wrong answer 0/50101ms3176 KiB
#include <iostream>
#include <algorithm> // for sort, mainly
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <array>
#include <string>
#include <cstdio>
#include <iterator>
#include <unordered_set>
#include <cstdint> // for int64_t, int32_t, etc
#include <queue>
#include <stack>
#include <deque>
#include <numeric> // gcd, lcm
#include <fstream>
#include <bitset> // for bitset
#include <iomanip>
#include <cassert> // for set with custom ordering
#include <type_traits> // for set with custom ordering
#include <utility> // for swap, forward, etc
using namespace std;

#pragma GCC optimize("O2")
// #pragma GCC optimize("O1","O2","O3","Ofast","unroll-loops")
//#pragma GCC target("sse","sse2","sse3","sse4.1","sse4.2","avx","avx2","fma")

template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
void dbg_out() { cout << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cout << ' ' << H; dbg_out(T...); }
#ifdef LOCAL
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif

/*
 *
 * notes:
 *
 * int64_t
 * stoi(string s) -> string to int
 * to_string() -> int (or else) to string
 *
 * vector declaration:
 * vector<ll> v(n, 0)
 * vector<vector<ll>> v(n, vector<ll>(n, 0));
 *
 * {if statement} ? {truth value} : {false value}
 *
 * set lower bound/upper bound:
 * 	// . . . m1 . . . d . . . . m2
 *    auto m1_it = b.lower_bound(d);
 *    advance(m1_it, -1);
 *    m1 = *m1_it;
 *	m2 = *b.upper_bound(d);
 *
 * #ifdef LOCAL
 *    freopen("in.txt","r",stdin);
 *    freopen("out.txt","w",stdout);
 * #endif
 *
 * constexpr auto lcm(auto x, auto... xs)
 * {
 *	return ((x = std::lcm(x, xs)), ...);
 * }
 *
 * std::gcd(int a, int b)
 *
 * cout << setprecision(n);
 *
 * set with custom ordering
 * set<ll, decltype(&cmp)> qu(cmp);
 *
 */

typedef int64_t ll;

void solve() {
    
    ll n;
    cin >> n;
    vector<ll> v(2 * n, 0);

    ll lastl = -1;
    ll firstr = -1;

    ll ansopt = 0;
    ll ansind = 2;

    for(ll i = 1; i <= 2 * n-1; i++) {
        if(i % 2 == 1) {
            cin >> v[i];
        }else{
            char h;
            cin >> h;
            if(h == 'B') {
                lastl = i;
            }else if(firstr == -1) {
                firstr = i;
            } 
        }
    }

    //cerr << "\nlastl=" << lastl << "; firstr=" << firstr;

    if(lastl == -1) {
        // az osszes jobb
        ansopt = v[1];
    }
    else if(firstr == -1) {
        // az osszes bal
        ansopt = v[2 * n-1];
    }else{
        // van bal is, jobb is
        
        vector<ll> fin;

        for(ll i = 1; i <= lastl; i += 2) {
            fin.push_back(v[i]);
        }
        for(ll i = max(lastl, firstr) + 1; i <= 2 * n; i += 2) {
            fin.push_back(v[i]);
        }

        cerr << "\nfin=" << fin;

        ll h = fin.size();

        sort(fin.begin(), fin.end());

        ansopt = fin[h/2];
    }

    cout << ansopt << "\n" << ansind;

}

int main()
{
    std::ios_base::sync_with_stdio(false);
    //cin.tie(nullptr);
    //cout.tie(nullptr);

    solve();

    return 0;
}
SubtaskSumTestVerdictTimeMemory
subtask10/0
1Accepted1ms316 KiB
subtask20/4
2Wrong answer98ms3176 KiB
3Wrong answer98ms2992 KiB
4Wrong answer100ms2992 KiB
5Wrong answer97ms2996 KiB
6Accepted17ms2028 KiB
7Accepted17ms1844 KiB
subtask30/8
8Accepted1ms500 KiB
9Accepted17ms1844 KiB
10Accepted17ms1844 KiB
11Wrong answer97ms3052 KiB
12Wrong answer96ms3148 KiB
13Wrong answer97ms2988 KiB
14Wrong answer98ms3008 KiB
15Wrong answer97ms2988 KiB
16Wrong answer96ms2992 KiB
17Wrong answer101ms2992 KiB
18Wrong answer100ms2992 KiB
19Wrong answer94ms2992 KiB
20Wrong answer96ms2992 KiB
21Wrong answer100ms2992 KiB
22Wrong answer98ms2992 KiB
23Wrong answer97ms2988 KiB
24Wrong answer97ms2992 KiB
subtask40/14
25Accepted1ms500 KiB
26Accepted1ms512 KiB
27Accepted1ms508 KiB
28Wrong answer1ms316 KiB
29Wrong answer2ms316 KiB
30Wrong answer1ms316 KiB
31Accepted1ms500 KiB
32Wrong answer1ms316 KiB
33Accepted1ms508 KiB
34Wrong answer1ms316 KiB
35Wrong answer1ms316 KiB
36Wrong answer1ms560 KiB
37Wrong answer1ms316 KiB
38Wrong answer1ms556 KiB
39Wrong answer1ms316 KiB
40Wrong answer1ms416 KiB
41Wrong answer1ms332 KiB
42Accepted1ms316 KiB
43Partially correct1ms316 KiB
44Partially correct1ms500 KiB
45Accepted1ms316 KiB
46Wrong answer1ms496 KiB
47Wrong answer1ms508 KiB
48Wrong answer1ms316 KiB
49Wrong answer1ms512 KiB
50Partially correct1ms316 KiB
51Partially correct1ms316 KiB
52Wrong answer1ms508 KiB
53Wrong answer1ms316 KiB
54Accepted1ms508 KiB
55Accepted1ms316 KiB
56Wrong answer1ms316 KiB
57Accepted1ms316 KiB
58Wrong answer1ms316 KiB
59Wrong answer1ms316 KiB
60Wrong answer1ms316 KiB
61Wrong answer1ms316 KiB
62Wrong answer1ms316 KiB
63Wrong answer1ms316 KiB
64Wrong answer1ms316 KiB
65Wrong answer1ms316 KiB
66Accepted2ms316 KiB
67Wrong answer1ms316 KiB
68Accepted1ms316 KiB
69Wrong answer1ms316 KiB
70Wrong answer1ms316 KiB
subtask50/24
71Accepted1ms500 KiB
72Wrong answer98ms3176 KiB
73Wrong answer98ms2992 KiB
74Wrong answer100ms2992 KiB
75Wrong answer97ms2996 KiB
76Accepted17ms2028 KiB
77Accepted17ms1844 KiB
78Accepted17ms1844 KiB
79Accepted17ms1844 KiB
80Wrong answer97ms3052 KiB
81Wrong answer96ms3148 KiB
82Wrong answer97ms2988 KiB
83Wrong answer98ms3008 KiB
84Wrong answer97ms2988 KiB
85Wrong answer96ms2992 KiB
86Wrong answer101ms2992 KiB
87Wrong answer100ms2992 KiB
88Wrong answer94ms2992 KiB
89Wrong answer96ms2992 KiB
90Wrong answer100ms2992 KiB
91Wrong answer98ms2992 KiB
92Wrong answer97ms2988 KiB
93Wrong answer97ms2992 KiB
94Accepted1ms512 KiB
95Accepted1ms508 KiB
96Wrong answer1ms316 KiB
97Wrong answer2ms316 KiB
98Wrong answer1ms316 KiB
99Accepted1ms500 KiB
100Wrong answer1ms316 KiB
101Accepted1ms508 KiB
102Wrong answer1ms316 KiB
103Wrong answer1ms316 KiB
104Wrong answer1ms560 KiB
105Wrong answer1ms316 KiB
106Wrong answer1ms556 KiB
107Wrong answer1ms316 KiB
108Wrong answer1ms416 KiB
109Wrong answer1ms332 KiB
110Accepted1ms316 KiB
111Partially correct1ms316 KiB
112Partially correct1ms500 KiB
113Accepted1ms316 KiB
114Wrong answer1ms496 KiB
115Wrong answer1ms508 KiB
116Wrong answer1ms316 KiB
117Wrong answer1ms512 KiB
118Partially correct1ms316 KiB
119Partially correct1ms316 KiB
120Wrong answer1ms508 KiB
121Wrong answer1ms316 KiB
122Accepted1ms508 KiB
123Accepted1ms316 KiB
124Wrong answer1ms316 KiB
125Accepted1ms316 KiB
126Wrong answer1ms316 KiB
127Wrong answer1ms316 KiB
128Wrong answer1ms316 KiB
129Wrong answer1ms316 KiB
130Wrong answer1ms316 KiB
131Wrong answer1ms316 KiB
132Wrong answer1ms316 KiB
133Wrong answer1ms316 KiB
134Accepted2ms316 KiB
135Wrong answer1ms316 KiB
136Accepted1ms316 KiB
137Wrong answer1ms316 KiB
138Wrong answer1ms316 KiB
139Partially correct86ms3176 KiB
140Wrong answer86ms2992 KiB
141Wrong answer86ms3112 KiB
142Accepted85ms3116 KiB
143Partially correct86ms2992 KiB
144Wrong answer87ms2992 KiB
145Wrong answer98ms3148 KiB
146Wrong answer98ms2992 KiB
147Wrong answer100ms2992 KiB
148Wrong answer97ms2992 KiB
149Wrong answer98ms2992 KiB
150Wrong answer98ms3144 KiB
151Partially correct87ms2988 KiB
152Wrong answer86ms2992 KiB
153Partially correct85ms3152 KiB
154Wrong answer101ms2992 KiB
155Wrong answer97ms2992 KiB
156Wrong answer98ms3008 KiB
157Partially correct87ms3168 KiB
158Wrong answer87ms3152 KiB
159Wrong answer86ms2992 KiB
160Wrong answer86ms2992 KiB
161Wrong answer98ms3148 KiB
162Wrong answer97ms2992 KiB
163Wrong answer100ms3160 KiB
164Wrong answer97ms3152 KiB
165Wrong answer98ms3152 KiB
166Wrong answer100ms2992 KiB
167Wrong answer100ms2988 KiB