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 <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define ve vector
#define all(x) x.begin(), x.end()
#define pb(x) push_back(x)
using namespace std;
mt19937 rnd;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
void solve(){
int n;
cin >> n;
ve<int> lst(8, -1e9);
int ans[2] = {0, 0};
for(int i = 0; i < n; i++){
int t, a, b;
cin >> t >> a >> b;
a--; b--;
int pr = 100;
if(lst[a] >= t - 10)
pr += 50;
lst[a] = t;
ans[a >= 4] += pr;
}
cout << ans[0] << " " << ans[1];
}
signed main(){
ios_base::sync_with_stdio(0); cin.tie(0);
int T = 1;
// cin >> T;
while(T--){
solve();
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |