Submission #1176881

#	Time	Username	Problem	Language	Result	Execution time	Memory
1176881		fritl	Ljeto (COCI21_ljeto)	C++20	50 / 50	1 ms	1864 KiB

Main

/*
 _____ _          ____             _             
|_   _| |__   ___/ ___|  ___ _ __ | |_ _ __ ___  
  | | | '_ \ / _ \___ \ / _ \ '_ \| __| '__/ _ \ 
  | | | | | |  __/___) |  __/ | | | |_| | | (_) |
  |_| |_| |_|\___|____/ \___|_| |_|\__|_|  \___/ 
*/
#include <bits/stdc++.h>

using namespace std;
#define ll long long
ll maxi = 202020;
vector<ll>par;
ll n;
vector<ll>vis(maxi, 0);
vector<ll>topo;
void dfs(ll x)
{
    vis[x] =1;
    if (vis[par[x]]!=1)
        dfs(par[x]);
    topo.push_back(x);
}
void solve()
{
    ll n;
    cin>>n;
    vector<array<int, 3>>v;
    for (int i=1 ; i<=n ;i++)
    {
        ll t,a,b;
        cin>>t>>a>>b;
        v.push_back({t,a,b});
    }
    ll atim=0, btim=0;
    vector<ll>son(9, -INT_MAX);
    for (int i=0; i<n ;i++)
    {
        ll t= v[i][0];
        ll a= v[i][1];
        ll b =v[i][2];
        if (a<=4)
        {
            ll lasta = son[a];
            if (t-lasta<=10)
            {
                atim+=150;
            }
            else
                atim+=100;
            son[a] = t;
        }
        else
        {
            ll lastb = son[a];
            if (t-lastb<=10)
            {
                btim+=150;
            }
            else
                btim+=100;
            son[a] = t;
        }
    }
    cout<<atim<<" "<<btim;
}
int main()
{
    ll tt=1;
    
    while (tt--)
    {
        solve();
    }
}

Compilation message (stderr)

Main.cpp: In function 'void solve()':
Main.cpp:33:22: warning: narrowing conversion of 't' from 'long long int' to 'int' [-Wnarrowing]
   33 |         v.push_back({t,a,b});
      |                      ^
Main.cpp:33:24: warning: narrowing conversion of 'a' from 'long long int' to 'int' [-Wnarrowing]
   33 |         v.push_back({t,a,b});
      |                        ^
Main.cpp:33:26: warning: narrowing conversion of 'b' from 'long long int' to 'int' [-Wnarrowing]
   33 |         v.push_back({t,a,b});
      |                          ^

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