| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1329759 | secondaccountmaybe | Ljeto (COCI21_ljeto) | C++20 | 1 ms | 344 KiB |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n;
cin>>n;
ll p=0;
ll b=0;
vector<ll>l(9,-100);
for(ll i=0;i<n;i++)
{
ll t;
ll a;
ll s;
cin>>t>>a>>s;
if(a<=4)
{
p+=100;
if(t-l[a]<=10)
{
p+=50;
}
l[a]=t;
}
else
{
b+=100;
if(t-l[a]<=10)
{
b+=50;
}
l[a]=t;
}
}
cout<<p<<" "<<b<<endl;
return 0;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
