# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
145888 | youssan_william | Preokret (COCI18_preokret) | C++14 | 4 ms | 508 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll a , b;
cin >> a;
ll arr[a];
ll mid=1440;
map<ll,char>mp;
vector<ll>goals;
for(int i = 0 ; i < a ;i++)
{
cin >> arr[i];
goals.push_back(arr[i]);
mp[arr[i]]='a';
}
cin >> b;
ll arr2[b];
for(int i = 0 ; i < b ;i++)
{
cin >> arr2[i];
goals.push_back(arr2[i]);
mp[arr2[i]]='b';
}
sort(goals.begin(),goals.end());
int ans=0 , teamA=0 , teamB=0 , turnarounds=0,loser=-1, newloser;
for(int i = 0 ; i < goals.size() ;i++)
{
if(mp[goals[i]]=='a')
teamA++;
else teamB++;
if(teamA!=teamB&&teamA!=0&&teamB!=0)
{
if(teamA>teamB) newloser=1;
else newloser=0;
if(newloser!=loser)
{
loser=newloser;
turnarounds++;
}
}
if(goals[i]<=mid)
ans++;
}
cout << ans << " " << turnarounds ;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |