Submission #1176988

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

Main

#include <iostream>
#include <cmath>
#include <algorithm>
#include <cctype>
#include <cstdio>
#include <cstring>
#include <bitset>
#include <string>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <unordered_set>
#define ll long long 
#define ld long double
#define db double 
#define ch char
#define sg string 
#define st set
#define stck stack
#define pq priority_queue 
#define dq deque
#define vc vector 
#define bl bool
#define mp map
#define cp cout.precision 
#define ts to_string
#define mst multiset 
#define uost unordered_set 
using namespace std;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    ll n,num1,num2,num3,ans1=0,ans2=0;
    scanf("%lld",&n);
    mp<ll,ll>nums;
    for(int i=0;i<n;i++)
    {
        scanf("%lld %lld %lld",&num1,&num2,&num3);
        if(num2<5)
        {
            if(nums[num2]!=0 && num1-nums[num2]<=10)
            {
                ans1+=150;
            }
            else
            {
                ans1+=100;
            }
        }
        else
        {
            if(nums[num2]!=0 && num1-nums[num2]<=10)
            {
                ans2+=150;
            }
            else
            {
                ans2+=100;
            }
        }
        nums[num2]=num1;
    }
    printf("%lld %lld",ans1,ans2);
}

Compilation message (stderr)

Main.cpp: In function 'int main()':
Main.cpp:39:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   39 |     scanf("%lld",&n);
      |     ~~~~~^~~~~~~~~~~
Main.cpp:43:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |         scanf("%lld %lld %lld",&num1,&num2,&num3);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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