| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1176934 | fritl | Ljeto (COCI21_ljeto) | C++20 | 0 ms | 328 KiB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll n;
cin>>n;
ll a[n],b[n],t[n],s1=0,s2=0;
map<ll,ll>m;
for (int i=0; i<n; i++)
cin>>t[i]>>a[i]>>b[i];
for (int i=0; i<n; i++)
{
if (a[i]<5)
{
if (m[a[i]]!=0 && t[i]-m[a[i]]<11)
s1+=150;
else
s1+=100;
}
else
{
if (m[a[i]]!=0 && t[i]-m[a[i]]<11)
s2+=150;
else
s2+=100;
}
m[a[i]]=t[i];
}
cout<<s1<<' '<<s2;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
