| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 661264 | Kenpar | Med (COCI22_med) | C++17 | 47 ms | 352 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 "bits/stdc++.h"
using namespace std;
#define ll long long
#define endl '\n'
const ll MOD = 1e9+7;
const ll INF = 1e16;
const ll MAX = 2 * 1e5;
void solve(){
int n;
cin>>n;
vector<pair<int,string>> arr(n);
for(int i = 0; i < n; i++){
string s; cin>>s;
int sum = 0;
for(int j = 0; j < 5; j++){
int temp; cin>>temp;
sum+=temp;
}
arr[i] = {sum, s};
}
for(int i = 0; i < n; i++){
vector<pair<int,string>> temp = arr;
temp[i].first += 500;
int cur = temp[i].first;
sort(temp.begin(), temp.end(), [ ]( const pair<int, string>& l, const pair<int, string>& r )
{
if(l.first > r.first) return true;
if(l.first == r.first){
return string(r.second) > string(l.second);
}
return false;
});
int counter = 1;
for(pair<int,string> a : temp){
if(a.second == arr[i].second) break;
counter++;
}
cout<<counter<<" ";
temp = arr;
temp[i].first -=500;
cur = temp[i].first;
sort(temp.begin(), temp.end(), [ ]( const pair<int, string>& l, const pair<int, string>& r )
{
if(l.first > r.first) return true;
if(l.first == r.first){
return string(r.second) > string(l.second);
}
return false;
});
counter = 1;
for(pair<int,string> a : temp){
if(a.second == arr[i].second) break;
counter++;
}
cout<<counter<<endl;
}
}
int main()
{
cin.tie(NULL);
ios::sync_with_stdio(NULL);
int t = 1;
//cin>>t;
int temp = t;
while(t--){
//cout<<"Case #"<<temp - t<<" > "<<endl;
solve();
cout<<endl;
}
cout.flush();
}Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
