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>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define foru(i, l, r) for(int i = l; i <= r; i++)
#define ford(i, r, l) for(int i = r; i >= l; i--)
#define __TIME (1.0 * clock() / CLOCKS_PER_SEC)
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;
const int N = 500 + 5;
const int oo = 1e9, mod = 1e9 + 7;
int n;
ii ans[N];
ii coms[N];
map<int, string> dick;
void process() {
int n;
cin >> n;
vector<int> sum(n);
vector<string> s(n);
for (int i = 0; i < n; i++)
{
cin >> s[i];
for (int j = 0; j < 5; j++)
{
int day;
cin >> day;
sum[i] += day;
}
}
for (int i = 0; i < n; i++)
{
int minn = n, maxx = n;
int misum = sum[i] + 500, masum = sum[i] - 500;
for (int j = 0; j < n; j++)
{
if (i == j)
{
continue;
}
if (misum > sum[j] || (misum == sum[j] && s[i] < s[j]))
{
minn--;
}
if (masum > sum[j] || (masum == sum[j] && s[i] < s[j]))
{
maxx--;
}
}
cout << minn << " " << maxx << "\n";
}
return;
}
signed main() {
cin.tie(0)->sync_with_stdio(false);
//freopen(".inp", "r", stdin);
//freopen(".out", "w", stdout);
process();
cerr << "Time elapsed: " << __TIME << " s.\n";
return 0;
}
// dont stop
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |