| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 851484 | cjtsai | Ljeto (COCI21_ljeto) | C++14 | 1 ms | 348 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<iostream>
#include <algorithm>
#include <vector>
#define ff first
#define ss second
#define piii pair<int, pair<int, int>>
using namespace std;
signed main(){
int n;cin>>n;
vector<piii> li(n);
for(int i=0; i<n; i++){
int a, b, c;cin>>a>>b>>c;
li[i]={a, {b, c}};
}
sort(li.begin(), li.end());
int ta=0, tb=0;
vector<int> is(9, -100);
for(int i=0; i<n; i++){
int at=li[i].ff, aa=li[i].ss.ff, ab=li[i].ss.ss;
if(is[aa]>i-10){
if(aa>4&&ab<5) {tb+=150;is[aa]=i;}
if(aa<5&&ab>4) {ta+=150;is[aa]=i;}
}else{
if(aa>4&&ab<5) {tb+=100;is[aa]=i;}
if(aa<5&&ab>4) {ta+=100;is[aa]=i;}
}
}
cout<<ta<<' '<<tb;
}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... | ||||
