Submission #1177066

#	Time	Username	Problem	Language	Result	Execution time	Memory
1177066		zeyd_reshaddan_pro	Ljeto (COCI21_ljeto)	C++20	10 / 50	0 ms	328 KiB

Main

//designed by Zeyd_Reshaddan_Pro

#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define ull unsigned long long
#define endl '\n'
#define ts to_string
#define si stoi
#define c_p cout.precision

#define b() begin()
#define e() end()
#define rb() rbegin()
#define re() rend()
#define s() size()
#define fr() front()
#define ba() back()
#define t() top()
#define c() clear()

#define sorts sort(s.b(), s.e())
#define sortv sort(v.b(), v.e())
#define rsorts sort(s.rb(), s.re())
#define rsortv sort(v.rb(), v.re())
#define reverses reverse(s.b(), s.e())
#define reversev reverse(v.b(), v.e())

#define forin for(ll i=0; i<n; i++)
#define forjn for(ll j=0; j<n; j++)
#define forim for(ll i=0; i<m; i++)
#define forjm for(ll j=0; j<m; j++)
#define foris for(ll i=0; i<s.size(); i++)
#define forjs for(ll j=0; j<s.size(); j++)
#define foriv for(ll i=0; i<v.size(); i++)
#define forjv for(ll j=0; j<v.size(); j++)

#define whilet while(t--)
#define whilen while(cin>>n)
#define whiles while(cin>>s)

#define p push
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define ins insert
#define m_p make_pair
#define p_q priority_queue

#define hurryup ios_base::sync_with_stdio(false);cin.tie();cout.tie()

ll fact(ll n)
{
    if(n == 0 || n == 1)
    {
        return 1;
    }
    return n * fact(n-1);
}

bool isPrime(ll n)
{
    bool bb = true;
    if(n==1)
    {
        bb = false;
    }
    for(int i=2; i<=sqrt(n); i++)
    {
        if(n%i==0)
        {
            bb = false;
            break;
        }
    }
    return bb;
}

bool isPalendrom(ll n)
{
    string s1 = ts(n);
    string s2 = ts(n);
    reverse(s2.b(), s2.e());
    if(s1 == s2)
    {
        return true;
    }
    else
    {
        return false;
    }
}

bool isSquare(ll n)
{
    return sqrt(n) == int(sqrt(n));
}

ll gcd(ll a, ll b) // Ebob
{
    return __gcd(a, b);
}

ll lcm(ll a, ll b) // Ekob
{
    return a*b/gcd(a, b);
}

int main()
{
    hurryup;
    ll t, n, a, b, c1 = 0, c2 = 0;
    cin>>t;
    vector<pair<ll, pair<bool, bool>>>v;
    while(t--)
    {
        cin>>n>>a>>b;
        v.pb(m_p(n, m_p(a > 4, b > 4)));
        ll k = 100;
        for(int i = v.s() - 2; i >= 0 && v[v.s() - 1].first - v[i].first <= 10; i--)
        {
            if(v[v.s() - 1].second.first == v[i].second.first)
            {
                k += 50;
                break;
            }
        }
        if(v[v.s() - 1].second.second)
        {
            c1 += k;
        }
        else
        {
            c2 += k;
        }
    }
    cout<<c1<<" "<<c2;
}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 15
• Subtask 3: 0 / 25