#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +100500
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e18)
#define el '\n'
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;
vector <pair <int, int> > v;
int x, ans, n, m, i, j, a, b;
int main()
{
srand(time(0));
ios_base::sync_with_stdio(0);
iostream::sync_with_stdio(0);
ios::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
// in("input.txt");
// out("output.txt");
cin >> n;
for (i = 1; i <= n; i++)
{
cin >> x;
v.pb({x, 1});
if (x <= 2 * 12 * 60) ans++;
}
cin >> m;
for (i = 1; i <= m; i++)
{
cin >> x;
v.pb({x, 2});
if (x <= 2 * 12 * 60) ans++;
}
cout << ans << el;
sort(v.begin(), v.end());
ans = 0;
a = 0;b = 0;
for (i = 0; i < v.size(); i++)
{
if (a < b && v[j].S == 1)
{
j = i;
while (j < v.size() && v[j].S == 1) j++, a++;
if (a > b) ans++;
i = j - 1;
}
else if (a > b && v[j].S == 2)
{
j = i;
while (j < v.size() && v[j].S == 2) j++, b++;
if (a < b) ans++;
i = j - 1;
}
else if (a == b && v[j].S == 2)
{
j = i;
while (j < v.size() && v[j].S == 2) j++, b++;
i = j - 1;
}
else
{
j = i;
while (j < v.size() && v[j].S == 1) j++, a++;
i = j - 1;
}
}
cout << ans << el;
}
Compilation message
preokret.cpp: In function 'int main()':
preokret.cpp:61:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (i = 0; i < v.size(); i++)
~~^~~~~~~~~~
preokret.cpp:66:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
while (j < v.size() && v[j].S == 1) j++, a++;
~~^~~~~~~~~~
preokret.cpp:74:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
while (j < v.size() && v[j].S == 2) j++, b++;
~~^~~~~~~~~~
preokret.cpp:82:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
while (j < v.size() && v[j].S == 2) j++, b++;
~~^~~~~~~~~~
preokret.cpp:88:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
while (j < v.size() && v[j].S == 1) j++, a++;
~~^~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1092 ms |
384 KB |
Time limit exceeded |
| 2 |
Execution timed out |
1088 ms |
384 KB |
Time limit exceeded |
| 3 |
Execution timed out |
1095 ms |
384 KB |
Time limit exceeded |
| 4 |
Execution timed out |
1058 ms |
512 KB |
Time limit exceeded |
| 5 |
Execution timed out |
1088 ms |
384 KB |
Time limit exceeded |
| 6 |
Execution timed out |
1083 ms |
384 KB |
Time limit exceeded |
| 7 |
Execution timed out |
1054 ms |
384 KB |
Time limit exceeded |
| 8 |
Execution timed out |
1088 ms |
464 KB |
Time limit exceeded |
| 9 |
Execution timed out |
1092 ms |
384 KB |
Time limit exceeded |
| 10 |
Execution timed out |
1088 ms |
384 KB |
Time limit exceeded |
