# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1176919 | vuqar_fritl | Ljeto (COCI21_ljeto) | C++20 | 1 ms | 328 KiB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
long long a[8];
long long x[8];
int main()
{
ll b,c,d,f,t,n;
cin>>n;
for(int i=1;i<=n;i++){
cin>>b>>c>>d;
if(a[c]>0){
x[c]+=50;
}
x[c]+=100;
a[c]++;
}
cout<<x[1]+x[2]+x[3]+x[4]<<" "<<x[5]+x[6]+x[7]+x[8];
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |