QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #639076 | #8332. Two in One | rikka_lyly# | TL | 0ms | 3772kb | C++20 | 1.0kb | 2024-10-13 17:50:37 | 2024-10-13 17:50:43 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
void solve()
{
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++)
{
cin >> a[i];
}
int ans = 0;
auto sov = [&]() {
vector<int> buk(n + 1);
map<int, int> mp;
for (int i = 1; i <= n; i++)
{
if(buk[a[i]])
{
mp[a[i]]--;
if(!mp[a[i]])
mp.erase(a[i]);
}
buk[a[i]]++;
mp[buk[a[i]]]++;
for (auto &[x1, y1] : mp)
{
for (auto &[x2, y2] : mp)
{
ans = max(ans, x1 | x2);
}
}
}
};
sov();
reverse(a.begin() + 1, a.end());
sov();
cout << ans << '\n';
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int t;
cin >> t;
while (t--)
{
solve();
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3556kb
input:
1 7 1 2 3 4 3 2 1
output:
3
result:
ok 1 number(s): "3"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3772kb
input:
1 9 1 1 1 1 1 2 2 2 2
output:
7
result:
ok 1 number(s): "7"
Test #3:
score: -100
Time Limit Exceeded
input:
50 10000 72 65 90 94 67 93 41 43 54 83 31 34 38 37 44 42 92 63 66 79 90 45 41 40 19 54 34 90 13 74 40 77 41 57 74 86 91 79 34 39 21 88 90 57 23 31 8 15 80 27 45 38 53 96 51 82 70 71 19 75 62 95 31 67 99 97 94 29 90 7 95 82 61 98 62 77 43 65 66 30 41 69 38 79 51 9 63 77 13 30 72 70 67 93 92 45 74 50 ...