# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1176960 | fritl | Ljeto (COCI21_ljeto) | C++20 | 0 ms | 328 KiB |
#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,res1=0,Res1=0,res2=0,Res2=0,ans1=0,ans2=0;
scanf("%lld",&n);
for(int i=0;i<n;i++)
{
scanf("%lld %lld %lld",&num1,&num2,&num3);
if(num2<num3)
{
ans1+=100;
if(num1-res1>=1 && num1-res1<=10 && res1!=0 && Res1==num2)
{
ans1+=50;
}
res1=num1,Res1=num2;
}
else
{
ans2+=100;
if(num1-res2>=1 && num1-res2<=10 && res2!=0 && Res2==num3)
{
ans2+=50;
}
res2=num1,Res2=num3;
}
}
printf("%lld %lld",ans1,ans2);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |