QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#255169 | #7689. Flipping Cards | GCnoodlesbot# | WA | 0ms | 3608kb | C++20 | 1.1kb | 2023-11-18 14:58:16 | 2023-11-18 14:58:16 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n + 1), b(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i] >> b[i];
}
auto check = [&](int x) {
vector<int> A(n + 2), B(n + 2), C(n + 2);
for (int i = 1; i <= n; i++) {
if (a[i] >= x) A[i] = A[i - 1] + 1;
else A[i] = A[i - 1];
if (b[i] >= x) B[i] = B[i - 1] + 1;
else B[i] = B[i - 1];
}
for (int i = n; i >= 1; i--) {
if (a[i] >= x) C[i] = C[i + 1] + 1;
else C[i] = C[i + 1];
}
int maxv = -1E9, res = A[n];
for (int i = 1; i <= n; i++) {
maxv = max(maxv, A[i] - B[i - 1]);
res = max(res, B[i] + maxv + C[i + 1]);
}
return res >= (n + 1) / 2;
};
int l = 1, r = 1e9;
while (l < r) {
int mid = (l + r + 1) / 2;
if (check(mid)) l = mid;
else r = mid - 1;
}
cout << r << '\n';
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3608kb
input:
5 3 6 5 2 4 7 6 4 2 8
output:
6
result:
ok 1 number(s): "6"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3592kb
input:
1 2 1
output:
2
result:
ok 1 number(s): "2"
Test #3:
score: 0
Accepted
time: 0ms
memory: 3600kb
input:
1 212055293 384338286
output:
384338286
result:
ok 1 number(s): "384338286"
Test #4:
score: -100
Wrong Answer
time: 0ms
memory: 3608kb
input:
99 749159996 323524232 125448341 365892333 481980673 143665393 394405973 44741918 687549448 513811513 287088118 385131171 11865696 666468353 449920567 373650719 671547289 116780561 41003675 671513243 351534153 507850962 374160874 985661954 222519431 600582098 987220654 704142246 856147059 37783620 1...
output:
533804754
result:
wrong answer 1st numbers differ - expected: '528957505', found: '533804754'