QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #183040 | #6540. Beautiful Sequence | hiderr | WA | 1ms | 3464kb | C++14 | 713b | 2023-09-18 21:15:34 | 2023-09-18 21:15:35 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define loop(i, a, b) for(int i = a; i <= b; i++)
#define loop_rev(i, a, b) for(int i = a; i >= b; i--)
#define sz(x) int(x.size())
#define all(x) x.begin(), x.end()
using ui = uint32_t;
using ll = int64_t;
void solve() {
int n; cin >> n;
vector<int> a(n);
loop(i, 0, n-1) cin >> a[i];
sort(all(a));
int group_cnt = 0, already_matched = 1;
int prev = -1;
loop(i, 0, n-1) {
if(a[i] != prev) {
group_cnt++;
prev = a[i];
}
else {
already_matched++;
}
}
cout << (already_matched + (group_cnt - 1) / 2) << '\n';
}
int main() {
cin.tie(0)->sync_with_stdio(false);
int t; cin >> t;
while(t--) solve();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3464kb
input:
2 6 1 1 2 3 3 4 5 1 2 2 3 3
output:
4 4
result:
ok 2 number(s): "4 4"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3440kb
input:
2 5 1 2 2 3 3 20 1 1 1 1 1 1 4 5 8 8 8 8 9 9 9 9 10 10 10 10
output:
4 17
result:
ok 2 number(s): "4 17"
Test #3:
score: -100
Wrong Answer
time: 1ms
memory: 3448kb
input:
300 14 1 1 1 2 2 2 3 3 3 4 5 5 6 6 14 1 1 1 2 2 3 3 4 4 5 5 6 7 7 14 1 1 2 2 3 4 4 4 5 5 5 6 6 6 14 1 1 2 2 3 3 3 4 5 5 5 6 6 6 14 1 1 1 1 1 1 2 2 2 2 2 3 3 3 14 1 1 1 1 1 1 1 1 1 1 1 1 1 1 14 1 2 2 3 4 5 5 6 6 6 7 8 8 8 14 1 2 2 2 2 2 3 4 5 6 7 8 9 10 14 1 2 2 3 4 4 4 5 6 6 6 6 6 7 14 1 1 2 2 2 3 3...
output:
11 11 11 11 13 14 10 9 11 11 9 10 10 9 12 12 11 10 10 12 10 9 10 10 11 11 11 11 11 11 10 9 10 10 10 11 11 13 12 12 12 11 9 10 10 11 11 10 11 9 11 10 11 10 11 10 11 11 11 12 12 10 10 10 10 10 9 11 11 12 11 10 10 10 11 10 11 10 10 10 9 11 9 11 9 12 10 11 12 12 9 9 11 9 12 11 10 12 10 11 11 10 10 9 11 ...
result:
wrong answer 1st numbers differ - expected: '10', found: '11'