// NK
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//using namespace __gnu_pbds;
typedef pair<int,int> ii;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<ll> vll;
#define pb push_back
#define eb emplace_back
#define pob pop_back
#define psf push_front
#define pof pop_front
#define mkp make_pair
#define mkt make_tuple
#define all(x) x.begin(), x.end()
#define Bolivia_is_nice ios::sync_with_stdio(false), cin.tie(nullptr)
//typedef tree<ii, null_type, less<ii>, rb_tree_tag, tree_order_statistics_node_update> ord_set;
void solve(){
int tot = 4*12 * 60;
int mid = tot/2;
int n; cin >> n;
map<int,int> data;
for (int i=0; i<n; ++i){
int x; cin >> x;
data[x] = 1;
}
cin >> n;
for (int i=0; i<n; ++i){
int x; cin >> x;
data[x] = 2;
}
int ans = 0, ho = 0;
int a=0,b=0;
for (auto i=data.begin(); i!= data.end(); i++){
if (i->first <= mid) ++ans;
if (i->second == 2){
b++;
if (b+1 == a) ho++;
}else{
a++;
if (a+1 == b) ho++;
}
}
cout << ans << '\n' << ho << '\n';
}
int main(){
Bolivia_is_nice;
int t = 1; cin>>t;
while(t--)
solve();
return 0;
}
/*
~/.emacs
*/
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
| 2 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
| 3 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
| 4 |
Incorrect |
5 ms |
364 KB |
Output isn't correct |
| 5 |
Incorrect |
9 ms |
364 KB |
Output isn't correct |
| 6 |
Incorrect |
20 ms |
364 KB |
Output isn't correct |
| 7 |
Incorrect |
44 ms |
620 KB |
Output isn't correct |
| 8 |
Incorrect |
42 ms |
364 KB |
Output isn't correct |
| 9 |
Incorrect |
64 ms |
492 KB |
Output isn't correct |
| 10 |
Incorrect |
1 ms |
364 KB |
Extra information in the output file |
