oj.uz

답안 #661264

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
661264 2022-11-25T06:10:27 Z Kenpar Med (COCI22_med) C++17
50 / 50
 47 ms 352 KB 
#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

Main.cpp: In function 'void solve()':
Main.cpp:35:7: warning: variable 'cur' set but not used [-Wunused-but-set-variable]
   35 |   int cur = temp[i].first;
      |       ^~~
Main.cpp: In function 'int main()':
Main.cpp:89:9: warning: unused variable 'temp' [-Wunused-variable]
   89 |     int temp = t;
      |         ^~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 324 KB Output is correct
4 Correct 0 ms 212 KB Output is correct

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 324 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 21 ms 340 KB Output is correct
6 Correct 40 ms 320 KB Output is correct
7 Correct 25 ms 340 KB Output is correct
8 Correct 47 ms 352 KB Output is correct
9 Correct 13 ms 340 KB Output is correct