Submission #932902

#TimeUsernameProblemLanguageResultExecution timeMemory
932902Amirreza_FakhriMed (COCI22_med)C++17
50 / 50
1 ms348 KiB
// In the name of the God #include <bits/stdc++.h> #define ll long long // #define int long long #define pb push_back #define F first #define S second #define mp make_pair #define pii pair <int, int> #define smin(x, y) (x) = min((x), (y)) #define smax(x, y) (x) = max((x), (y)) #define all(x) (x).begin(), (x).end() using namespace std; const int inf = 1e9+7; const int mod = 998244353; const int maxn = 5e2+5; int n, a[maxn]; string s[maxn]; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; for (int i = 0; i < n; i++) { cin >> s[i]; for (int j = 0; j < 5; j++) { int x; cin >> x; a[i] += x; } } for (int i = 0; i < n; i++) { int mx = 0, mn = 0; for (int j = 0; j < n; j++) { if (i == j) continue; if (a[i]+500 > a[j]) mx++; else if (a[i]+500 == a[j] and s[i] < s[j]) mx++; if (a[i] < a[j]+500) mn++; else if (a[i] == a[j]+500 and s[i] > s[j]) mn++; } cout << n-mx << ' ' << mn+1 << '\n'; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...