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 pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define rall(x) x.rbegin(), x.rend()
//#define int long long
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;
void setIO() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
int32_t main() {
setIO();
int n;
cin >> n;
vector<vector<int> > players(9);
for(int i=0; i<n; i++) {
int t, a, b;
cin >> t >> a >> b;
players[a].push_back(t);
}
for(int i=1; i<=8; i++)
sort(all(players[i]));
ll ans1 = 0, ans2 = 0;
for(int i=1; i<=4; i++) {
int last = -10;
for(int &x : players[i]) {
ans1 += 100;
if(x - last <= 10) ans1 += 50;
last = x;
}
}
for(int i=5; i<=8; i++) {
int last = -10;
for(int &x : players[i]) {
ans2 += 100;
if(x - last <= 10) ans2 += 50;
last = x;
}
}
cout << ans1 << " " << ans2 << '\n';
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... |