# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
508357 | ac2hu | Preokret (COCI18_preokret) | C++14 | 1 ms | 332 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;
signed main(){
iostream::sync_with_stdio(false);
cin.tie(nullptr);cout.tie(nullptr);
vector<pair<int,int>> temp;
int a;cin >> a;
for(int i = 0;i<a;i++){
int t;cin >> t;
temp.push_back({t,0});
}
int b;cin >> b;
for(int i = 0;i<b;i++){
int t;cin >> t;
temp.push_back({t,1});
}
int half = 1440;
sort(temp.begin(),temp.end());
int c = 0;
for(int i = 0;i<temp.size();i++){
if(temp[i].first <= half)
c++;
else
break;
}
array<int,2> vec = {0,0};
int winner = temp[0].second;
vec[temp[0].second]++;
int tc = 0;
for(int i = 1;i<temp.size();i++){
vec[temp[i].second]++;
if(vec[0] > vec[1]){
if(winner != 0){
winner = 0;
tc++;
}
}
if(vec[1] > vec[0]){
if(winner != 1){
winner = 1;
tc++;
}
}
}
cout << c << "\n" << tc << "\n";
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |