Submission #701713

#TimeUsernameProblemLanguageResultExecution timeMemory
701713alanlPreokret (COCI18_preokret)C++14
50 / 50
1 ms340 KiB
#include <bits/stdc++.h> #define pb push_back #define f first #define s second #define rep(X, a,b) for(int X=a;X<b;++X) #define ALL(a) (a).begin(), (a).end() #define SZ(a) (int)(a).size() #define NL "\n" using namespace std; typedef pair<long long,long long> pll; typedef pair<int,int> pii; typedef long long ll; template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << "," << p.second << ')'; } template<typename A> ostream& operator<<(ostream &os, const vector<A> &p){ for(const auto &a:p) os << a << " "; os << "\n"; return os; } int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int a; cin>>a; vector<pii> save; rep(i,0,a){ int x; cin>>x; save.pb({x, 0}); } cin>>a; rep(i,0,a){ int x; cin>>x; save.pb({x, 1}); } sort(ALL(save)); int pt[2]={0, 0}; pt[save[0].s]++; int turn=0, lose=1-save[0].s, half=0; for(auto x:save){ if(x.f<=1440) half++; if(x==save[0]) continue; if(pt[x.s]==pt[1-x.s] && lose==x.s){ turn++; lose=1-x.s; } pt[x.s]++; } cout<<half<<NL; cout<<turn<<NL; }
#Verdict Execution timeMemoryGrader output
Fetching results...