oj.uz

Submission #699770

# Submission time Handle Problem Language Result Execution time Memory
699770 2023-02-18T01:39:48 Z wcwu Preokret (COCI18_preokret) C++17
50 / 50
 1 ms 340 KB 
#include <bits/stdc++.h>
//#include<random>
using namespace std;
/*#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize("O3")*/
/*#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")//for codeforces*/
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef pair<int, int> pii;
typedef map<ll, ll> mll;
const int MOD1=1e9+7;
const int MOD2=998244353;
const int iINF=INT_MAX;
const ll INF=LLONG_MAX;
const ld PI=3.14159265358979323846;
ll gcd(ll a,ll b){if(b==0) return a; return gcd(b,a%b);}
ll fpow(ll a,ll b,ll m) {
    if(!b) return 1;
    ll ans=fpow(a*a%m,b/2,m);
    return (b%2?ans*a%m:ans);
}
ll inv(ll a,ll m) {return fpow(a,m-2,m);}
#define IOS ios::sync_with_stdio(false);cin.tie(0);
#define dbg(n) cerr<<#n<<": "<<n<<"\n";
#define optline cout<<"\n";
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep1(i,n) for(ll i=1;i<=n;i++)
#define irep(i,m,n) for(ll i=m;i>=n;i--)
#define F first
#define S second
#define All(c) c.begin(), c.end()
#define pb push_back
#define eb emplace_back
//#define mp make_pair
#define uni(c) c.resize(distance(c.begin(), unique(c.begin(), c.end())))
#define unisort(c) sort(c.begin(), c.end());uni(c)

signed main() {
    ll A, B;
    cin>>A;
    vector<ll> pos(2881, 0);
    vector<ll> a(A);
    ll res=0;
    rep(i, A) {
        cin>>a[i];
        pos[a[i]]=1;
        if(a[i]<=1440) res++;
    }
    cin>>B;
    vector<ll> b(B);
    rep(i, B) {
        cin>>b[i];
        pos[b[i]]=2;
        if(b[i]<=1440) res++;
    }
    ll cnta=0, cntb=0, flag=0, ans=0;
    rep1(i, 2880) {
        if(pos[i]==0) continue;
        if(pos[i]==1) {
            cnta++;
            if(cnta>cntb && flag==2) {
                ans++;
            }
            if(cnta>cntb) flag=1;
        }
        else {
            cntb++;
            if(cntb>cnta && flag==1) {
                ans++;
            }
            if(cntb>cnta) flag=2;
        }
    }
    cout<<res<<"\n"<<ans<<"\n";
}

Subtask #1
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct